We study the enclosing problem for discrete and continuous dynamical systems in the context of computer assisted proofs. We review and compare the existing methods and emphasize the importance of developing a suitable set arithmetic for efficient algorithms solving the enclosing problem.
We propose an efficient method for finding a Chebyshev-best soluble approximation to an insoluble system of linear equations over max-plus algebra.
The Lyapunov exponent is a statistic that measures the sensitive dependence of the dynamic behaviour of a system on its initial conditions. Estimates of Lyapunov exponents are often used to characterize the qualitative population dynamics of insect time series. The methodology for estimation of the exponent for an observed, noisy, short ecological time series is still under development. Some progress has been made recently in providing measures of error for these exponents. Studies that do not account...
The Lyapunov exponents (LE) provide a simple numerical measure of the sensitive dependence of the dynamical system on initial conditions. The positive LE in dissipative systems is often regarded as an indicator of the occurrence of deterministic chaos. However, the values of LE can also help to assess stability of particular solution branches of dynamical systems. The contribution brings a short review of two methods for estimation of the largest LE from discrete data series. Two methods are analysed...
The parareal in time algorithm allows for efficient parallel numerical simulations of time-dependent problems. It is based on a decomposition of the time interval into subintervals, and on a predictor-corrector strategy, where the propagations over each subinterval for the corrector stage are concurrently performed on the different processors that are available. In this article, we are concerned with the long time integration of Hamiltonian systems. Geometric, structure-preserving integrators are...