Structured low rank approximation

Linear Algebra and Its Applications

Volumn 366, Issue SPEC. ISS., 2003, Pages 157-172

  Chu, Moody T ^a   Funderlic, Robert E ^b   Plemmons, Robert J ^c  

^a NORTH CAROLINA STATE UNIVERSITY   (United States)

^b North Carolina State University   (United States)

^c WAKE FOREST UNIVERSITY   (United States)

Author keywords

Low rank approximation; Optimization techniques; Structured matrix; Toeplitz matrix

Indexed keywords

EID: 0037409774     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0024-3795(02)00505-0     Document Type: Conference Paper

References (44)

1. V.J. Adamjan, D.Z. Arov, and M.G. Krein Analytic properties of Schmidt pairs for a Hankel operator and the generalized Schur-Takagi problem Mat. USSR Sbornik 15 31-73 1971
2. A. Antoulas Approximation of linear operators in the 2-norm Linear Algebra Appl. 278 1998 309 316
3. R. de Beer, Quantitative in vivo NMR (nuclear magnetic resonance on living objects), http://dutnsic.tn.tudelft.nl:8080/c59-to-html/c59.html, University of Technology Delft, Netherlands, 1995
4. J.P. Burg, D.G. Luenberger, and D.L. Wenger Estimation of structured covariance matrices Proc. IEEE 70 1982 963 974
5. J.A. Cadzow Signal enhancement: a composite property mapping algorithm IEEE Trans. Acoust. Speech Signal Process. ASSP-36 1988 39 62
6. J.A. Cadzow, and D.M. Wilkes Signal enhancement and the SVD in: Proceedings of the Second International Workshop on SVD and Signal Processing, University of Rhode Island, Kingston, RI 1990 144 151
7. A. Cantoni, and P. Butler Eigenvalues and eigenvectors of symmetric centrosymmetric matrices Linear Algebra Appl. 13 1976 275 288
8. W. Cheney, and A. Goldstein Proximity maps for convex sets Proc. Am. Math. Soc. 10 1959 448 450
9. M. Chu, and R. Funderlic The centroid decomposition: relationships between discrete variational decompositions and SVD SIAM Matrix Anal. Appl. 23 2002 1025 1044
10. A.R. Conn, N.I.M. Could, and Ph.L. Toint LANCELOT: a Fortran package for large-scale nonlinear optimization (Release A) in: Springer Series in Computational Mathematics vol. 17 1992 Springer-Verlag New York
11. R.M. Corless, P.M. Gianni, B.M. Trager, and S.M. Watt The singular value decomposition for polynomial system in: Proceedings of the International Symposium on Symbolic and Algebraic Computation, Montreal, Canada, July 1995 195 207
12. G. Cybenko Moment problems and low rank Toeplitz approximations Circuits Systems Signal Process. 1 1983 3 4
13. J. Czyzyk, M. Mesnier, J. Moré, The network-enabled optimization system (NEOS) server, Preprint MCS-P615-1096, Argonne National Laboratory, 1996. See also http://www.mcs.anl.gov/neos/Server
14. B. DeMoor Total least squares for affinely structured matrices and the noisy realization problem IEEE Trans. Signal Process. 42 1994 3104 3113
15. M. Dendrinos, S. Bakamidis, and G. Carayannis Speech enhancement from noise: a regenerative approach Speech Commun. 10 45-57 1991
16. F. Deutsch von Neumann's alternating method: the rate of convergence C. Chui, L. Schumaker, J. Ward, Approximation Theory IV 1983 Academic Press New York 427 434
17. G.H. Golub, and C.F. Van Loan Matrix Computations third ed. 1996 Johns Hopkins University Press Baltimore, MD
18. J.C. Gower Eculidean distance geometry Math. Scientist 7 1982 1 14
19. W. Glunt, T.L. Hayden, S. Hong, and J. Wells An alternating projection algorithm for computing the nearest Euclidean distance matrix SIAM J. Matrix Anal. Appl. 11 1990 589 600
20. S.A. Goreinov, E.E. Tyrtyshnikov, and N.L. Zamarashkin A theory of pseudoskeleton approximations Linear Algebra Appl. 261 1997 1 21
21. W. Gropp, J. Moré, Optimization environments and the NEOS server, Preprint MCS-P654-0397, Argonne National Laboratory, 1997
22. P.C. Hansen The truncated SVD as a method for regularization BIT 27 534-553 1987
23. P.C. Hansen Truncated SVD solution to discrete ill-posed problems with ill-determined numerical rank SIAM J. Sci. Stat. Comput. 11 503-518 1991
24. S.P. Han A successive projection method Math. Programming 40 1988 1 14
25. U. Helmke, and J. Moore Optimization and Dynamical Systems 1994 Springer-Verlag London
26. N.J. Higham, Computing the nearest correlation matrix, preprint, NA Report 369, University of Manchester, 2000
27. N.K. Karmarkar, and Y.N. Lakshman On approximate GCDs of unvariate polynomials J. Symbolic Comput. 26 1998 653 666
28. H.B. Li, P. Stoica, and J. Li Computationally efficient maximum likelihood estimation of structured covariance matrices IEEE Trans. Signal Process. 47 1999 1314 1323
29. B.T. Lilly, and K.K. Paliwal Robust speech recognition using singular value decomposition based speech enhancement IEEE TENCON - Speech Image Tech. Comput. Telecommun. 1997 257 260
30. G.L. Millhauser, A.A. Carter, D.J. Schneider, J.H. Freed, and R.E. Oswald Rapid singular value decomposition for time-domain analysis of magnetic resonance signals by use of the Lanczos algorithm J. Magn. Reson. 82 1989 150 155
31. H.D. Mittelmann, and J.A. Cadzow Continuity of closest rank-p approximations to matrices IEEE Trans. Acoust. Speech Signal Process. ASSP-35 1987 1211 1212
32. J.J. Moré, and S.J. Wright Optimization sofware guide Frontiers Appl. Math. 14 1993 11 22
33. H. Park, Z. Lei, and J.B. Rosen Low rank approximation of a Hankel matrix by structured total least norm BIT 39 1999 757 779
34. A. Prieze, R. Kannaa, Fast Monte-Carlo algorithm for finding low rank approximations, http://www.cs.yale.edu/~kannan/
35. L.L. Scharf, and D.W. Tufts Rank reduction for modeling stationary signals IEEE Trans. Acoust. Speech Signal Process. 35 1987 350 355
36. T.J. Schulz Penalized maximum-likelihood estimation of covariance matrices with linear structure IEEE Trans. Signal Process. 45 1997 3027 3038
37. H.S. Simon, H. Zha, Low rank matrix approximation using the Lanczos bidiagonalization process, Technical Report CSE-97-008, Computer Science and Engineering Dept., Penn. State Univ., 1997
38. A.K. Shaw, and R. Kumaresan Some structured matrix approximation problems in: IEEE International Conference on Acoustics, Speech and Signal Processing, New York, NY, April 1988 2324 2327
39. A.K. Shaw, S. Pokala, and R. Kumaresan Toeplitz and Hankel approximation using structured approach in: IEEE International Conference on Acoustics, Speech and Signal Processing, Seattle, WA, May 1998
40. T.J. Suffridge, and T.L. Hayden Approximatin by a Hermitian positive semidefinite Toeplitz matrix SIAM J. Matrix Anal. Appl. 14 1993 721 734
41. D.W. Tufts, and A.A. Shah Estimation of a signal wave-form from noisy data using low rank approximation to a data matrix IEEE Trans. Signal Process. 41 1993 1716 1721
42. A. van der Veen A Schur method for low-rank matrix approximation SIAM J. Matrix Anal. Appl. 17 1996 139 160
43. D.E. Williams, and D.H. Johnson Robust estimation on structured covariance matrices IEEE Trans. Signal Process. 41 1993 2891 2906
44. A.E. Yagle A convergent composite mapping Fourier domain iterative algorithm for 3-D discrete tomography Linear Algebra Appl. 339 2001 91 109