2006
DOI: 10.1007/s10543-006-0053-4
|View full text |Cite
|
Sign up to set email alerts
|

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

Abstract: 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… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
13
0

Year Published

2008
2008
2018
2018

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 14 publications
(13 citation statements)
references
References 19 publications
0
13
0
Order By: Relevance
“…j .A//. The orthogonal matrices U A and V A from the SVD are not unique in the general case (for a relation between orthogonal matrices from two singular value decompositions of A, see Lemma in [19]; compare Problem B.11 in [20, p. 334] and [21]). Let A D P † A Q T be another SVD of A, let † A D diag.…”
Section: Auxiliary Known Results and Notationmentioning
confidence: 99%
“…j .A//. The orthogonal matrices U A and V A from the SVD are not unique in the general case (for a relation between orthogonal matrices from two singular value decompositions of A, see Lemma in [19]; compare Problem B.11 in [20, p. 334] and [21]). Let A D P † A Q T be another SVD of A, let † A D diag.…”
Section: Auxiliary Known Results and Notationmentioning
confidence: 99%
“…The polar decomposition algorithm has been well studied in the last three decades in terms of complexity and numerical robustness/accuracy [14], [15], [16], [17], [18], [19], [20]. Initially designed with Newton's method based on an explicit matrix inversion calculation, numerical instability was reported, especially in presence of ill-conditioned matrices.…”
Section: Related Workmentioning
confidence: 99%
“…Moreover, the perturbation bounds of Q k and H k can be obtained by using the results for the generalized polar decomposition (see Ref. [15]). …”
Section: Basic Properties Ofmentioning
confidence: 99%
“…In Ref. [15], Laszkkiewicz and Zietak proved that for all subunitary matrices Q ∈ U m×n , the following inequality holds:…”
mentioning
confidence: 99%
See 1 more Smart Citation