Approximation of Matrices and a Family of Gander Methods for Polar Decomposition

Two matrix approximation problems are considered: approximation of a rectangular complex matrix by subunitary matrices with respect to unitarily invariant norms and a minimal rank approximation with respect to the spectral norm. A characterization of a subunitary approximant of a square matrix with respect to the Schatten norms, given by Maher, is extended to the case of rectangular matrices and arbitrary unitarily invariant norms. Iterative methods, based on the family of Gander methods and on Higham’s scaled method for polar decomposition of a matrix, are proposed for computing subunitary and minimal rank approximants. Properties of Gander methods are investigated in details.

[1]  C. Eckart,et al.  The approximation of one matrix by another of lower rank , 1936 .

[2]  K. Fan,et al.  Maximum Properties and Inequalities for the Eigenvalues of Completely Continuous Operators. , 1951, Proceedings of the National Academy of Sciences of the United States of America.

[3]  A. Hoffman,et al.  Some metric inequalities in the space of matrices , 1955 .

[4]  Adi Ben-Israel,et al.  On Iterative Computation of Generalized Inverses and Associated Projections , 1966 .

[5]  G. Golub.  Least squares, singular values and matrix approximations , 1968 .

[6]  Adi Ben-Israel,et al.  Generalized inverses: theory and applications , 1974 .

[7]  J. Meyer.  Generalized Inverses (Theory And Applications) (Adi Ben-Israel and Thomas N. E. Greville) , 1976 .

[8]  APPROXIMATION BY PARTIAL ISOMETRIES , 1986 .

[9]  N. Higham.  Computing the polar decomposition with applications , 1986 .

[10]  R. Bhatia.  Some inequalities for norm ideals , 1987 .

[11]  P. Maher.  Partially isometric approximation of positive operators , 1989 .

[12]  Nicholas J. Higham,et al.  Fast Polar Decomposition of an Arbitrary Matrix , 1990, SIAM J. Sci. Comput..

[13]  Walter Gander,et al.  Algorithms for the Polar Decomposition , 1990, SIAM J. Sci. Comput..

[14]  Alan J. Laub,et al.  On Scaling Newton's Method for Polar Decomposition and the Matrix Sign Function , 1990, 1990 American Control Conference.

[15]  Charles R. Johnson,et al.  Topics in Matrix Analysis , 1991 .

[16]  K. Zietak,et al.  The polar decomposition— properties, applications and algorithms , 1995 .

[17]  Åke Björck,et al.  Numerical methods for least square problems , 1996 .

[18]  R. Bhatia.  Matrix Analysis , 1996 .

[19]  G. W. Stewart,et al.  Matrix algorithms , 1998 .

[20]  Krystyna Zietak,et al.  Numerical Behaviour of Higham's Scaled Method for Polar Decomposition , 2004, Numerical Algorithms.

[21]  Nicholas J. Higham,et al.  Computing the Polar Decomposition and the Matrix Sign Decomposition in Matrix Groups , 2004, SIAM J. Matrix Anal. Appl..

[22]  Françoise Tisseur,et al.  Structured Factorizations in Scalar Product Spaces , 2005, SIAM J. Matrix Anal. Appl..