|Title:|| A NEW DIVIDE AND CONQUER PARALLEL ALGORITHM
FOR COMPUTING THE EIGENVALUES OF A SYMMETRIC TRIDIAGONAL MATRIX.
|Authors:|| I. Bar-On
|Abstract:||We present new interlacing properties for the eigenvalues of an unreduced tridiagonal symmetric matrix in terms of its leading and trailing sub matrices based on simple algebra and the Sylvester Inertia theorem. We then present a new divide and conquer parallel algorithm for computing the eigenvalues of a symmetric tridiagonal matrix. The new algorithm is more simple and straightforward than Cuppen's method , and does not require the computation of the corresponding eigenvectors. We can then compute the set of eigenvalues in an interval in O(kn) time, where k is the number of eigenvalues, and n is the order of the matrix.|
|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/1994/CS/CS0832), rather than to the URL of the PDF files directly. The latter URLs may change without notice.
To the list of the CS technical reports of 1994
To the main CS technical reports page
Computer science department, Technion