메뉴 건너뛰기




Volumn 28, Issue 1, 2006, Pages 264-284

Modified Gram-Schmidt (MGS), least squares, and backward stability of MGS-GMRES

Author keywords

Arnoldi method; Backward stability; Condition numbers; Generalized minimum residual method; Iterative solution; Krylov subspace methods; Large sparse matrices; Linear equations; Modified Gram Schmidt; QR factorization; Rounding error analysis

Indexed keywords

ALGORITHMS; ERROR ANALYSIS; LINEAR EQUATIONS; PROBLEM SOLVING;

EID: 33748334951     PISSN: 08954798     EISSN: 10957162     Source Type: Journal    
DOI: 10.1137/050630416     Document Type: Article
Times cited : (107)

References (26)
  • 1
    • 0011947356 scopus 로고    scopus 로고
    • Roundoff error analysis of algorithms based on Krylov subspace methods
    • M. ARIOLI AND C. FASSINO, Roundoff error analysis of algorithms based on Krylov subspace methods, BIT, 36 (1996), pp. 189-206.
    • (1996) BIT , vol.36 , pp. 189-206
    • ARIOLI, M.1    FASSINO, C.2
  • 2
    • 0002807741 scopus 로고
    • The principle of minimized iterations in the solution of the matrix eigenvalue problem
    • W. E. ARNOLDI, The principle of minimized iterations in the solution of the matrix eigenvalue problem, Quart. Appl. Math., 9 (1951), pp. 17-29.
    • (1951) Quart. Appl. Math , vol.9 , pp. 17-29
    • ARNOLDI, W.E.1
  • 3
    • 0002168778 scopus 로고
    • Solving linear least squares problems by Gram-Schmidt orthogonalization
    • A. BJÖRCK, Solving linear least squares problems by Gram-Schmidt orthogonalization, BIT, 7 (1967), pp. 1-21.
    • (1967) BIT , vol.7 , pp. 1-21
    • BJÖRCK, A.1
  • 5
    • 0001688779 scopus 로고
    • Loss and recapture of orthogonality in the modified Gram-Schmidt algorithm
    • A. BJÖRCK AND C. C. PAIGE, Loss and recapture of orthogonality in the modified Gram-Schmidt algorithm, SIAM J. Matrix Anal. Appl., 13 (1992), pp. 176-190.
    • (1992) SIAM J. Matrix Anal. Appl , vol.13 , pp. 176-190
    • BJÖRCK, A.1    PAIGE, C.C.2
  • 6
    • 0031542319 scopus 로고    scopus 로고
    • GMRES on (nearly) singular systems
    • P. BROWN AND H. WALKER, GMRES on (nearly) singular systems, SIAM J. Matrix Anal. Appl., 18 (1997), pp. 37-51.
    • (1997) SIAM J. Matrix Anal. Appl , vol.18 , pp. 37-51
    • BROWN, P.1    WALKER, H.2
  • 10
    • 0036035449 scopus 로고    scopus 로고
    • When modified Gram-Schmidt generates a well-conditioned set of vectors
    • L. GIRAUD AND J. LANGOU, When modified Gram-Schmidt generates a well-conditioned set of vectors, IMA J. Numer. Anal., 22 (2002), pp. 521-528.
    • (2002) IMA J. Numer. Anal , vol.22 , pp. 521-528
    • GIRAUD, L.1    LANGOU, J.2
  • 11
    • 0004236492 scopus 로고    scopus 로고
    • 3rd ed, The Johns Hopkins University Press, Baltimore
    • G. H. GOLUB AND C. F. VAN LOAN, Matrix Computations, 3rd ed., The Johns Hopkins University Press, Baltimore, 1996.
    • (1996) Matrix Computations
    • GOLUB, G.H.1    VAN LOAN, C.F.2
  • 12
    • 0001264814 scopus 로고    scopus 로고
    • Numerical behavior of the modified Gram-Schmidt GMRES implementation
    • A. GREENBAUM, M. ROZLOŽNÍK, AND Z. STRAKOŠ, Numerical behavior of the modified Gram-Schmidt GMRES implementation, BIT, 37 (1997), pp. 706-719.
    • (1997) BIT , vol.37 , pp. 706-719
    • GREENBAUM, A.1    ROZLOŽNÍK, M.2    STRAKOŠ, Z.3
  • 15
    • 0036985623 scopus 로고    scopus 로고
    • Least squares residuals and minimal residual methods
    • J. LIESEN, M. ROZLOŽNÍK, AND Z. STRAKOŠ, Least squares residuals and minimal residual methods, SIAM J. Sci. Comput., 23 (2002), pp. 1503-1525.
    • (2002) SIAM J. Sci. Comput , vol.23 , pp. 1503-1525
    • LIESEN, J.1    ROZLOŽNÍK, M.2    STRAKOŠ, Z.3
  • 16
    • 0039943513 scopus 로고
    • LSQR: An algorithm for sparse linear equations and sparse least squares
    • C. C. PAIGE AND M. A. SAUNDERS, LSQR: An algorithm for sparse linear equations and sparse least squares, ACM Trans. Math. Software, 8 (1982), pp. 43-71.
    • (1982) ACM Trans. Math. Software , vol.8 , pp. 43-71
    • PAIGE, C.C.1    SAUNDERS, M.A.2
  • 17
    • 0036013505 scopus 로고    scopus 로고
    • Bounds for the least squares distance using scaled total least squares
    • C. C. PAIGE AND Z. STRAKOŠ, Bounds for the least squares distance using scaled total least squares, Numer. Math., 91 (2002), pp. 93-115.
    • (2002) Numer. Math , vol.91 , pp. 93-115
    • PAIGE, C.C.1    STRAKOŠ, Z.2
  • 18
    • 0036447618 scopus 로고    scopus 로고
    • Residual and backward error bounds in minimum residual Krylov subspace methods
    • C. C. PAIGE AND Z. STRAKOŠ, Residual and backward error bounds in minimum residual Krylov subspace methods, SIAM J. Sci. Comput., 23 (2002), pp. 1898-1923.
    • (2002) SIAM J. Sci. Comput , vol.23 , pp. 1898-1923
    • PAIGE, C.C.1    STRAKOŠ, Z.2
  • 19
    • 0004154450 scopus 로고    scopus 로고
    • Ph.D. thesis, Institute of Computer Science, Academy of Sciences, Prague, Czech Republic
    • M. ROZLOŽNÍK, Numerical Stability of the GMRES Method, Ph.D. thesis, Institute of Computer Science, Academy of Sciences, Prague, Czech Republic, 1997.
    • (1997) Numerical Stability of the GMRES Method
    • ROZLOŽNÍK, M.1
  • 20
    • 0000048673 scopus 로고
    • GMRES: A generalized minimal residual algorithm for solving nonsymmetric linear systems
    • Y. SAAD AND M. H. SCHULTZ, GMRES: A generalized minimal residual algorithm for solving nonsymmetric linear systems, SIAM J. Sci. Statist. Comput., 7 (1986), pp. 856-869.
    • (1986) SIAM J. Sci. Statist. Comput , vol.7 , pp. 856-869
    • SAAD, Y.1    SCHULTZ, M.H.2
  • 21
    • 0002090018 scopus 로고
    • Condition numbers and equilibration matrices
    • A. VAN DER SLUIS, Condition numbers and equilibration matrices, Numer. Math., 14 (1969), pp. 14-23.
    • (1969) Numer. Math , vol.14 , pp. 14-23
    • VAN DER SLUIS, A.1
  • 22
    • 34250412349 scopus 로고
    • Stability of the solutions of linear least squares problems
    • A. VAN DER SLUIS, Stability of the solutions of linear least squares problems, Numer. Math., 23 (1975), pp. 241-254.
    • (1975) Numer. Math , vol.23 , pp. 241-254
    • VAN DER SLUIS, A.1
  • 23
    • 0033264629 scopus 로고    scopus 로고
    • Some results about GMRES in the singular case
    • L. SMOCH, Some results about GMRES in the singular case, Numer. Algorithms, 22 (1999), pp. 193-212.
    • (1999) Numer. Algorithms , vol.22 , pp. 193-212
    • SMOCH, L.1
  • 24
    • 0000005482 scopus 로고
    • Bi-CGSTAB: A fast and smoothly converging variant of Bi-CG for the solution of nonsymmetric linear systems
    • H. A. VAN DER VORST, Bi-CGSTAB: A fast and smoothly converging variant of Bi-CG for the solution of nonsymmetric linear systems, SIAM J. Sci. Statist. Comput., 13 (1992), pp. 631-644.
    • (1992) SIAM J. Sci. Statist. Comput , vol.13 , pp. 631-644
    • VAN DER VORST, H.A.1
  • 25
    • 0024664656 scopus 로고
    • Implementation of the GMRES method
    • H. F. WALKER, Implementation of the GMRES method, J. Comput. Phys., 53 (1989), pp. 311-320.
    • (1989) J. Comput. Phys , vol.53 , pp. 311-320
    • WALKER, H.F.1


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