• Corpus ID: 238857023

# Root Finding With Interval Arithmetic

```@article{Mascarenhas2021RootFW,
title={Root Finding With Interval Arithmetic},
author={Walter F. Mascarenhas},
journal={ArXiv},
year={2021},
volume={abs/2110.07126}
}```
• W. Mascarenhas
• Published 14 October 2021
• Computer Science, Mathematics
• ArXiv
We consider the solution of nonlinear equations in one real variable, the problem usually called by root finding. Although this is an old problem, we believe that some aspects of its solution using interval arithmetic are not well understood, and we present our views on this subject. We argue that problems with just one variable are much simpler than problems with more variables, and we should use specific methods for them. We provide an implementation of our ideas in C++, and make this code…

## References

SHOWING 1-10 OF 17 REFERENCES
On solving systems of equations using interval arithmetic
Introduction. In this paper, we consider the problem of applying interval arithmetic to bound a solution of a system of nonlinear equations. Moore [1, Section 7.3] has discussed the same problem. His
ON THE CONVERGENCE OF SOME INTERVAL-ARITHMETIC MODIFICATIONS OF NEWTON ' S METHOD
.Abstract. In this paper we consider the meanwhile weJl-known interval-arithmetic modifications of the Newton's method and of the so-calJed simplifiedNewton's method for sohringsystemsof nonlinear
Interval Slopes for Rational Functions and Associated Centered Forms
• Mathematics
• 1985
For an arithmetic expression \$f(x)\$ involving N rational operations, an \$O(N)\$ algorithm is given which computes an interval enclosure for the set of slopes \$f[ {x,z} ]\$ where x ranges over an
The Cluster Problem in Global Optimization: the Univariate Case
• Mathematics
• 1993
The Cluster Problem in Global Optimization the Univariate Case. We consider a branch and bound method for enclosing all global minimizers of a nonlinearC 2 or C 1 objective function. In particular,
The cluster problem in multivariate global optimization
• Mathematics, Computer Science
J. Glob. Optim.
• 1994
Analysis of branch and bound methods for enclosing all unconstrained global minimizers of a nonconvex nonlinear twice-continuously differentiable objective function shows that the problem is highly related to the behavior of the objective function near the global minimizer and to the order of the corresponding interval extension.
Interval forms of Newtons method
• E. Hansen
• Mathematics, Computer Science
Computing
• 2005
It is shown that certain intervals in the methods can be replaced by real numbers, which improves the convergence properties of the methods.
Moore: Interval Arithmetic in C++20
The Moore library for interval arithmetic in C++20 is presented, it gives examples of how the library can be used, and explains the basic principles underlying its design.
Taylor Forms—Use and Limits
• A. Neumaier
• Mathematics, Computer Science
Reliab. Comput.
• 2003
This review is a response to recent discussions on the reliable computing mailing list, and to continuing uncertainties about the properties and merits of Taylor forms, multivariate higher degree
Geometric Computations with Interval and New Robust Methods: Applications in Computer Graphics, GIS and Computational Geometry
• Mathematics, Computer Science
• 2003
Numerical computations, geometric computations and arithmetic filters Interval analysis Interval Newton methods The exact sign of sum algorithm (ESSA) Intersection tests The SCCI-hybrid method for
On the Newton Method in Interval Analysis
Abstract : An interval type Newton method for vector equations in the n- dimensional Euclidean space is investigated.