The computational complexity of the initial value problem for the three body problem
From MaRDI portal
Publication:2406877
DOI10.1007/s10958-017-3407-3zbMath1379.65049arXiv1704.08762OpenAlexW3104371433MaRDI QIDQ2406877
Publication date: 4 October 2017
Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1704.08762
Three-body problems (70F07) Nonlinear ordinary differential equations and systems (34A34) Numerical methods for initial value problems involving ordinary differential equations (65L05) Complexity and performance of numerical algorithms (65Y20)
Cites Work
- Unnamed Item
- Guaranteed Error Bounds for a Class of Picard-Lindelöf Iteration Methods
- Computational Complexity of Smooth Differential Equations
- Stable and Random Motions in Dynamical Systems
- Final motions in the three-body problem and symbolic dynamics
- The complexity of N-body simulation
- Effective Computability of Solutions of Ordinary Differential Equations The Thousand Monkeys Approach
This page was built for publication: The computational complexity of the initial value problem for the three body problem