Diagonal and low-rank decompositions and fitting ellipsoids to random points
Identifying a subspace containing signals of interest in additive noise is a basic system identification problem. Under natural assumptions, this problem is known as the Frisch scheme and can be cast as decomposing an n × n positive definite matrix as the sum of an unknown diagonal matrix (the noise...
Main Authors: | Saunderson, James F., Parrilo, Pablo A., Willsky, Alan S. |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
Format: | Article |
Language: | en_US |
Published: |
Institute of Electrical and Electronics Engineers (IEEE)
2014
|
Online Access: | http://hdl.handle.net/1721.1/90825 https://orcid.org/0000-0003-1132-8477 https://orcid.org/0000-0003-0149-5888 |
Similar Items
-
Diagonal and Low-Rank Matrix Decompositions, Correlation Matrices, and Ellipsoid Fitting
by: Saunderson, James F., et al.
Published: (2013) -
Sparse and low-rank matrix decompositions
by: Chandrasekaran, Venkat, et al.
Published: (2010) -
Rank-Sparsity Incoherence for Matrix Decomposition
by: Chandrasekaran, Venkat, et al.
Published: (2011) -
Semidefinite Descriptions of the Convex Hull of Rotation Matrices
by: Saunderson, James, et al.
Published: (2016) -
Randomized Rank-Revealing QLP for Low-Rank Matrix Decomposition
by: Maboud F. Kaloorazi, et al.
Published: (2023-01-01)