A comparison of the Moore and Miranda existence tests

Authors:
A. Frommer;B. Lang;M. Schnurr
Affiliations:
Angewandte Informatik, Fachbereich Mathematik und Naturwissenschaften, Bergische Universität Wuppertal, Wuppertal, Germany;Angewandte Informatik, Fachbereich Mathematik und Naturwissenschaften, Bergische Universität Wuppertal, Wuppertal, Germany;Institut für Angewandte Mathematik, Fakultät für Mathematik, Universität Karlsruhe (TH), Karlsruhe, Germany
Venue:
Computing
Year:
2004

Citing 0
Cited 3

On computer-assisted proofs for solutions of linear complementarity problems

Journal of Computational and Applied Mathematics - Special issue: Scientific computing, computer arithmetic, and validated numerics (SCAN 2004)
Proving the existence of zeros using the topological degree and interval arithmetic

Journal of Computational and Applied Mathematics - Special issue: Scientific computing, computer arithmetic, and validated numerics (SCAN 2004)
A second-order pruning step for verified global optimization

Journal of Global Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

We compare two computational tests for the existence of a zero of a nonlinear system. One of the tests is based on a theorem by Moore, the other relies on Miranda's theorem. It turns out that the Miranda test is always at least as powerful as the Moore test. We also indicate some conditions under which both tests are equivalent.