메뉴 건너뛰기




Volumn 3, Issue 4, 1996, Pages 329-343

DQGMRES: A direct quasi-minimal residual algorithm based on incomplete orthogonalization

Author keywords

GMRES; Incomplete orthogonalization; Iterative methods; Krylov methods; Quasiminimization

Indexed keywords


EID: 21344474772     PISSN: 10705325     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1099-1506(199607/08)3:4<329::AID-NLA86>3.0.CO;2-8     Document Type: Article
Times cited : (27)

References (23)
  • 1
    • 0002807741 scopus 로고
    • The principle of minimized iteration in the solution of the matrix eigenvalue problem
    • W. E. Arnoldi. The principle of minimized iteration in the solution of the matrix eigenvalue problem. Quart. Appl. Math., 9, 17-29, 1951.
    • (1951) Quart. Appl. Math. , vol.9 , pp. 17-29
    • Arnoldi, W.E.1
  • 2
    • 0001116752 scopus 로고
    • A block generalized conjugate gradient solver with inner iterations and variable step preconditioning
    • O. Axelsson and P. S. Vassilevski. A block generalized conjugate gradient solver with inner iterations and variable step preconditioning. SIAM J. Mat. Anal., 12, 1991.
    • (1991) SIAM J. Mat. Anal. , vol.12
    • Axelsson, O.1    Vassilevski, P.S.2
  • 3
    • 0022738825 scopus 로고
    • Matrix-free methods for stiff systems of ODEs
    • P. N. Brown and A. C. Hindmarsh. Matrix-free methods for stiff systems of ODEs. SIAM J. Numer. Anal., 23, 610-638, 1986.
    • (1986) SIAM J. Numer. Anal. , vol.23 , pp. 610-638
    • Brown, P.N.1    Hindmarsh, A.C.2
  • 4
    • 0000011239 scopus 로고
    • Variational iterative methods for nonsymmetric systems of linear equations
    • S. C. Eisenstat, H. C. Elman and M. H. Schultz. Variational iterative methods for nonsymmetric systems of linear equations. SIAM J. Numer. Anal., 20, 345-357, 1983.
    • (1983) SIAM J. Numer. Anal. , vol.20 , pp. 345-357
    • Eisenstat, S.C.1    Elman, H.C.2    Schultz, M.H.3
  • 5
    • 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, 352-362, 1984.
    • (1984) SIAM J. Numer. Anal. , vol.21 , pp. 352-362
    • Faber, V.1    Manteuffel, T.2
  • 6
    • 38249009170 scopus 로고
    • Quasi-kernel polynomials and their use in Non-Hermitian matrix iterations
    • R. W. Freund. Quasi-kernel polynomials and their use in Non-Hermitian matrix iterations. Journal of Computational and Applied Mathematics, 34, 135-158, 1992.
    • (1992) Journal of Computational and Applied Mathematics , vol.34 , pp. 135-158
    • Freund, R.W.1
  • 7
    • 0039170145 scopus 로고
    • Quasi-kernel polynomials and convergence results for quasi-minimal residual iterations
    • Braess and Schumack, editors, Birkhauser, Basel
    • R. W. Freund. Quasi-kernel polynomials and convergence results for quasi-minimal residual iterations. In Numerical Methods of Approximation Theory, Braess and Schumack, editors, Birkhauser, Basel, 1992, pp. 77-95.
    • (1992) Numerical Methods of Approximation Theory , pp. 77-95
    • Freund, R.W.1
  • 8
    • 25444452938 scopus 로고
    • QMR, a quasi-minimal residual method for non-Hermitian linear systems
    • R. W. Freund and N. M. Nachtigal. QMR, a quasi-minimal residual method for non-Hermitian linear systems. Numer. Math., 60, 315-339, 1991.
    • (1991) Numer. Math. , vol.60 , pp. 315-339
    • Freund, R.W.1    Nachtigal, N.M.2
  • 9
    • 0001031880 scopus 로고
    • A transpose-free quasi-minimal residual algorithm for non-Hermitian linear systems
    • R. W. Freund. A transpose-free quasi-minimal residual algorithm for non-Hermitian linear systems. SIAM J. Sci. Comput., 14(2), 470-482, 1993.
    • (1993) SIAM J. Sci. Comput. , vol.14 , Issue.2 , pp. 470-482
    • Freund, R.W.1
  • 10
    • 85033054166 scopus 로고
    • On IGMRES(q), incomplete generalized minimal residual methods for large unsymmetric linear systems
    • Department of Mathematics, University of Bielefeld, Sonderforschungsbereich 343, 1994. Last revision March
    • Z. Jia. On IGMRES(q), incomplete generalized minimal residual methods for large unsymmetric linear systems. Technical Report 94-047, Department of Mathematics, University of Bielefeld, Sonderforschungsbereich 343, 1994. Last revision March, 1995.
    • (1995) Technical Report , vol.94 , Issue.47
    • Jia, Z.1
  • 12
    • 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, 856-869, 1986.
    • (1986) SIAM J. Sci. Statist. Comput. , vol.7 , pp. 856-869
    • Saad, Y.1    Schultz, M.H.2
  • 13
    • 25444507735 scopus 로고
    • DQGMRES, a quasi-minimal residual algorithm based on incomplete orthogonalization
    • Minnesota Supercomputing Institute, Minneapolis
    • Y. Saad and K. Wu. DQGMRES, a quasi-minimal residual algorithm based on incomplete orthogonalization. Technical Report UMSI-93/131, Minnesota Supercomputing Institute, Minneapolis, 1993.
    • (1993) Technical Report , vol.UMSI-93-131
    • Saad, Y.1    Wu, K.2
  • 14
    • 0010543164 scopus 로고
    • Design of an iterative solution module for a parallel matrix library (P-SPARSLIB)
    • W. Schonauer, editor, Was TR 94-59, Department of Computer Science, University of Minnesota
    • Y. Saad and K. Wu. Design of an iterative solution module for a parallel matrix library (P-SPARSLIB). In Proceedings of IMACS conference, Georgia, 1994, W. Schonauer, editor, 1995. Was TR 94-59, Department of Computer Science, University of Minnesota.
    • (1995) Proceedings of IMACS Conference, Georgia, 1994
    • Saad, Y.1    Wu, K.2
  • 15
    • 84966222159 scopus 로고
    • Krylov subspace methods for solving large unsymmetric linear systems
    • Y. Saad. Krylov subspace methods for solving large unsymmetric linear systems. Math. Comput., 37, 105-126, 1981.
    • (1981) Math. Comput. , vol.37 , pp. 105-126
    • Saad, Y.1
  • 16
    • 0008314496 scopus 로고
    • Practical use of some Krylov subspace methods for solving indefinite and unsymmetric linear systems
    • Y. Saad. Practical use of some Krylov subspace methods for solving indefinite and unsymmetric linear systems. SIAM J. Sci. Statist. Comput., 5, 203-228, 1984.
    • (1984) SIAM J. Sci. Statist. Comput. , vol.5 , pp. 203-228
    • Saad, Y.1
  • 17
    • 0003550735 scopus 로고
    • SPARSKIT, A basic toolkit for sparse matrix computations
    • Research Institute for Advanced Computer Science, NASA Ames Research Center, Moffet Field, CA
    • Y. Saad. SPARSKIT, A basic toolkit for sparse matrix computations. Technical Report 90-20, Research Institute for Advanced Computer Science, NASA Ames Research Center, Moffet Field, CA, 1990. Software currently available at 〈ftp,//ftp.cs.umn.edu/dept/sparse/〉.
    • (1990) Technical Report , vol.90 , Issue.20
    • Saad, Y.1
  • 18
    • 0000954680 scopus 로고
    • A flexible inner-outer preconditioned GMRES algorithm
    • Y. Saad. A flexible inner-outer preconditioned GMRES algorithm. SIAM J. Sci. Comput., 14(2), 461-469, 1993.
    • (1993) SIAM J. Sci. Comput. , vol.14 , Issue.2 , pp. 461-469
    • Saad, Y.1
  • 19
    • 84985408358 scopus 로고
    • ILUT, a dual threshold incomplete ILU factorization
    • Y. Saad. ILUT, a dual threshold incomplete ILU factorization. Numerical Linear Algebra with Applications, 1, 387-402, 1994.
    • (1994) Numerical Linear Algebra with Applications , vol.1 , pp. 387-402
    • Saad, Y.1
  • 20
    • 0016873451 scopus 로고
    • Orthomin, an iterative method for solving sparse sets of simultaneous linear equations
    • Society of Petroleum Engineers of AIME
    • P. K. W. Vinsome. Orthomin, an iterative method for solving sparse sets of simultaneous linear equations. In Proceedings of the Fourth Symposium on Reservoir Simulation, pp. 149-159. Society of Petroleum Engineers of AIME, 1976.
    • (1976) Proceedings of the Fourth Symposium on Reservoir Simulation , pp. 149-159
    • Vinsome, P.K.W.1
  • 22
    • 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, 631-644, 1992.
    • (1992) SIAM J. Sci. Statist. Comput. , vol.13 , pp. 631-644
    • Van Der Vorst, H.A.1


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