Low Rank Approximation of a Hankel Matrix by Structured Total Least Norm

Park, Haesun
Zhang, Lei
Rosen, J. Ben
1997
Thumbnail Image

View/Download File

1997-043.pdf (3.74 MB)

Persistent link to this item

https://hdl.handle.net/11299/215327
Statistics
View Statistics

Journal Title

Journal ISSN

Volume Title

Title

Low Rank Approximation of a Hankel Matrix by Structured Total Least Norm

Authors

Published Date

1997

Publisher

Type

Report

Abstract

The structure preserving rank reduction problem arises in many important applications. The singular value decomposition (SVD), while giving the best low rank approximation to a given matrix, may not be appropriate for these applications since it does not preserve the given structure. We present a new method for structure preserving low rank approximation of a matri.x, which is based on Structured Total Least Norm (STLN). The STLN is an efficient method for obtaining an approximate solution to the overdetermined linear system AX ~ B preserving the given linear structure in .4. or (A I BJ, where errors can occur in both the right hand side matrix B and the matrix A. The approximate solution can be obtained to minimize the error in the Lp norm, where p = l, 2, or oo. An algorithm is described for Hankel structure preserving low rank approximation using STLN with Lp norm. Computational results are presented, which compare performances of the STLN based method for L1 and L2 norms and other existing methods for reduced rank approximation for Hankel matrices.

Keywords

Description

Related to

Replaces

License

Collections

Computer Science & Engineering (CS&E) Technical Reports

Series/Report Number

Technical Report; 97-043

Funding information

The work of all three authors was supported in part by the National Science Foundation grant CCR-9509085.

Isbn identifier

Doi identifier

Previously Published Citation

Suggested citation

Park, Haesun; Zhang, Lei; Rosen, J. Ben. (1997). Low Rank Approximation of a Hankel Matrix by Structured Total Least Norm. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/215327.

Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.