EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

SIMD-vectorized implicit symplectic integrators can outperform explicit symplectic ones

Mikel Antoñana, Joseba Makazaga, Ander Murua

Numerical Algorithms · 09.04.2026

DOI: 10.1007/s11075-026-02370-3 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Numerical Algorithms, online erschienen am 09.04.2026. Verfasst von Mikel Antoñana und 2 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 26 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Universidad del País Vasco.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Implicit Runge-Kutta schemes based on collocation with Gauss-Legendre nodes (IRKGL) possess attractive theoretical properties for long-term integration of Hamiltonian systems—they are symmetric, symplectic, and super-convergent—yet they have traditionally been considered less practical than explicit symplectic integrators. In this work, we challenge this conventional wisdom by introducing a stage-wise SIMD-vectorization approach that enables IRKGL schemes to outperform state-of-the-art explicit symplectic integrators for high-precision computations in double-precision floating-point arithmetic. Our approach reformulates the fixed-point iteration in terms of s -vectors (where s is the number of stages) to explicitly exploit Single Instruction Multiple Data (SIMD) capabilities of modern processors, significantly reducing computational overhead and enabling parallel evaluation of the right-hand side function across all stages. Additionally, we present a reformulation of IRKGL schemes for second-order ODEs that ensures exact symplecticity at the level of double-precision floating-point arithmetic, extending our previous approach for first-order systems to this setting. We demonstrate these ideas through IRKGL16, a Julia implementation of the 16th-order 8-stage IRKGL scheme that performs vectorization seamlessly and transparently to the user. Numerical experiments on several Hamiltonian problems with separable structure confirm the effectiveness of our approach.

Förderung

  • Universidad del País Vasco

Zitieren

APA

Antoñana, M., Makazaga, J., & Murua, A. (2026). SIMD-vectorized implicit symplectic integrators can outperform explicit symplectic ones. Numerical Algorithms. https://doi.org/10.1007/s11075-026-02370-3

Vancouver

Antoñana M, Makazaga J, Murua A. SIMD-vectorized implicit symplectic integrators can outperform explicit symplectic ones. Numerical Algorithms. 2026. doi:10.1007/s11075-026-02370-3

BibTeX
@article{Antoana2026,
  author = {Antoñana, Mikel and Makazaga, Joseba and Murua, Ander},
  title = {SIMD-vectorized implicit symplectic integrators can outperform explicit symplectic ones},
  journal = {Numerical Algorithms},
  year = {2026},
  doi = {10.1007/s11075-026-02370-3}
}
Kostenlos starten →