Block Lanczos algorithm.
Kim, Yong Joo
Therrien, Charles W.
MetadataShow full item record
We use a block Lanczos algorithm for computing a few of the smallest eigenvalues and the corresponding eigenvectors of a large symmetric matrix rather than computing all the eigenvalue-eigenvector pairs. The basic Lanczos algorithm generates a similar matrix which is block tridiagonal from a given large symmetric matrix. The size of the generated tridiagonal matrix depends upon the number of the smallest eigenvalues to be computed. The result is savings in computations and storage. The block Lanczos algorithm is well -suited for problems involving multiple eigenvalues. In this thesis, we develop the block Lanczos algorithm to estimate the direction-of-arrival (DOA) of a point source based on the observations measured at a linear array of sensors and compare the performance with that of a single vector Lanczos algorithm. The results of the computer simulation experiments conducted with this method are presented and discussed.
RightsCopyright is reserved by the copyright owner
Showing items related by title, author, creator and subject.
Gear, Daniel E. (Monterey, California. Naval Postgraduate School, 1989-06);Subspace methods of solving spectral estimation and direction of arrival (DOA) problems involve finding the eigenvalues and eigenvectors of correlation matrices. Using the Lanczos algorithm some of the extreme eigenvalues ...
Positive definite Toeplitz matrices, the Arnoldi process for isometric operators, and Gaussian quadrature on the unit circle Gragg, William B. (Elsevier Science Publishers B.V., 1993);We show that the well-known Levinson algorithm for computing the inverse Cholesky factorization of positive definite Toeplitz matrices can be viewed as a special case of a more general process. The latter process provides ...
Gragg, William B.; Ammar, Gregory S.; Reichel, Lother (Monterey, California. Naval Postgraduate School, 1988-11); NPS-53-89-005We consider the numerical construction of a unitary Hessenberg matrix from spectral data using an inverse QR algorithm. Any unitary upper Hessenberg matrix H with nonnegative subdiagonal elements can be represented by 2n ...