A root-finding algorithm based on Newton's method
From MaRDI portal
Publication:5663315
DOI10.1007/BF01933524zbMath0249.65030MaRDI QIDQ5663315
Publication date: 1973
Published in: BIT (Search for Journal in Brave)
Related Items (8)
Eigenvalue condition numbers and pseudospectra of Fiedler matrices ⋮ Finding zeros of nonlinear functions using the hybrid parallel cell mapping method ⋮ The computation of multiple roots of a polynomial ⋮ Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration. ⋮ 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 ⋮ Structured matrix methods for the computation of multiple roots of a polynomial ⋮ A study of accelerated Newton methods for multiple polynomial roots ⋮ How to calculate ruin probabilities according to the classical risk theory
Cites Work
- A three-stage variable-shift iteration for polynomial zeros and its relation to generalized Rayleigh iteration
- Direkte Verfahren zur Berechnung der Nullstellen von Polynomen
- A stopping criterion for polynomial root finding
- Practical Problems Arising in the Solution of Polynomial Equations
- A Three-Stage Algorithm for Real Polynomials Using Quadratic Iteration
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A root-finding algorithm based on Newton's method