Benchmark: Tao's symplectic integration method
Fuente:
arXiv
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866909285930237952 |
|---|---|
| author | Lazarotto, Matheus Caldas, Iberê Elskens, Yves |
| author_facet | Lazarotto, Matheus Caldas, Iberê Elskens, Yves |
| contents | A benchmark test was conducted for a new symplectic integration method originally developed by Molei Tao. The method raises interest due to its explicit evolution equation, with applicability to both separable and non-separable Hamiltonian systems, and an easy-to-implement, easily generalizable algorithm. In order to compare the method with other, more well-known methods, namely Störmer-Verlet and Runge-Kutta, we conducted a series of benchmark tests comparing their performance in terms of CPU time, system invariants functions conservation, and numerical symplectic area conservation. Overall, it was found that despite being slower than the more optimized Runge-Kutta-Cash-Karp, Tao's method presents a similar performance to Störmer-Verlet, with the extra perk of being more generic and not requiring the use of implicit equations for the evolution of the equations of motion. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2407_15970 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Benchmark: Tao's symplectic integration method Lazarotto, Matheus Caldas, Iberê Elskens, Yves Computational Physics Chaotic Dynamics A benchmark test was conducted for a new symplectic integration method originally developed by Molei Tao. The method raises interest due to its explicit evolution equation, with applicability to both separable and non-separable Hamiltonian systems, and an easy-to-implement, easily generalizable algorithm. In order to compare the method with other, more well-known methods, namely Störmer-Verlet and Runge-Kutta, we conducted a series of benchmark tests comparing their performance in terms of CPU time, system invariants functions conservation, and numerical symplectic area conservation. Overall, it was found that despite being slower than the more optimized Runge-Kutta-Cash-Karp, Tao's method presents a similar performance to Störmer-Verlet, with the extra perk of being more generic and not requiring the use of implicit equations for the evolution of the equations of motion. |
| title | Benchmark: Tao's symplectic integration method |
| topic | Computational Physics Chaotic Dynamics |
| url | https://arxiv.org/abs/2407.15970 |