A globally convergent interval method for computing and bounding real roots

DOI10.1007/BF01932020zbMath0394.65013OpenAlexW2075367494MaRDI QIDQ4176891

Eldon R. Hansen

Publication date: 1978

Published in: BIT (Search for Journal in Brave)

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

zbMATH Keywords

Interval MethodInterval Newton MethodMultiple RootsReal Roots

Mathematics Subject Classification ID

Interval and finite arithmetic (65G30) Numerical computation of solutions to single equations (65H05)

Related Items

Modular global optimisation in chemical engineering, A combined method for enclosing all solutions of nonlinear systems of polynomial equations, Application of interval Newton's method to chemical engineering problems, Computational issues in solid boundary evaluation, Computing zeroes of spline functions, Interval solution of nonlinear equations using linear programming, Bounding solutions of systems of equations using interval analysis, Higher order multi-step interval iterative methods for solving nonlinear equations in \(\mathbb R^n\), An efficient algorithm for finding all solutions of separable systems of nonlinear equations, Finding all solutions of a class of nonlinear equations using an improved LP test, Global optimization using interval analysis: The one-dimensional case, The resolution of close minima, Nonlinear equations and optimization, Bounding the zeros of an interval equation, Optimierung mit Hilfe des Intervall-Newton-Verfahrens

Cites Work

• Bounding solutions of systems of equations using interval analysis
• Interval Arithmetic in Matrix Computations, Part I
• Unnamed Item
• Unnamed Item