Some modifications of Laguerre's method
From MaRDI portal
Publication:4167477
Cites work
- scientific article; zbMATH DE number 3476451 (Why is no real title available?)
- scientific article; zbMATH DE number 3388488 (Why is no real title available?)
- scientific article; zbMATH DE number 3195683 (Why is no real title available?)
- A family of root finding methods
- Estimating the multiplicity of a root
- Laguerre's Method Applied to the Matrix Eigenvalue Problem
- On the Convergence Speed of Some Algorithms for the Simultaneous Approximation of Polynomial Roots
- Simultaneous inclusion of the zeros of a polynomial
Cited in
(14)- Chebyshev-Halley methods for analytic functions
- Interval versions of some procedures for the simultaneous estimation of complex polynomial zeros
- The computation of multiple roots of a polynomial
- Laguerre-like inclusion method for polynomial zeros
- New progress in real and complex polynomial root-finding
- An effective implementation of a modified Laguerre method for the roots of a polynomial
- A hybrid Laguerre method
- Choosing improved initial values for polynomial zerofinding in extended Newbery method to obtain convergence
- Numerical computation of polynomial zeros by means of Aberth's method
- Higher-order simultaneous methods for the determination of polynomial multiple zeros
- 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
- The guaranteed convergence of Laguerre-like method
- A parallel Wilf algorithm for complex zeros of a polynomial
This page was built for publication: Some modifications of Laguerre's method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4167477)
