메뉴 건너뛰기




Volumn 27, Issue 5, 2006, Pages 1627-1650

Multilevel preconditioners constructed from inverse-based ILUs

Author keywords

Algebraic multilevel method; Approximate inverse; ILU; Incomplete LU decompositions; Iterative solver; Multilevel ILU; Preconditioning

Indexed keywords

NUMERICAL METHODS; ROBUSTNESS (CONTROL SYSTEMS); STRATEGIC PLANNING;

EID: 33746787907     PISSN: 10648275     EISSN: None     Source Type: Journal    
DOI: 10.1137/040608374     Document Type: Conference Paper
Times cited : (121)

References (23)
  • 2
    • 0034884436 scopus 로고    scopus 로고
    • Preconditioning highly indefinite and nonsymmetric matrices
    • M. BENZI, J. C. HAWS, AND M. TŮMA, Preconditioning highly indefinite and nonsymmetric matrices, SIAM J. Sci. Comput., 22 (2000), pp. 1333-1353.
    • (2000) SIAM J. Sci. Comput. , vol.22 , pp. 1333-1353
    • Benzi, M.1    Haws, J.C.2    Tůma, M.3
  • 3
    • 12144291027 scopus 로고    scopus 로고
    • A robust and efficient ILU that incorporates the growth of the inverse triangular factors
    • M. BOLLHÖFER, A robust and efficient ILU that incorporates the growth of the inverse triangular factors, SIAM J. Sci. Comput., 25 (2003), pp. 86-103.
    • (2003) SIAM J. Sci. Comput. , vol.25 , pp. 86-103
    • Bollhöfer, M.1
  • 5
    • 0037288882 scopus 로고    scopus 로고
    • On the relations between ILUs and factored approximate inverses
    • M. BOLLHÖFER AND Y. SAAD, On the relations between ILUs and factored approximate inverses, SIAM J. Matrix Anal. Appl., 24 (2002), pp. 219-237.
    • (2002) SIAM J. Matrix Anal. Appl. , vol.24 , pp. 219-237
    • Bollhöfer, M.1    Saad, Y.2
  • 8
    • 2942655475 scopus 로고    scopus 로고
    • A column pre-ordering strategy for the unsyrnmetric-pattern multifrontal method
    • T. A. DAVIS, A column pre-ordering strategy for the unsyrnmetric-pattern multifrontal method, ACM Trans. Math. Software, 30 (2004), pp. 165-195.
    • (2004) ACM Trans. Math. Software , vol.30 , pp. 165-195
    • Davis, T.A.1
  • 10
    • 0033242220 scopus 로고    scopus 로고
    • The design and use of algorithms for permuting large entries to the diagonal of sparse matrices
    • I. S. DUFF AND J. KOSTER, The design and use of algorithms for permuting large entries to the diagonal of sparse matrices, SIAM J. Matrix Anal. Appl., 20 (1999), pp. 889-901.
    • (1999) SIAM J. Matrix Anal. Appl. , vol.20 , pp. 889-901
    • Duff, I.S.1    Koster, J.2
  • 13
    • 0037265634 scopus 로고    scopus 로고
    • Improved symbolic and numerical factorization algorithms for unsymmetric sparse matrices
    • A. GUPTA, Improved symbolic and numerical factorization algorithms for unsymmetric sparse matrices, SIAM J. Matrix Anal. Appl., 24 (2002), pp. 529-552.
    • (2002) SIAM J. Matrix Anal. Appl. , vol.24 , pp. 529-552
    • Gupta, A.1
  • 14
    • 2342480530 scopus 로고    scopus 로고
    • Crout versions of ILU for general sparse matrices
    • N. LI, Y. SAAD, AND E. CHOW, Crout versions of ILU for general sparse matrices, SIAM J. Sci. Comput., 25 (2003), pp. 716-728.
    • (2003) SIAM J. Sci. Comput. , vol.25 , pp. 716-728
    • Li, N.1    Saad, Y.2    Chow, E.3
  • 15
    • 20344394051 scopus 로고    scopus 로고
    • NATIONAL INSTITUTE OF STANDARDS, Matrix Market, http://math.nist.gov/MatrixMarket.
    • Matrix Market
  • 16
    • 0032397942 scopus 로고    scopus 로고
    • Node selection strategies for bottom-up sparse matrix ordering
    • E. ROTHBERG AND S. C. EISENSTAT, Node selection strategies for bottom-up sparse matrix ordering, SIAM J. Matrix Anal. Appl., 19 (1998), pp. 682-695.
    • (1998) SIAM J. Matrix Anal. Appl. , vol.19 , pp. 682-695
    • Rothberg, E.1    Eisenstat, S.C.2
  • 17
    • 84985408358 scopus 로고
    • ILUT: A dual threshold incomplete ILU factorization
    • Y. SAAD, ILUT: A dual threshold incomplete ILU factorization, Numer. Linear Algebra Appl., 1 (1994), pp. 387-402.
    • (1994) Numer. Linear Algebra Appl. , vol.1 , pp. 387-402
    • Saad, Y.1
  • 19
    • 33646546339 scopus 로고    scopus 로고
    • Multilevel ILU with reorderings for diagonal dominance
    • Y. SAAD, Multilevel ILU with reorderings for diagonal dominance, SIAM J. Sci. Comput., 27 (2005), pp. 1032-1057.
    • (2005) SIAM J. Sci. Comput. , vol.27 , pp. 1032-1057
    • Saad, Y.1
  • 20
    • 0141758510 scopus 로고    scopus 로고
    • ARMS: An algebraic recursive multilevel solver for general sparse linear systems
    • University of Minnesota at Minneapolis, Dept. of Computer Science and Engineering
    • Y. SAAD AND B. J. SUCHOMEL, ARMS: An Algebraic Recursive Multilevel Solver for General Sparse Linear Systems, Technical Report umsi-1999-107, University of Minnesota at Minneapolis, Dept. of Computer Science and Engineering, 1999.
    • (1999) Technical Report , vol.UMSI-1999-107
    • Saad, Y.1    Suchomel, B.J.2
  • 21
    • 1642370513 scopus 로고    scopus 로고
    • Solving unsymmetric sparse systems of linear equations with PARDISO
    • O. SCHENK AND K. GÄRTNER, Solving unsymmetric sparse systems of linear equations with PARDISO, J. Future Generation Comput. Syst., 20 (2004), pp. 475-487.
    • (2004) J. Future Generation Comput. Syst. , vol.20 , pp. 475-487
    • Schenk, O.1    Gärtner, K.2
  • 22
    • 0039879182 scopus 로고
    • Incomplete LU preconditioned for conjugate gradient type iterative methods
    • Dallas, TX, Society of Petroleum Engineers of AIME, paper number 13533
    • H. D. SIMON, Incomplete LU preconditioned for conjugate gradient type iterative methods, in Proceedings of the SPE 1985 Reservoir Simulation Symposium, Dallas, TX, Society of Petroleum Engineers of AIME, 1988, paper number 13533, pp. 302-306.
    • (1988) Proceedings of the SPE 1985 Reservoir Simulation Symposium , pp. 302-306
    • Simon, H.D.1
  • 23
    • 0000425921 scopus 로고
    • A new preconditioning technique for solving large sparse linear systems
    • M. TISMENETSKY, A new preconditioning technique for solving large sparse linear systems, Linear Algebra Appl., 154-156 (1991), pp. 331-353.
    • (1991) Linear Algebra Appl. , vol.154-156 , pp. 331-353
    • Tismenetsky, M.1


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