An interval version of the secant method
From MaRDI portal
Publication:762884
DOI10.1007/BF02136035zbMATH Open0558.65027MaRDI QIDQ762884FDOQ762884
Authors: Arnold Neumaier
Publication date: 1984
Published in: BIT (Search for Journal in Brave)
Recommendations
Numerical computation of solutions to single equations (65H05) Interval and finite arithmetic (65G30)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- An algorithm with guaranteed convergence for finding a zero of a function
- Title not available (Why is that?)
- Interval iteration for zeros of systems of equations
- On computing the range of values
- Title not available (Why is that?)
- Title not available (Why is that?)
- An improved pegasus method for root finding
Cited In (9)
- An interval iteration for multiple roots of transcendental equations
- The secant method and divided differences Hölder continuous
- Interval versions of some procedures for the simultaneous estimation of complex polynomial zeros
- A hybrid method for polynomial complex zero
- Hybrid inclusion algorithms for polynomial multiple complex zeros in rectangular arithmetic
- Title not available (Why is that?)
- Interval iteration for zeros of systems of equations
- Existence of solutions of piecewise differentiable systems of equations
- Title not available (Why is that?)
This page was built for publication: An interval version of the secant method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q762884)