A root-finding algorithm based on Newton's method

DOI10.1007/BF01933524MaRDI QIDQ5663315zbMATH OpenFDO

Authors Kaj Madsen

Publication date 1973

Published in BIT (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05)

Cites work

• A stopping criterion for polynomial root finding
• A Three-Stage Algorithm for Real Polynomials Using Quadratic Iteration
• A three-stage variable-shift iteration for polynomial zeros and its relation to generalized Rayleigh iteration
• Direkte Verfahren zur Berechnung der Nullstellen von Polynomen
• scientific article; zbMATH DE number 1024452 (Why is no real title available?)
• scientific article; zbMATH DE number 3279131 (Why is no real title available?)
• scientific article; zbMATH DE number 3352737 (Why is no real title available?)
• scientific article; zbMATH DE number 3383473 (Why is no real title available?)
• Practical Problems Arising in the Solution of Polynomial Equations

Cited in

(8)

• Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration.
• Finding zeros of nonlinear functions using the hybrid parallel cell mapping method
• Structured matrix methods for the computation of multiple roots of a polynomial
• Eigenvalue condition numbers and pseudospectra of Fiedler matrices
• How to calculate ruin probabilities according to the classical risk theory
• The computation of multiple roots of a polynomial
• A new and novel method for computing an upper bound on the distance of an approximate zero from an exact zero of a univariate polynomial
• A study of accelerated Newton methods for multiple polynomial roots

This page was built for publication: A root-finding algorithm based on Newton's method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5663315)