Translator Disclaimer
Paper
2 October 1998 Approximation by structured lower rank matrices
Author Affiliations +
Abstract
We consider two general procedures for constructing the nearest approximation of a given matrix by one with any lower rank and any linear structure. Nearness can be measured in any matrix norm. Structured low rank matrices arise in various applications, including image enhancement and model reduction. In practice, the empirical data collected in the matrix often either do not maintain the specified structure or do not induce the desirable rank.It is an important task to search for the nearest structured lower rank approximation of a given matrix. The techniques developed in this paper can easily be implemented for numerical computation. In particular, it is shown that the computations can be approached using efficient optimization packages. The special case of Toeplitz structure using the Frobenius matrix norm is discussed in detail to illustrate the ideas, and numerical test are reported. The procedures developed herein can be generalized to consider a much broader range of approximation problems.
© (1998) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Moody T. Chu, Robert E. Funderlic, and Robert J. Plemmons "Approximation by structured lower rank matrices", Proc. SPIE 3461, Advanced Signal Processing Algorithms, Architectures, and Implementations VIII, (2 October 1998); https://doi.org/10.1117/12.325687
PROCEEDINGS
12 PAGES


SHARE
Advertisement
Advertisement
RELATED CONTENT

Analysis of a fast Hankel eigenvalue algorithm
Proceedings of SPIE (November 02 1999)
Some fast Toeplitz least-squares algorithms
Proceedings of SPIE (December 01 1991)
Armlets and balanced multiwavelets
Proceedings of SPIE (November 13 2003)
Fast eigenvalue algorithm for Hankel matrices
Proceedings of SPIE (October 02 1998)

Back to Top