Quasi-Laguerre iteration in solving symmetric tridiagonal eigenvalue problems
Journal Article
·
· SIAM Journal on Scientific Computing
- Michigan State Univ., East Lansing, MI (United States). Dept. of Mathematics
- Lambuth Univ., Jackson, TN (United States). Dept. of Mathematics
- Northeastern Illinois Univ., Chicago, IL (United States). Dept. of Mathematics
In this article, the quasi-Laguerre iteration is established in the spirit of Laguerre`s iteration for solving polynomial f with all real zeros. The new algorithm, which maintains the monotonicity and global convergence of the Laguerre iteration, no longer needs to evaluate f{double_prime}. The ultimate convergence rate is {radical}2 + 1. When applied to approximate the eigenvalues of a symmetric tridiagonal matrix, the algorithm substantially improves the speed of Laguerre`s iteration.
- Sponsoring Organization:
- USDOE, Washington, DC (United States); National Science Foundation, Washington, DC (United States)
- DOE Contract Number:
- FG02-93ER25172
- OSTI ID:
- 413363
- Journal Information:
- SIAM Journal on Scientific Computing, Vol. 17, Issue 6; Other Information: PBD: Nov 1996
- Country of Publication:
- United States
- Language:
- English
Similar Records
The Godunov-Inverse Iteration : A fast and accurate solution to the symmetric tridiagonal eigenvalue problem.
Solving the symmetric tridiagonal eigenvalue problem on the hypercube
Multiprocessor algorithm for the symmetric tridiagonal eigenvalue problem
Conference
·
Wed Nov 27 00:00:00 EST 2002
·
OSTI ID:413363
Solving the symmetric tridiagonal eigenvalue problem on the hypercube
Journal Article
·
Thu Mar 01 00:00:00 EST 1990
· SIAM Journal on Scientific and Statistical Computing (Society for Industrial and Applied Mathematics); (USA)
·
OSTI ID:413363
Multiprocessor algorithm for the symmetric tridiagonal eigenvalue problem
Technical Report
·
Wed Jan 08 00:00:00 EST 1986
·
OSTI ID:413363