|Title:|| PARALLEL COMPUTATION OF THE SPECTRUM OF A SYMMETRIC TRIDIAGONAL MATRIX.
|Authors:|| I. Bar-On
We present in this paper divide and conquer strategies for computing in parallel the eigenvalues and eigenvectors of a symmetric tridiagonal matrix. One strategy is a mixture of Bisection, QR, and Inverse Iteration. The other is based on the interlacing properties of the eigenvalues of tridiagonal matrices, and provides a new divide and conquer algorithm more simple and straightforward then Cuppen's method.
|Copyright||The above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information|
Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/1993/LPCR/LPCR9318), rather than to the URL of the PDF files directly. The latter URLs may change without notice.
To the list of the LPCR technical reports of 1993
To the main CS technical reports page
Computer science department, Technion