A globally convergent interval method for computing and bounding real roots

DOI10.1007/BF01932020MaRDI QIDQ4176891zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• Bounding solutions of systems of equations using interval analysis
• scientific article; zbMATH DE number 3521417 (Why is no real title available?)
• scientific article; zbMATH DE number 3295652 (Why is no real title available?)
• Interval Arithmetic in Matrix Computations, Part I

Cited in

(15)

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

This page was built for publication: A globally convergent interval method for computing and bounding real roots

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