A comparison of the Moore and Miranda existence tests
From MaRDI portal
Publication:1885286
DOI10.1007/s00607-004-0064-4zbMath1069.47060OpenAlexW2089972291MaRDI QIDQ1885286
Publication date: 28 October 2004
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00607-004-0064-4
Numerical computation of solutions to systems of equations (65H10) Fixed-point theorems (47H10) General methods in interval analysis (65G40) Algorithms with automatic result verification (65G20)
Related Items
A second-order pruning step for verified global optimization ⋮ Computing slope enclosures by exploiting a unique point of inflection ⋮ Affine Point Processes: Approximation and Efficient Simulation ⋮ On computer-assisted proofs for solutions of linear complementarity problems ⋮ Proving the existence of zeros using the topological degree and interval arithmetic ⋮ Comparison of the Hansen-Sengupta and the Frommer-Lang-Schnurr existence tests ⋮ Unnamed Item ⋮ Effective topological degree computation based on interval arithmetic ⋮ Verified error bounds for multiple roots of systems of nonlinear equations
Uses Software
This page was built for publication: A comparison of the Moore and Miranda existence tests
