An interval version of the secant method

DOI10.1007/BF02136035zbMath0558.65027MaRDI QIDQ762884

Arnold Neumaier

Publication date: 1984

Published in: BIT (Search for Journal in Brave)

zbMATH Keywords

global convergencesecant methodInterval arithmeticlocal zero finder

Mathematics Subject Classification ID

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

Related Items (6)

Existence of solutions of piecewise differentiable systems of equations ⋮ An interval iteration for multiple roots of transcendental equations ⋮ Interval versions of some procedures for the simultaneous estimation of complex polynomial zeros ⋮ Hybrid inclusion algorithms for polynomial multiple complex zeros in rectangular arithmetic ⋮ A hybrid method for polynomial complex zero ⋮ Interval iteration for zeros of systems of equations

Cites Work

• Interval iteration for zeros of systems of equations
• On computing the range of values
• An algorithm with guaranteed convergence for finding a zero of a function
• An improved pegasus method for root finding
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An interval version of the secant method