Отправить статью по E-mail The Computational Complexity of the Initial Value Problem for the Three Body Problem
- Авторы: Vasiliev N.N.1, Pavlov D.A.2
-
Учреждения:
- St.Petersburg Department of Steklov Institute of Mathematics, St.Petersburg Electrotechnical University
- Institute of Applied Astronomy of the Russian Academy of Sciences
- Выпуск: Том 224, № 2 (2017)
- Страницы: 221-230
- Раздел: Article
- URL: https://journals.rcsi.science/1072-3374/article/view/239529
- DOI: https://doi.org/10.1007/s10958-017-3407-3
- ID: 239529
Цитировать
Открытый доступ
Доступ предоставлен
Только для подписчиков
Аннотация
The paper is concerned with the computational complexity of the initial value problem (IVP) for a system of ordinary dynamical equations. A formal problem statement is given, containing a Turing machine with an oracle for getting the initial values as real numbers. It is proven that the computational complexity of the IVP for the three-body problem is not bounded by a polynomial. The proof is based on the analysis of oscillatory solutions of the Sitnikov problem, which have a complex dynamical behavior. These solutions contradict the existence of an algorithm that solves the IVP in polynomial time. Bibliography: 12 titles.
Об авторах
N. Vasiliev
St.Petersburg Department of Steklov Institute of Mathematics, St.Petersburg Electrotechnical University
Автор, ответственный за переписку.
Email: vasiliev@pdmi.ras.ru
Россия, St.Petersburg
D. Pavlov
Institute of Applied Astronomy of the Russian Academy of Sciences
Email: vasiliev@pdmi.ras.ru
Россия, St.Petersburg
Дополнительные файлы
