Root Finding With Interval Arithmetic
Walter F. Mascarenhas

TL;DR
This paper discusses the use of interval arithmetic for solving nonlinear equations in one variable, emphasizing the simplicity of single-variable problems and providing a C++ implementation.
Contribution
It offers a focused analysis of interval arithmetic methods for root finding in one variable and shares an open-source implementation.
Findings
Interval arithmetic simplifies single-variable root finding.
Specific methods are more effective for one-variable problems.
Open-source C++ code is provided for practical use.
Abstract
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 available under the Mozilla Public License 2.0.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNumerical Methods and Algorithms · Polynomial and algebraic computation · History and Theory of Mathematics
