Epsilon-inflation in verification algorithms (Q1900758): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 13:58, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Epsilon-inflation in verification algorithms |
scientific article |
Statements
Epsilon-inflation in verification algorithms (English)
0 references
16 June 1996
0 references
The paper deals with the problem of finite termination of verification algorithms using an \(\varepsilon\)-inflation (introduced by S. M. Rump). Sufficient conditions for finite termination are given, based essentially on the assumption of the \(P\)-contraction property of the response mapping. The results are illustrated on several examples including computations of verified enclosures for eigenvalues and singular values.
0 references
epsilon-inflation
0 references
self-validating method
0 references
interval computations
0 references
finite termination
0 references
verification algorithms
0 references
\(P\)-contraction property
0 references
eigenvalues
0 references
singular values
0 references
