An optimum iteration for the matrix polar decomposition

Electronic Transactions on Numerical Analysis

Volumn 8, Issue , 1999, Pages 21-25

  Dubrulle, A A ^a  

^a NONE

Author keywords

Matrix polar decomposition; Newton iteration

Indexed keywords

EID: 0006354251     PISSN: 10689613     EISSN: 10689613     Source Type: Journal    
DOI: None     Document Type: Article

References (5)

1. W. GANDER, Algorithms for the polar decomposition, SIAM J. Sci. Statist. Comput., 11 (1990), pp. 1102-1115.
2. G. H. GOLUB AND C. F. VAN LOAN, Matrix Computations, The Johns Hopkins University Press, Baltimore, MD, 1996.
3. N. HlGHAM, Computing the polar decomposition-with applications, SIAM J. Sci. Statist. Comput., 7 (1986), pp. 1160-1174.
4. N. HlGHAM AND R. SCHREIBER, Fast polar decomposition of an arbitrary matrix, SIAM J. Sci. Statist. Comput., 11 (1990), pp. 648-655.
5. C. KENNEY AND A. LAUB, On scaling Newton's method for the polar decomposition and the matrix sign function, SIAM J. Matrix Anal. Appl., 13 (1992), pp. 688-706.