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.
RightsThis publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.
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 ...
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 ...
Chu, Peter C.; Tokmakian, Robin T.; Fan, Chenwu; Sun, L. Charles (2015-04);Optimal spectral decomposition (OSD) is applied to ocean data assimilation with variable (temperature, salinity, or velocity) anomalies (relative to background or modeled values) decomposed into generalized Fourier series, ...