An interval iteration for multiple roots of transcendental equations

DOI10.1007/BF01739827zbMath0839.65065OpenAlexW2088150888MaRDI QIDQ1907875

Qun Lin, Jon G. Rokne

Publication date: 2 June 1996

Published in: BIT (Search for Journal in Brave)

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

zbMATH Keywords

global convergencenumerical examplesiterative methodinterval arithmetictranscendental equationsmultiple root

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An interval version of the secant method
• A derivative-free transformation preserving the order of convergence of iteration methods in case of multiple zeros
• Finding a Multiple Zero by Transformations and Newton-Like Methods
• A family of multiopoint iterative functions for finding multiple roots of equations
• An Existence Test for Root Clusters and Multiple Roots
• A note on the computation of multiple zeros of polynomials by Newton's method

This page was built for publication: An interval iteration for multiple roots of transcendental equations