Epsilon-inflation in verification algorithms

From MaRDI portal





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.



Cites work



Describes a project that uses

Uses Software






This page was built for publication: Epsilon-inflation in verification algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1900758)