Interval Newton/generalized bisection when there are singularities near roots

DOI10.1007/BF02283694zbMath0746.90066OpenAlexW2031576555MaRDI QIDQ1173718

Ralph Baker Kearfott

Publication date: 25 June 1992

Published in: Annals of Operations Research (Search for Journal in Brave)

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

zbMATH Keywords

singularitiesglobal optimuminterval Newton methodsnonlinear algebraic systemsgeneralized bisectiontwice differentiable function

Mathematics Subject Classification ID

Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (1)

Decompostition of arithmetic expressions to improve the behavior of interval iteration for nonlinear systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Interval iteration for zeros of systems of equations
• Global optimization using interval analysis - the multi-dimensional case
• Bounding solutions of systems of equations using interval analysis
• Rigorous sensitivity analysis for parameter-dependent systems of equations
• Preconditioners for the Interval Gauss–Seidel Method
• Some Computable Existence, Uniqueness, and Convergence Tests for Nonlinear Systems
• Abstract Generalized Bisection and a Cost Bound
• Some tests of generalized bisection
• Safe Starting Regions for Iterative Methods
• On Solving Systems of Equations Using Interval Arithmetic

This page was built for publication: Interval Newton/generalized bisection when there are singularities near roots