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 …
The basic interface is described together with several interesting case studies illustrating …
A graduate introduction to numerical methods
This book is designed to be used by mathematicians, engineers, and computer scientists as
a graduate-level introduction to numerical analysis and its methods. Readers are expected …
a graduate-level introduction to numerical analysis and its methods. Readers are expected …
Validated explicit and implicit Runge-Kutta methods
A set of validated numerical integration methods based on explicit and implicit Runge-Kutta
schemes is presented to solve, in a guaranteed way, initial value problems of ordinary …
schemes is presented to solve, in a guaranteed way, initial value problems of ordinary …
Recent advances in a rigorous computation of Poincaré maps
Recent advances in a rigorous computation of Poincaré maps - ScienceDirect Skip to main
contentSkip to article Elsevier logo Journals & Books Search RegisterSign in View PDF …
contentSkip to article Elsevier logo Journals & Books Search RegisterSign in View PDF …
Some recent advances in validated methods for IVPs for ODEs
Compared to standard numerical methods for initial value problems (IVPs) for ordinary
differential equations (ODEs), validated methods (often called interval methods) for IVPs for …
differential equations (ODEs), validated methods (often called interval methods) for IVPs for …
An effective high-order interval method for validating existence and uniqueness of the solution of an IVP for an ODE
Validated methods for initial value problems for ordinary differential equations produce
bounds that are guaranteed to contain the true solution of a problem. When computing such …
bounds that are guaranteed to contain the true solution of a problem. When computing such …
C 1 Lohner Algorithm
P Zgliczynski - Foundations of computational mathematics, 2002 - Springer
We present a modification of the Lohner algorithm for the computation of rigorous bounds for
solutions of ordinary differential equations together with partial derivatives with respect to …
solutions of ordinary differential equations together with partial derivatives with respect to …
Interval tools for ODEs and DAEs
NS Nedialkov - … Arithmetic and Validated Numerics (SCAN 2006 …, 2006 - ieeexplore.ieee.org
We overview the current state of interval methods and software for computing bounds on
solutions in initial value problems (IVPs) for ordinary differential equations (ODEs). We …
solutions in initial value problems (IVPs) for ordinary differential equations (ODEs). We …
A hybrid bounding method for computing an over-approximation for the reachable set of uncertain nonlinear systems
In this paper, we show how to compute an over-approximation for the reachable set of
uncertain nonlinear continuous dynamical systems by using guaranteed set integration. We …
uncertain nonlinear continuous dynamical systems by using guaranteed set integration. We …
Unified framework for the propagation of continuous-time enclosures for parametric nonlinear ODEs
This paper presents a framework for constructing and analyzing enclosures of the reachable
set of nonlinear ordinary differential equations using continuous-time set-propagation …
set of nonlinear ordinary differential equations using continuous-time set-propagation …