Share Email Print

Proceedings Paper

Approximation by structured lower rank matrices
Author(s): Moody T. Chu; Robert E. Funderlic; Robert J. Plemmons
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper 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.

Paper Details

Date Published: 2 October 1998
PDF: 12 pages
Proc. SPIE 3461, Advanced Signal Processing Algorithms, Architectures, and Implementations VIII, (2 October 1998); doi: 10.1117/12.325687
Show Author Affiliations
Moody T. Chu, North Carolina State Univ. (United States)
Robert E. Funderlic, North Carolina State Univ. (United States)
Robert J. Plemmons, Wake Forest Univ. (United States)

Published in SPIE Proceedings Vol. 3461:
Advanced Signal Processing Algorithms, Architectures, and Implementations VIII
Franklin T. Luk, Editor(s)

© SPIE. Terms of Use
Back to Top