The paper is mainly concerned with a modification of the secant method which is based on interval arithmetic ideas. Interval arithmetic is used to force global convergence of any local zero finder without sacrifying convergence speed. Unfortunately no numerical examples are given.
Recommendations
Cites work
- An algorithm with guaranteed convergence for finding a zero of a function
- An improved pegasus method for root finding
- scientific article; zbMATH DE number 3649911 (Why is no real title available?)
- scientific article; zbMATH DE number 3827091 (Why is no real title available?)
- scientific article; zbMATH DE number 3521417 (Why is no real title available?)
- scientific article; zbMATH DE number 3612368 (Why is no real title available?)
- scientific article; zbMATH DE number 3195683 (Why is no real title available?)
- Interval iteration for zeros of systems of equations
- On computing the range of values
Cited in
(10)- Interval iteration for zeros of systems of equations
- Existence of solutions of piecewise differentiable systems of equations
- Interval versions of some procedures for the simultaneous estimation of complex polynomial zeros
- The secant method and divided differences Hölder continuous
- An interval iteration for multiple roots of transcendental equations
- scientific article; zbMATH DE number 4039153 (Why is no real title available?)
- scientific article; zbMATH DE number 1161045 (Why is no real title available?)
- scientific article; zbMATH DE number 6025252 (Why is no real title available?)
- Hybrid inclusion algorithms for polynomial multiple complex zeros in rectangular arithmetic
- A hybrid method for polynomial complex zero
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)
