article · 1992
Laguerre's Iteration In Solving The Symmetric Tridiagonal Eigenproblem - Revisited
T. Y. Li, Zhonggang Zeng
Cited by 0Abstract and details only
Abstract
. In this paper we present an algorithm for the eigenvalue problem of symmetric tridiagonal matrices. Our algorithm employs the determinant evaluation, split-and-merge strategy and Laguerre's iteration. The method directly evaluates eigenvalues and uses inverse iteration as an option when eigenvectors are needed. This algorithm combines the advantages of existing algorithms such as QR, bisection/multisection and Cuppen's divide-and-conquer method. It is fully parallel, and competitive in speed with the most efficient QR algorithm in serial mode. On the other hand, our algorithm is as accurate as any standard algorithm for the symmetric tridiagonal eigenproblem and enjoys the flexibility in evaluating partial spectrum. Key words. eigenvalue, Laguerre's iteration, symmetric tridiagonal matrix 1. Introduction. For a symmetric tridiagonal matrix T with nonzero subdiagonal entries, the eigenvalues of T or the zeros of its characteristic polynomial f() = det[T \\Gamma I ] (1.1) are all rea...
Cite this paper
Li, T. Y., & Zeng, Z. (1992). Laguerre's Iteration In Solving The Symmetric Tridiagonal Eigenproblem - Revisited.
Li, T. Y., and Zhonggang Zeng. “Laguerre's Iteration In Solving The Symmetric Tridiagonal Eigenproblem - Revisited.” 1992.
Li, T. Y., and Zhonggang Zeng. 1992. “Laguerre's Iteration In Solving The Symmetric Tridiagonal Eigenproblem - Revisited.”
Li, T.Y. and Zeng, Z. (1992) ‘Laguerre's Iteration In Solving The Symmetric Tridiagonal Eigenproblem - Revisited’.
@article{li1992laguerre,
title = {{Laguerre's Iteration In Solving The Symmetric Tridiagonal Eigenproblem - Revisited}},
author = {Li, T. Y. and Zeng, Zhonggang},
year = {1992}
}Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.