A new class of interval methods with higher order of convergence

DOI10.1007/BF02243144zbMath0675.65041OpenAlexW1580082012MaRDI QIDQ1122314

Florian A. Potra, G. E. Alefeld

Publication date: 1989

Published in: Computing (Search for Journal in Brave)

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

zbMATH Keywords

numerical examplesorder of convergenceinterval methodsinclusion of simple rootsinterval iteration procedure

Mathematics Subject Classification ID

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

Related Items (7)

Efficient methods for enclosing solutions of systems of nonlinear equations ⋮ Existence test for solution of nonlinear systems applying affine arithmetic ⋮ Interval solution of nonlinear equations using linear programming ⋮ An efficient algorithm for finding all solutions of separable systems of nonlinear equations ⋮ Some efficient methods for enclosing simple zeros of nonlinear equations ⋮ Finding all solutions of a class of nonlinear equations using an improved LP test ⋮ LP narrowing: A new strategy for finding all solutions of nonlinear equations

Uses Software

• Pascal-SC

Cites Work

• Unnamed Item
• Unnamed Item

This page was built for publication: A new class of interval methods with higher order of convergence