A basic theorem in the computation of ellipsoidal error bounds
From MaRDI portal
Publication:2549567
The basic principles of a procedure for computing a bound on the error in the numerical solution of a system of linear differential equations are proved. The bound on the error at each integration step is expressed in terms of an ellipsoid whose size and orientation is determined by the computations. To illustrate the procedure, Bessel's equation (of order zero) is integrated over the interval \(2\leq x\leq 3\) at steps of length \(0.1\) and bounds on the error are given for each step.
Recommendations
Cites work
Cited in
(9)- The extension of Picard's successive approximation for constructing two- side bounds for the solutions of differential equations
- Rigorously computed orbits of dynamical systems without the wrapping effect
- Global, rigorous and realistic bounds for the solution of dissipative differential equations. I: Theory
- scientific article; zbMATH DE number 996053 (Why is no real title available?)
- A new single-step implicit integration algorithm with A-stability and improved accuracy
- scientific article; zbMATH DE number 802431 (Why is no real title available?)
- scientific article; zbMATH DE number 7324723 (Why is no real title available?)
- Narrow bounds for numerical integration of differential equations
- Large-Scale Scientific Computing
This page was built for publication: A basic theorem in the computation of ellipsoidal error bounds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2549567)
