DOA estimation by eigendecomposition using single vector Lanczos Algorithm.
Gear, Daniel E.
Therrien, Charles W.
MetadataShow full item record
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 and eigenvectors can be approximated without requiring the entire matrix decomposition theoretically saving many computations. This thesis develops a model and a form of the Lanczos algorithm to solve the DOA problem. The relationship of the number of eigenvectors used to the accuracy of the results in a low signal to noise ratio example are examined.
Approved for public release; distribution is unlimited
Showing items related by title, author, creator and subject.
Gragg, William B.; Reichel, Lother (Monterey, California. Naval Postgraduate School, 1989-02); NPS-53-89-007Let H epsilon C be a unitary upper Hessenberg matrix whose eigenvalues, and possibly also eigenvectors, are to be determined. We describe how this eigenproblem can be solved by a divide and conquer method, in which the ...
Beaver, Philip (Monterey, California. Naval Postgraduate School, 1998-06);The question of when a square, linear operator is quasimonotone nondecreasing with respect to a nonnegative cone was posed for the application of vector Lyapunov functions in 1974. Necessary conditions were given in 1980, ...
Diersen, David Ivan (2000-12);Remotely sensed data produced by hyperspectral imagers contains hundreds of contiguous narrow spectral bands at each spatial pixel. The substantial dimensionality and unique character of hyperspectral imagery requires ...