메뉴 건너뛰기




Volumn 33, Issue 2, 2012, Pages 460-479

Backward stability of iterations for computing the polar decomposition

Author keywords

Backward error analysis; Column pivoting; Dynamically weighted Halley iteration; Inverse Newton iteration; Newton iteration; Newton Schulz iteration; Numerical stability; Polar decomposition; QR factorization; Rounding error analysis; Row pivoting; Row sorting

Indexed keywords

BACKWARD ERROR ANALYSIS; DYNAMICALLY WEIGHTED HALLEY ITERATION; NEWTON ITERATIONS; NEWTON-SCHULZ ITERATION; POLAR DECOMPOSITIONS; QR FACTORIZATIONS; ROUNDING ERROR ANALYSIS; ROW PIVOTING;

EID: 84865526141     PISSN: 08954798     EISSN: 10957162     Source Type: Journal    
DOI: 10.1137/110857544     Document Type: Article
Times cited : (31)

References (21)
  • 2
    • 0004151496 scopus 로고    scopus 로고
    • Springer-Verlag, New York
    • R. Bhatia, Matrix Analysis. Springer-Verlag, New York, 1997.
    • (1997) Matrix Analysis
    • Bhatia, R.1
  • 4
    • 67649206981 scopus 로고    scopus 로고
    • A new scaling for Newton's iteration for the polar decomposition and its backward stability
    • R. Byers and H. Xu, A new scaling for Newton's iteration for the polar decomposition and its backward stability, SIAM J. Matrix Anal. Appl., 30 (2008), pp. 822-843.
    • (2008) SIAM J. Matrix Anal. Appl. , vol.30 , pp. 822-843
    • Byers, R.1    Xu, H.2
  • 5
    • 0002473995 scopus 로고    scopus 로고
    • Stability of Householder QR factorization for weighted least squares problems
    • D. F. Griffiths, D. J. Higham, and G. A. Watson, eds., Pitman Res. Notes Math. Ser. 380, Longman, Harlow, UK
    • A. J. Cox and N. J. Higham, Stability of Householder QR factorization for weighted least squares problems, in Numerical Analysis 1997, in Proceedings of the 17th Dundee Biennial Conference, D. F. Griffiths, D. J. Higham, and G. A. Watson, eds., Pitman Res. Notes Math. Ser. 380, Longman, Harlow, UK, 1998, pp. 57-73.
    • (1998) Numerical Analysis 1997, in Proceedings of the 17th Dundee Biennial Conference , pp. 57-73
    • Cox, A.J.1    Higham, N.J.2
  • 6
  • 7
    • 84968511031 scopus 로고
    • Some metric inequalities in the space of matrices
    • K. Fan and A. J. Hoffman, Some metric inequalities in the space of matrices, Proc. Amer. Math. Soc., 6 (1955), pp. 111-116.
    • (1955) Proc. Amer. Math. Soc. , vol.6 , pp. 111-116
    • Fan, K.1    Hoffman, A.J.2
  • 8
    • 0001142618 scopus 로고
    • The orthogonal approximation of an oblique structure in factor analysis
    • B. F. Green, The orthogonal approximation of an oblique structure in factor analysis, Psychometrika, 17 (1952), pp. 429-440.
    • (1952) Psychometrika , vol.17 , pp. 429-440
    • Green, B.F.1
  • 11
    • 0001692403 scopus 로고
    • Computing the polar decomposition-with applications
    • N. J. Higham, Computing the polar decomposition-with applications, SIAM J. Sci. Statist. Comput., 7 (1986), pp. 1160-1174.
    • (1986) SIAM J. Sci. Statist. Comput. , vol.7 , pp. 1160-1174
    • Higham, N.J.1
  • 12
    • 21144472693 scopus 로고
    • Optimization by direct search in matrix computations
    • N. J. Higham, Optimization by direct search in matrix computations, SIAM J. Matrix Anal. Appl., 14 (1993), pp. 317-333.
    • (1993) SIAM J. Matrix Anal. Appl. , vol.14 , pp. 317-333
    • Higham, N.J.1
  • 13
    • 0036457301 scopus 로고    scopus 로고
    • Accuracy and stability of numerical algorithms
    • 2nd ed Philadelphia
    • N. J. Higham, Accuracy and Stability of Numerical Algorithms, 2nd ed., SIAM, Philadelphia, 2002.
    • (2002) SIAM
    • Higham, N.J.1
  • 14
    • 70449395396 scopus 로고    scopus 로고
    • Functions of matrices: Theory and computation
    • Philadelphia
    • N. J. Higham, Functions of Matrices: Theory and Computation, SIAM, Philadelphia, 2008.
    • (2008) SIAM
    • Higham, N.J.1
  • 15
  • 16
    • 0000204992 scopus 로고
    • On scaling Newton's method for polar decomposition and the matrix sign function
    • C. S. Kenney and A. J. Laub, On scaling Newton's method for polar decomposition and the matrix sign function, SIAM J. Matrix Anal. Appl., 13 (1992), pp. 688-706.
    • (1992) SIAM J. Matrix Anal. Appl. , vol.13 , pp. 688-706
    • Kenney, C.S.1    Laub, A.J.2
  • 17
    • 84865510648 scopus 로고    scopus 로고
    • Numerical experiments with Higham's scaled method for polar decomposition
    • Institute of Mathematics and Computer Science, Wroclaw University of Technology, Wroclaw, Poland
    • A. Kiełbasiński, P. Zieliński, and K. Ziȩtak, Numerical Experiments with Higham's Scaled Method for Polar Decomposition, Technical Report I18/2006/P-013, Institute of Mathematics and Computer Science, Wroclaw University of Technology, Wroclaw, Poland, 2006.
    • (2006) Technical Report I18/2006/P-013
    • Kiełbasiński, A.1    Zieliński, P.2    Ziȩtak, K.3
  • 18
    • 0345832252 scopus 로고    scopus 로고
    • Numerical behaviour of Higham's scaled method for polar decomposition
    • A. Kiełbasiński and K. Ziȩtak, Numerical behaviour of Higham's scaled method for polar decomposition, Numer. Algorithms, 32 (2003), pp. 105-140.
    • (2003) Numer. Algorithms , vol.32 , pp. 105-140
    • Kiełbasiński, A.1    Ziȩtak, K.2
  • 19
    • 84861312729 scopus 로고    scopus 로고
    • Note on "a new scaling for Newton's iteration for the polar decomposition and its backward stability" by R. Byers and H. Xu
    • A. Kiełbasiński and K. Ziȩtak, Note on "A new scaling for Newton's iteration for the polar decomposition and its backward stability" by R. Byers and H. Xu, SIAM J. Matrix Anal. Appl., 31 (2010), pp. 1538-1539.
    • (2010) SIAM J. Matrix Anal. Appl. , vol.31 , pp. 1538-1539
    • Kiełbasiński, A.1    Ziȩtak, K.2
  • 20
    • 79251504591 scopus 로고    scopus 로고
    • Optimizing Halley's iteration for computing the matrix polar decomposition
    • Y. Nakatsukasa, Z. Bai, and F. Gygi, Optimizing Halley's iteration for computing the matrix polar decomposition, SIAM J. Matrix Anal. Appl., 31 (2010), pp. 2700-2720.
    • (2010) SIAM J. Matrix Anal. Appl. , vol.31 , pp. 2700-2720
    • Nakatsukasa, Y.1    Bai, Z.2    Gygi, F.3
  • 21
    • 84865499122 scopus 로고    scopus 로고
    • Stable and efficient spectral divide and conquer algorithms for the symmetric eigenvalue decomposition and the SVD
    • Manchester Institute for Mathematical Sciences, The University of Manchester, UK in preparation
    • Y. Nakatsukasa and N. J. Higham, Stable and efficient spectral divide and conquer algorithms for the symmetric eigenvalue decomposition and the SVD, MIMS EPrint, Manchester Institute for Mathematical Sciences, The University of Manchester, UK, 2012, in preparation.
    • (2012) MIMS EPrint
    • Nakatsukasa, Y.1    Higham, N.J.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.