The Laguerre Iteration in Solving the Symmetric Tridiagonal Eigenproblem, Revisited
From MaRDI portal
Publication:4310900
DOI10.1137/0915071zbMath0809.65035OpenAlexW2037937601MaRDI QIDQ4310900
Publication date: 22 November 1994
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0915071
algorithmeigenvaluesparallel computationcharacteristic polynomialsymmetric tridiagonal matrixthree-term recurrencescubic convergence rateLaguerre iteration method
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (7)
On optimal parameter of Laguerre's family of zero-finding methods ⋮ An algorithm for the generalized symmetric tridiagonal eigenvalue problem ⋮ A property of eigenvalue bounds for a class of symmetric tridiagonal interval matrices ⋮ Eigenvalue inequalities and equalities ⋮ The quasi-Laguerre iteration ⋮ Symbolic computation and computer graphics as tools for developing and studying new root-finding methods ⋮ Hyman's method revisited
This page was built for publication: The Laguerre Iteration in Solving the Symmetric Tridiagonal Eigenproblem, Revisited
