Self-validating methods
A self-validating (SV) method -- also called verification method or automatic result verification -- aims to deliver rigorous results even when computing with floating point numbers. It includes the proof of existence and possibly uniqueness of a solution. The paper sketches arithmetical issues in order to guarantee a safe validation process of assumptions and presents some details and examples on how SV methods work. It starts with a theoretical definition of interval arithmetic, continues with remarks on practical implementations using rounding control and shows the misuse of interval arithmetic by means of a simple example. In addition, it illustrates the efficiency of interval arithmetic by a typical approach of SV methods to find a zero of a function \(f: \mathbb{R}^n\to \mathbb{R}^n\) and to find all solutions of linear systems \(Ax= b\) with \(A\), \(b\) varying in a given interval matrix \({\mathbf A}\) and a given interval vector \({\mathbf b}\), respectively. General remarks on basic approaches to many SV methods as well as open problems in this area conclude the paper.
- Chaos in the Lorenz equations: A computer assisted proof. Part II: Details
- Computer methods and Borel summability applied to Feigenbaum's equation
- Global optimization using interval analysis: The one-dimensional case
- scientific article; zbMATH DE number 3649911 (Why is no real title available?)
- scientific article; zbMATH DE number 3880009 (Why is no real title available?)
- scientific article; zbMATH DE number 918334 (Why is no real title available?)
- scientific article; zbMATH DE number 1440908 (Why is no real title available?)
- Interval Methods for Systems of Equations
- On the existence of an eigenvalue below the essential spectrum
- Rigorous chaos verification in discrete dynamical systems
- The dynamics of the Jouanolou foliation on the complex projective 2-space
- Ten methods to bound multiple roots of polynomials
- Precise numerical computation
- Componentwise pseudospectrum of a matrix
- Solving the linear interval tolerance problem for weight initialization of neural networks
- Solving dense interval linear systems with verified computing on multicore architectures
- scientific article; zbMATH DE number 440785 (Why is no real title available?)
- Local discretization error bounds using interval boundary element method
- scientific article; zbMATH DE number 671951 (Why is no real title available?)
- scientific article; zbMATH DE number 714522 (Why is no real title available?)
- Interval boundary element method in the presence of uncertain boundary conditions, integration errors, and truncation errors
- Certifying algorithms
- scientific article; zbMATH DE number 1886428 (Why is no real title available?)
- scientific article; zbMATH DE number 1408651 (Why is no real title available?)
- Worst case bounds on the point-wise discretization error in boundary element method for the elasticity problem
- Computer algebra for guaranteed accuracy. How does it help?
- Principal minors. I: A method for computing all the principal minors of a matrix
- Interval finite elements as a basis for generalized models of uncertainty in engineering mechanics
This page was built for publication: Self-validating methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5929742)
