Reducing the wrapping effect
When solving ordinary differential equations with interval methods, the main difficulty is the wrapping effect. This phenomenon has nothing to do with precision-controlled arithmetic, it rather is caused by bounding sets in \(\mathbb{R}^n\) componentwise. For instance the optimal componentwise bounds for the set \(A := \{x \mid x \in \mathbb{R}^2,\;|x_1|+ 2|x_2|\leq 2\}\) are provided by the interval \(I := \{x \mid x \in \mathbb{R}^2\), \(-2 \leq x_1 \leq 2\), \(-1 \leq x_2 \leq 1\}\). Though \(I\) is the smallest interval containing \(A\), the transition from \(A\) to \(I\) doubles the area. This is the wrapping effect. The author considers ordinary differential equations with tolerances in the input data. He describes an algorithm which, instead of intervals, uses a larger family of sets. The algorithm exhibits a very small wrapping effect, but it can be applied only to systems with two equations.
- Rigorously computed orbits of dynamical systems without the wrapping effect
- Wrapping effect and wrapping function
- Reachability analysis of linear dynamic systems with constant, arbitrary, and Lipschitz continuous inputs
- scientific article; zbMATH DE number 1694758 (Why is no real title available?)
- Logarithmic Reduction of the Wrapping Effect with Application to Ordinary Differential Equations
- scientific article; zbMATH DE number 3992839 (Why is no real title available?)
- scientific article; zbMATH DE number 802406 (Why is no real title available?)
- scientific article; zbMATH DE number 1396592 (Why is no real title available?)
- scientific article; zbMATH DE number 1440905 (Why is no real title available?)
- Condition and methods to suppress zonotope order reduction errors in robust state estimation using set-valued observer
This page was built for publication: Reducing the wrapping effect
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1893152)
