On certain computable tests and componentwise error bounds

DOI10.1007/BF02243877MaRDI QIDQ685872zbMATH OpenOpenAlexFDO

Authors Zuhe Shen, Michael A. Wolfe

Publication date 13 April 1994

Published in Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02243877

zbMATH Keywords

computable testserror boundsexistence testinterval arithmeticsystems of nonlinear equationsuniqueness testzeros of nonlinear functions

Mathematics Subject Classification ID

Interval and finite arithmetic (65G30) Numerical computation of solutions to systems of equations (65H10)

Review text

The authors give an overview on some existence and uniqueness tests for zeros of nonlinear functions \(f: \mathbb{R}^ n\to\mathbb{R}^ n\). They recall results of \textit{R. E. Moore} and \textit{J. B. Kioustelidis} [SIAM J. Numer. Anal. 17, 521-529 (1980; Zbl 0457.65031)], \textit{M. C. Pandian} [ibid. 22, 779-791 (1985; Zbl 0586.65041)], \textit{L. Qi} [ibid. 19, 851-857 (1982; Zbl 0506.65020)], the first author and \textit{A. Neumaier} [Computing 40, 85-90 (1988; Zbl 0629.65054)], the authors [Nonlinear Anal., Theory Methods Appl. 15, No. 3, 229-232 (1990; Zbl 0727.65045)]. They generalize some of these results, and they compare them in order to find out their quality. This is partly done theoretically and partly by examples.

Recommendations

• On the complexity of computing error bounds
• Complexity bounds for zero-test algorithms
• scientific article; zbMATH DE number 2162200
• On computable bounds of modeling errors
• A lower bound on the probability of error in multihypothesis testing
• Near Complete Decomposability: Bounding the Error by a Stochastic Comparison Method
• scientific article; zbMATH DE number 3854414
• On randomized semi-algebraic test complexity
• Computational complexity and property testing. On the interplay between randomness and computation

Cites work

• A Convergence Test and Componentwise Error Estimates for Newton Type Methods
• A note on Moore's interval test for zeros of nonlinear systems
• A note on the comparison of the Kantorovich and Moore theorems
• A Note on the Moore Test for Nonlinear Systems
• A Simple Test for Accuracy of Approximate Solutions to Nonlinear (or Linear) Systems
• Algorithmic error estimation for approximate solutions of nonlinear systems of equations
• scientific article; zbMATH DE number 3874507 (Why is no real title available?)
• scientific article; zbMATH DE number 3880009 (Why is no real title available?)
• scientific article; zbMATH DE number 1263372 (Why is no real title available?)
• scientific article; zbMATH DE number 3381785 (Why is no real title available?)
• Interval Methods for Systems of Equations
• Perturbation Bounds for Nonlinear Equations
• Slope tests for Newton-type methods

Cited in

(11)

• Slope tests for Newton-type methods
• Inclusion of zeros of nowhere differentiable n-dimensional functions
• Interval mathematics, algebraic equations and optimization
• Interval methods for global optimization
• On the componentwise Krawczyk-Moore iteration
• On preconditioners for the Borsuk existence test
• scientific article; zbMATH DE number 3934308 (Why is no real title available?)
• Some Computable Existence, Uniqueness, and Convergence Tests for Nonlinear Systems
• A Convergence Test and Componentwise Error Estimates for Newton Type Methods
• Existence test for solution of nonlinear systems applying affine arithmetic
• A comparison of simple tests for accuracy of approximate solutions to nonlinear systems with uncertain data

This page was built for publication: On certain computable tests and componentwise error bounds

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