|Title:|| INTERLACING PROPERTIES FOR TRIDIAGONAL SYMMETRIC MATRICES
WITH APPLICATIONS TO PARALLEL COMPUTING.
|Authors:|| I. Bar-On
We present new interlacing properties for the eigenvalues of an unreduced tridiagonal symmetric matrix in terms of its leading and trailing sub matrices. We improve upon the results stated in Hill and Parlett which are just a special case. Furthermore, our proof is elementary and simple as compared to theirs. We further generalize these results to reduced symmetric tridiagonal matrices and to specially structured full symmetric matrices. The theoretical results presented are then used for devising fast and efficient parallel algorithms for the computation of the eigenvalues of very large size matrices.
|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/LPCR9317), 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