How many timesteps for a cycle? Analysis of the Wisdom-Holman algorithm

DOI10.1023/A:1021934522015zbMATH Open1016.70002MaRDI QIDQ1599142FDOQ1599142

Authors: Divakar Viswanath 

Publication date: 17 August 2003

Published in: BIT (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 4164025
• Accurate Determination of Loop Iterations for Worst-Case Execution Time Analysis
• Analysis of practical step size selection in stochastic approximation algorithms
• An iterative algorithm to determine the number of time steps in path generation methods
• The number of steps in the Robinson-Schensted algorithm
• scientific article; zbMATH DE number 975789
• Efficient multiple time-stepping algorithms of higher order
• scientific article; zbMATH DE number 733791
• A Time-Stepping Algorithm for Parallel Computers

zbMATH Keywords

Duffing oscillatorHamiltoniansolar systemnearly integrable systemsKeplerian orbitsWisdom-Holman algorithm

Mathematics Subject Classification ID

Two-body problems (70F05) Nearly integrable Hamiltonian systems, KAM theory (70H08) Celestial mechanics (70F15) Computational methods for problems pertaining to mechanics of particles and systems (70-08)

This page was built for publication: How many timesteps for a cycle? Analysis of the Wisdom-Holman algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1599142)