Generalizations of Laguerre’s Method: Higher Order Methods
From MaRDI portal
Recommendations
Cited in
(16)- On the dynamics of Laguerre's iteration: \(Z^ n-1\)
- Choosing improved initial values for polynomial zerofinding in extended Newbery method to obtain convergence
- Analysis of the quasi-Laguerre method
- Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration.
- Structured matrix methods for the computation of multiple roots of a polynomial
- An effective implementation of a modified Laguerre method for the roots of a polynomial
- Generalized Leapfrog Methods
- Several new methods for solving equations
- scientific article; zbMATH DE number 1217733 (Why is no real title available?)
- The computation of multiple roots of a polynomial
- scientific article; zbMATH DE number 1971081 (Why is no real title available?)
- On optimal parameter of Laguerre's family of zero-finding methods
- The quasi-Laguerre iteration
- Are there any Julia sets for the Laguerre iteration function?
- Repellers for the Laguerre Iteration Function
- On the global convergence of Schröder's iterative formulae for real roots of algebraic equations
This page was built for publication: Generalizations of Laguerre’s Method: Higher Order Methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3217524)