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

DOI10.1007/BF02253433zbMath0739.65049OpenAlexW2159427065MaRDI QIDQ1180347

Ralph Baker Kearfott

Publication date: 27 June 1992

Published in: Computing (Search for Journal in Brave)

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

zbMATH Keywords

algorithmscomparisonautomatic differentiationinterval arithmeticexperimental resultsnonlinear algebraic systemsHansen-Greenberg algorithmpreconditioned interval Gauss-Seidel method

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10) Interval and finite arithmetic (65G30) Numerical differentiation (65D25)

Related Items (15)

A robust approach for finding all well-separated solutions of sparse systems of nonlinear equations ⋮ Constraint propagation on quadratic constraints ⋮ Interval solution of nonlinear equations using linear programming ⋮ Domain reduction techniques for global NLP and MINLP optimization ⋮ Efficient interval partitioning-local search collaboration for constraint satisfaction ⋮ Mathematically Rigorous Global Optimization and Fuzzy Optimization ⋮ Efficient interval partitioning for constrained global optimization ⋮ Finding all solutions of a class of nonlinear equations using an improved LP test ⋮ Assessment of a non-adaptive deterministic global optimization algorithm for problems with low-dimensional non-convex subspaces ⋮ Validated constraints solving --- practicalities, pitfalls, and new developments ⋮ Discussion and empirical comparisons of linear relaxations and alternate techniques in validated deterministic global optimization ⋮ Interval mathematics, algebraic equations and optimization ⋮ Computation of the solutions of nonlinear polynomial systems ⋮ Computation of singularities and intersections of offsets of planar curves ⋮ Interval analysis on directed acyclic graphs for global optimization

Uses Software

• INTBIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An interval Newton method
• Interval iteration for zeros of systems of equations
• Interval Newton/generalized bisection when there are singularities near roots
• The Krawczyk operator and Kantorovich's theorem
• Preconditioners for the Interval Gauss–Seidel Method
• A note on the comparison of the Kantorovich and Moore theorems
• Interval Slopes for Rational Functions and Associated Centered Forms
• Abstract Generalized Bisection and a Cost Bound
• Interval Methods for Systems of Equations
• Safe Starting Regions for Iterative Methods
• Algorithm 681: INTBIS, a portable interval Newton/bisection package

This page was built for publication: Decompostition of arithmetic expressions to improve the behavior of interval iteration for nonlinear systems