메뉴 건너뛰기




Volumn 2, Issue 1, 2000, Pages 32-37

Krylov Subspace Iteration

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0002912235     PISSN: 15219615     EISSN: None     Source Type: Journal    
DOI: 10.1109/5992.814655     Document Type: Review
Times cited : (35)

References (11)
  • 5
    • 0002814189 scopus 로고
    • Solution of Systems of Linear Equations by Minimized Iterations
    • C. Lanczos, "Solution of Systems of Linear Equations by Minimized Iterations",J. Research Nat'l Bureau of Standards, Vol. 49, 1952, pp. 33-53.
    • (1952) J. Research Nat'l Bureau of Standards , vol.49 , pp. 33-53
    • Lanczos, C.1
  • 6
    • 0002807741 scopus 로고
    • The Principle of Minimized Iteration in the Solution of the Matrix Eigenproblem
    • W.E. Arnoldi, "The Principle of Minimized Iteration in the Solution of the Matrix Eigenproblem," Quarterly Applied Mathematics, Vol. 9, 1951, pp. 17-29.
    • (1951) Quarterly Applied Mathematics , vol.9 , pp. 17-29
    • Arnoldi, W.E.1
  • 7
    • 0000135303 scopus 로고
    • Methods of Conjugate Gradients for Solving Linear Systems
    • M.R. Hestenes and E. Stiefel, "Methods of Conjugate Gradients for Solving Linear Systems," J. Research Nat'l Bureau of Standards, Vol. 49, 1954, pp. 409-436.
    • (1954) J. Research Nat'l Bureau of Standards , vol.49 , pp. 409-436
    • Hestenes, M.R.1    Stiefel, E.2
  • 8
    • 0000897487 scopus 로고
    • The Use of Conjugate Gradients for Systems of Equations Possessing 'Property A'
    • J.K. Reid, "The Use of Conjugate Gradients for Systems of Equations Possessing 'Property A,'" SIAM J. Numerical Analysis, Vol. 9, 1972, pp. 325-332.
    • (1972) SIAM J. Numerical Analysis , vol.9 , pp. 325-332
    • Reid, J.K.1
  • 9
    • 0002497330 scopus 로고
    • The Incomplete Choleski-Conjugate Gradient Method for the Iterative Solution of Systems of Linear Equations
    • D.S. Kershaw, "The Incomplete Choleski-Conjugate Gradient Method for the Iterative Solution of Systems of Linear Equations." J. Computational Physics, Vol. 26, No. 1, 1978, pp. 43-65.
    • (1978) J. Computational Physics , vol.26 , Issue.1 , pp. 43-65
    • Kershaw, D.S.1
  • 10
    • 0000048673 scopus 로고
    • GMRES: A Generalized Minimal Residual Algorithm for Solving Nnonsymmetric Linear Systems
    • Y. Saad and M.H. Schultz, "GMRES: A Generalized Minimal Residual Algorithm for Solving Nnonsymmetric Linear Systems," SIAM J. Scientific and Statistical Computing, Vol. 7, No. 3, 1986, pp. 856-869.
    • (1986) SIAM J. Scientific and Statistical Computing , vol.7 , Issue.3 , pp. 856-869
    • Saad, Y.1    Schultz, M.H.2
  • 11
    • 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. Scientific and Statistical Computing, Vol. 13, No. 2, 1992, pp. 631-644.
    • (1992) SIAM J. Scientific and Statistical Computing , vol.13 , Issue.2 , pp. 631-644
    • Van Der Vorst, H.A.1


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