The quasi-Laguerre iteration

DOI10.1090/S0025-5718-97-00786-2zbMath0854.65033MaRDI QIDQ5691016

Ming Jin, Qiang Du, Zhonggang Zeng, Tien-Yien Li

Publication date: 9 January 1997

Published in: Mathematics of Computation (Search for Journal in Brave)

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical computation of determinants (65F40)

Related Items (8)

The asymptotic error constant of leap-frogging Newton's method locating a simple real zero ⋮ High-order convergence of the \(k\)-fold pseudo-Newton's irrational method locating a simple real zero ⋮ Nearly optimal refinement of real roots of a univariate polynomial ⋮ Repellers for the Laguerre Iteration Function ⋮ A cubic-order variant of Newton's method for finding multiple roots of nonlinear equations ⋮ New progress in real and complex polynomial root-finding ⋮ On the global convergence of Schröder's iterative formulae for real roots of algebraic equations ⋮ Real polynomial root-finding by means of matrix and polynomial iterations

Cites Work

• Unnamed Item
• Generalizations of Laguerre’s Method: Higher Order Methods
• The Laguerre Iteration in Solving the Symmetric Tridiagonal Eigenproblem, Revisited
• Quasi-Laguerre Iteration in Solving Symmetric Tridiagonal Eigenvalue Problems

This page was built for publication: The quasi-Laguerre iteration