arXiv subjects
Publications and source records attributed to Tomasz Kapela.
In this article we present recent advances on interval methods for rigorous computation of Poincaré maps. We also discuss the impact of choice of Poincaré section and coordinate system on obtained bounds for computing Poincaré map nearby fixed points.
We present the CAPD::DynSys library for rigorous numerical analysis of dynamical systems. The basic interface is described together with several interesting case studies illustrating how it can be used for computer-assisted proofs in dynamics of ODEs.
We investigate combinatorial dynamical systems on simplicial complexes considered as {\em finite topological spaces}. Such systems arise in a natural way from sampling dynamics and may be used to reconstruct some features of the dynamics directly from the sample. We study the homological persistence of {\em Morse decompositions} of such systems, an important descriptor of the dynamics, as a tool for validating the reconstruction. Our framework can be viewed as a step toward extending the classical persistence theory to "vector cloud" data. We present experimental results on two numerical examples.
We set up a methodology for computer assisted proofs of the existence and the KAM stability of an arbitrary periodic orbit for Hamiltonian systems. We give two examples of application for systems with 2 and 3 degrees of freedom. The first example verifies the existence of tiny elliptic islands inside large chaotic domains for a quartic potential. In the 3-body problem we prove the KAM stability of the well-known figure eight orbit and two selected orbits of the so called family of rotating Eights. Some additional theoretical and numerical information is also given for the dynamics of both examples.
We describe a Lohner-type algorithm for the computation of rigorous upper bounds for reachable set for control systems, solutions of ordinary differential inclusions and perturbations of ODEs.
We consider a question of finding a periodic solution for the planar Newtonian N-body problem with equal masses, where each body is travelling along the same closed path. We provide a computer assisted proof for the following facts: local uniqueness and convexity of Chenciner and Montgomery Eight, an existence (and local uniqueness) for Gerver's SuperEight for 4-bodies and a doubly symmetric linear chain for 6-bodies.