2000 character limit reached
Root Finding With Interval Arithmetic
Published 14 Oct 2021 in math.NA and cs.NA | (2110.07126v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.