Tomasz Kapela
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Tomasz Kapela has a total of 21 co-authors. Here are the top co-authors by number of shared publications:
- Daniel Wilczak
Faculty of Mathematics and Computer Science Jagiellonian University Łojasiewicza 6 30-348 Kraków Poland
3 shared publications - Marian Mrozek
Division of Computational Mathematics, Faculty of Mathematics and Computer Science, Jagiellonian University, Kraków, Poland
3 shared publications - Piotr Zgliczyński
Jagiellonian University, Krakow, Poland
2 shared publications Carles Simó
University de Barcelona
1 shared publication- Carles Simó
Departament de Matemàtiques i Informàtica, Universitat de Barcelona, Barcelona, Spain
1 shared publication - Damian Sadowski
Jagiellonian University
1 shared publication
Latest Publications
- Open Access
- 4 November 2023
- Published by Springer Nature in Journal of Applied and Computational Topology
- Vol. 8 (4) , 875-908
Rigorous computation in dynamics based on topological methods for multivector fields
Motivated by the theoretical results of Mrozek et al. (Commun Nonlinear Sci Numer Simul 108:106–226, 2022) we present an algorithmic construction of a transversal cellular decomposition for a planar ODE. We then use the associated combinatorial multivector field to algorithmically detect the existence of an isolated invariant set with the Conley index of a periodic orbit and admitting a combinatorial Poincaré section. This construction combined with the theoretical results of Mrozek et al. (2022) leads to a method for automatized computer assisted proofs of the existence of periodic solutions in ODE’s.
- 4 November 2023
- Published by Springer Nature in Journal of Applied and Computational Topology
- Vol. 8 (4) , 875-908
Open AccessRigorous computation in dynamics based on topological methods for multivector fields
Motivated by the theoretical results of Mrozek et al. (Commun Nonlinear Sci Numer Simul 108:106–226, 2022) we present an algorithmic construction of a transversal cellular decomposition for a planar ODE. We then use the associated combinatorial multivector field to algorithmically detect the existence of an isolated invariant set with the Conley index of a periodic orbit and admitting a combinatorial Poincaré section. This construction combined with the theoretical results of Mrozek et al. (2022) leads to a method for automatized computer assisted proofs of the existence of periodic solutions in ODE’s.
- 2 March 2022
- Published by Elsevier in Communications in Nonlinear Science and Numerical Simulation
- Vol. 110
Recent advances in a rigorous computation of Poincaré maps
- 2 March 2022
- Published by Elsevier in Communications in Nonlinear Science and Numerical Simulation
- Vol. 110
Recent advances in a rigorous computation of Poincaré maps
- Top Cited Papers
- 1 October 2021
- Published by Elsevier in Communications in Nonlinear Science and Numerical Simulation
- Vol. 101
CAPD::DynSys: A flexible C++ toolbox for rigorous numerical analysis of dynamical systems
- 1 October 2021
- Published by Elsevier in Communications in Nonlinear Science and Numerical Simulation
- Vol. 101
Top Cited PapersCAPD::DynSys: A flexible C++ toolbox for rigorous numerical analysis of dynamical systems
- Open Access
CAPD::DynSys: a flexible C++ toolbox for rigorous numerical analysis of dynamical systems
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.
Open AccessCAPD::DynSys: a flexible C++ toolbox for rigorous numerical analysis of dynamical systems
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.
- 2 January 2019
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Applied Dynamical Systems
- Vol. 18 (1) , 510-530
Persistent Homology of Morse Decompositions in Combinatorial Dynamics
We investigate combinatorial dynamical systems on simplicial complexes considered as 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 Morse decompositions of such systems as a tool for validating the reconstruction. Our approach may be viewed as a step toward applying the classical persistence theory to data collected from a dynamical system. We present experimental results on two numerical examples.
- 2 January 2019
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Applied Dynamical Systems
- Vol. 18 (1) , 510-530
Persistent Homology of Morse Decompositions in Combinatorial Dynamics
We investigate combinatorial dynamical systems on simplicial complexes considered as 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 Morse decompositions of such systems as a tool for validating the reconstruction. Our approach may be viewed as a step toward applying the classical persistence theory to data collected from a dynamical system. We present experimental results on two numerical examples.
- Open Access
Persistent Homology of Morse Decompositions in Combinatorial Dynamics
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.
Open AccessPersistent Homology of Morse Decompositions in Combinatorial Dynamics
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.
- 18 January 2017
- Published by IOP Publishing in Nonlinearity
- Vol. 30 (3) , 965-986
Rigorous KAM results around arbitrary periodic orbits for Hamiltonian systems
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 two and three 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.
- 18 January 2017
- Published by IOP Publishing in Nonlinearity
- Vol. 30 (3) , 965-986
Rigorous KAM results around arbitrary periodic orbits for Hamiltonian systems
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 two and three 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.
- Open Access
- 1 January 2009
- Published by American Institute of Mathematical Sciences (AIMS) in Discrete and Continuous Dynamical Systems-Series B
- Vol. 11 (2) , 365-385
A Lohner-type algorithm for control systems andordinary differential inclusions
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.
- 1 January 2009
- Published by American Institute of Mathematical Sciences (AIMS) in Discrete and Continuous Dynamical Systems-Series B
- Vol. 11 (2) , 365-385
Open AccessA Lohner-type algorithm for control systems andordinary differential inclusions
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.
- 17 April 2007
- Published by IOP Publishing in Nonlinearity
- Vol. 20 (5) , 1241-1255
Computer assisted proofs for nonsymmetric planar choreographies and for stability of the Eight
- 17 April 2007
- Published by IOP Publishing in Nonlinearity
- Vol. 20 (5) , 1241-1255
Computer assisted proofs for nonsymmetric planar choreographies and for stability of the Eight
- 1 February 2005
- Published by World Scientific Pub Co Pte Ltd
- p. 999-1004
N-BODY CHOREOGRAPHIES WITH A REFLECTIONAL SYMMETRY - COMPUTER ASSISTED EXISTENCE PROOFS
- 1 February 2005
- Published by World Scientific Pub Co Pte Ltd
- p. 999-1004
N-BODY CHOREOGRAPHIES WITH A REFLECTIONAL SYMMETRY - COMPUTER ASSISTED EXISTENCE PROOFS