메뉴 건너뛰기




Volumn 42, Issue 5, 2005, Pages 2148-2158

Orthogonal Hessenberg reduction and orthogonal Krylov subspace bases

Author keywords

B normality; Hessenberg reduction; Krylov subspace methods; Linear systems; Matrix decomposition; Normal matrices; Short term recurrences

Indexed keywords

B-NORMALITY; HESSENBERG REDUCTION; KRYLOV SUBSPACE METHODS; MATRIX DECOMPOSITION; NORMAL MATRICES; SHORT-TERM RECURRENCES;

EID: 20044365008     PISSN: 00361429     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0036142903393372     Document Type: Article
Times cited : (13)

References (12)
  • 1
    • 0034342178 scopus 로고    scopus 로고
    • Multiple recursion conjugate gradient algorithms Part I: Sufficient conditions
    • T. BARTH AND T. MANTEUFFEL, Multiple recursion conjugate gradient algorithms Part I: Sufficient conditions, SIAM J. Matrix Anal. Appl., 21 (2000), pp. 768-796.
    • (2000) SIAM J. Matrix Anal. Appl. , vol.21 , pp. 768-796
    • Barth, T.1    Manteuffel, T.2
  • 2
    • 27744593981 scopus 로고    scopus 로고
    • The best of the 20th century: Editors name top 10 algorithms
    • B. A. CIPRA, The Best of the 20th Century: Editors Name Top 10 Algorithms, SIAM News, 33 (2000).
    • (2000) SIAM News , vol.33
    • Cipra, B.A.1
  • 3
  • 4
    • 0021416130 scopus 로고
    • Necessary and sufficient conditions for the existence of a conjugate gradient method
    • V. FABER AND T. MANTEUFFEL, Necessary and sufficient conditions for the existence of a conjugate gradient method, SIAM J. Numer. Anal., 21 (1984), pp. 352-362.
    • (1984) SIAM J. Numer. Anal. , vol.21 , pp. 352-362
    • Faber, V.1    Manteuffel, T.2
  • 6
    • 0000382130 scopus 로고    scopus 로고
    • Minimum residual methods for augmented systems
    • B. FISCHER, A. RAMAGE, D. J. SILVESTER, AND A. J. WATHEN, Minimum residual methods for augmented systems, BIT, 38 (1998), pp. 527-543.
    • (1998) BIT , vol.38 , pp. 527-543
    • Fischer, B.1    Ramage, A.2    Silvester, D.J.3    Wathen, A.J.4
  • 9
    • 38249035216 scopus 로고
    • Necessary and sufficient conditions for the simplification of generalized conjugate-gradient algorithms
    • W. D. JOUBERT AND D. M. YOUNG, Necessary and sufficient conditions for the simplification of generalized conjugate-gradient algorithms, Linear Algebra Appl., 88/89 (1987), pp. 449-485.
    • (1987) Linear Algebra Appl. , vol.88-89 , pp. 449-485
    • Joubert, W.D.1    Young, D.M.2
  • 10
    • 0037321203 scopus 로고    scopus 로고
    • On the number of zeros of certain harmonic polynomials
    • D. KHAVINSON AND G. SWIATEK, On the number of zeros of certain harmonic polynomials, Proc. Amer. Math. Soc., 131 (2003), pp. 409-414.
    • (2003) Proc. Amer. Math. Soc. , vol.131 , pp. 409-414
    • Khavinson, D.1    Swiatek, G.2
  • 11
    • 0000298534 scopus 로고
    • The question of non-self-adjoint extension of the conjugate gradients method is closed
    • V. V. VOEVODIN, The question of non-self-adjoint extension of the conjugate gradients method is closed, U.S.S.R. Comput. Math. and Math. Phys., 23 (1983), pp. 143-144.
    • (1983) U.S.S.R. Comput. Math. and Math. Phys. , vol.23 , pp. 143-144
    • Voevodin, V.V.1
  • 12
    • 6044261183 scopus 로고
    • On generalization of conjugate direction methods
    • Moscow State University Press, Moscow, . English translation provided by E. E. Tyrtyshnikov
    • V. V. VOEVODIN AND E. E. TYRTYSHNIKOV, On generalization of conjugate direction methods, in Numerical Methods of Algebra (Chislennye Metody Algebry), Moscow State University Press, Moscow, 1981, pp. 3-9. English translation provided by E. E. Tyrtyshnikov.
    • (1981) Numerical Methods of Algebra (Chislennye Metody Algebry) , pp. 3-9
    • Voevodin, V.V.1    Tyrtyshnikov, E.E.2


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