Interval iteration for zeros of systems of equations
From MaRDI portal
Publication:1064017
DOI10.1007/BF01935003zbMATH Open0575.65045MaRDI QIDQ1064017FDOQ1064017
Authors: Arnold Neumaier
Publication date: 1985
Published in: BIT (Search for Journal in Brave)
Recommendations
error boundsglobal convergenceinterval mathematicslocal methodrounded interval arithmeticquadratically convergent method
Numerical computation of solutions to systems of equations (65H10) Interval and finite arithmetic (65G30)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Interval Arithmetic in Matrix Computations, Part II
- New techniques for the analysis of linear interval equations
- Title not available (Why is that?)
- Abbruch beim Intervall-Gauß-Algorithmus
- An interval version of the secant method
- Title not available (Why is that?)
- Ein hinreichendes Kriterium für die Durchführbarkeit des Intervall-Gauss-Algorithmus bei Intervall-Hessenberg-Matrizen ohne Pivotsuche
- An improved interval Newton operator
- Title not available (Why is that?)
Cited In (30)
- Interval Newton operators for function strips
- A globally convergent interval Newton's method for computing and bounding real roots of a function with one variable
- Safe bounds for the solutions of nonlinear problems using a parallel multisplitting method
- A generalisation of the interval Newton single-step method for nonlinear systems of equations
- On interval operators obtained by splitting the Lipschitz matrix
- Title not available (Why is that?)
- An interval algorithm for nondifferentiable global optimization
- Existence of a unique zero of nonlinear systems
- The directional instability problem in systems with frictional contacts.
- On Newton-like methods to enclose solutions of nonlinear equations
- Extremal results for algebraic linear interval systems
- Interval versions of some procedures for the simultaneous estimation of complex polynomial zeros
- Nonlinear equations and optimization
- Rigorous sensitivity analysis for parameter-dependent systems of equations
- An interval version of the secant method
- Decompostition of arithmetic expressions to improve the behavior of interval iteration for nonlinear systems
- Interval Newton/generalized bisection when there are singularities near roots
- Interval observer design for consistency checks of nonlinear continuous-time systems
- Efficient methods for enclosing solutions of systems of nonlinear equations
- Interval solution of nonlinear equations using linear programming
- A ball Newton point algorithm for bounding zeros of analytic functions
- \textit{Helios}: A modeling language for global optimization and its implementation in \textit{Newton}
- Calculation of exact bounds for the solution set of linear interval systems
- A gentle introduction to Numerica
- Further results on linear interval equations
- Optimal Enclosure of a Generalized Zero Set of a Function Strip
- Finding all solutions of a class of nonlinear equations using an improved LP test
- The evolution and rate problems and the computation of all possible evolutions in quasi-static frictional contact.
- Convergence of Newton-like methods for nonlinear systems
- Formulation assistance for global optimization problems
This page was built for publication: Interval iteration for zeros of systems of equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1064017)