메뉴 건너뛰기




Volumn 24, Issue 1, 2003, Pages 219-237

On the relations between ILUs and factored approximate inverses

Author keywords

ILU; Sparse approximate inverse; Sparse matrices; Variants of ILU

Indexed keywords


EID: 0037288882     PISSN: 08954798     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895479800372110     Document Type: Article
Times cited : (39)

References (25)
  • 2
    • 0034889465 scopus 로고    scopus 로고
    • Robust approximate inverse preconditioning for the conjugate gradient method
    • M. BENZI, J. K. CULLUM, AND M. TŮMA, Robust approximate inverse preconditioning for the conjugate gradient method, SIAM J. Sci. Comput., 22 (2000), pp. 1318-1332.
    • (2000) SIAM J. Sci. Comput. , vol.22 , pp. 1318-1332
    • Benzi, M.1    Cullum, J.K.2    Tůma, M.3
  • 3
    • 0004675411 scopus 로고    scopus 로고
    • A sparse approximate inverse preconditioner for the conjugate gradient method
    • M. BENZI, C. D. MEYER, AND M. TŮMA, A sparse approximate inverse preconditioner for the conjugate gradient method, SIAM J. Sci. Comput., 17 (1996), pp. 1135-1149.
    • (1996) SIAM J. Sci. Comput. , vol.17 , pp. 1135-1149
    • Benzi, M.1    Meyer, C.D.2    Tůma, M.3
  • 4
    • 0001135947 scopus 로고    scopus 로고
    • A sparse approximate inverse preconditioner for nonsymraetric linear systems
    • M. BENZI AND M. TŮMA, A sparse approximate inverse preconditioner for nonsymraetric linear systems, SIAM J. Sci. Comput., 19 (1998), pp. 968-994.
    • (1998) SIAM J. Sci. Comput. , vol.19 , pp. 968-994
    • Benzi, M.1    Tůma, M.2
  • 5
    • 0013532162 scopus 로고    scopus 로고
    • A robust incomplete factorization preconditioner for positive definite matrices
    • to appear
    • M. BENZI AND M. TŮMA, A robust incomplete factorization preconditioner for positive definite matrices, Numer. Linear Algebra Appl., to appear.
    • Numer. Linear Algebra Appl.
    • Benzi, M.1    Tůma, M.2
  • 6
    • 0035889740 scopus 로고    scopus 로고
    • A robust ILU with pivoting based on monitoring the growth of the inverse factors
    • M. BOLLHÖFER, A robust ILU with pivoting based on monitoring the growth of the inverse factors, Linear Algebra Appl., 338 (2001), pp. 201-218.
    • (2001) Linear Algebra Appl. , vol.338 , pp. 201-218
    • Bollhöfer, M.1
  • 7
    • 0036018632 scopus 로고    scopus 로고
    • A factored approximate inverse preconditioner with pivoting
    • M. BOLLHÖFER AND Y. SAAD, A factored approximate inverse preconditioner with pivoting, SIAM J. Matrix Anal. Appl., 23 (2002), pp. 692-705.
    • (2002) SIAM J. Matrix Anal. Appl. , vol.23 , pp. 692-705
    • Bollhöfer, M.1    Saad, Y.2
  • 9
    • 0001630026 scopus 로고    scopus 로고
    • Approximate inverse preconditioners via sparse-sparse iterations
    • E. CHOW AND Y. SAAD, Approximate inverse preconditioners via sparse-sparse iterations, SIAM J. Sci. Comput., 19 (1998), pp. 995-1023.
    • (1998) SIAM J. Sci. Comput. , vol.19 , pp. 995-1023
    • Chow, E.1    Saad, Y.2
  • 10
    • 0000256195 scopus 로고
    • Towards a cost-effective high order ILU preeonditioner
    • E. F. D'AZEVEDO, F. A. FORSYTH, AND W. P. TANG, Towards a cost-effective high order ILU preeonditioner, BIT, 31 (1992), pp. 442-463.
    • (1992) BIT , vol.31 , pp. 442-463
    • D'Azevedo, E.F.1    Forsyth, F.A.2    Tang, W.P.3
  • 12
    • 0003241196 scopus 로고    scopus 로고
    • Iterative methods for solving linear systems
    • SIAM, Philadelphia
    • A. GREENBAUM, Iterative Methods for Solving Linear Systems, Frontiers Appl. Math. 17, SIAM, Philadelphia, 1997.
    • (1997) Frontiers Appl. Math. , vol.17
    • Greenbaum, A.1
  • 13
    • 0031129197 scopus 로고    scopus 로고
    • Parallel preconditioning with sparse approximate inverses
    • M. GROTE AND T. HUCKLE, Parallel preconditioning with sparse approximate inverses, SIAM J. Sci. Comput., 18 (1997), pp. 838-853.
    • (1997) SIAM J. Sci. Comput. , vol.18 , pp. 838-853
    • Grote, M.1    Huckle, T.2
  • 15
    • 84985376638 scopus 로고
    • New convergence results and preconditioning strategies for the conjugate gradient method
    • I. E. KAPORIN, New convergence results and preconditioning strategies for the conjugate gradient method, Numer. Linear Algebra Appl., 1 (1994), pp. 179-210.
    • (1994) Numer. Linear Algebra Appl. , vol.1 , pp. 179-210
    • Kaporin, I.E.1
  • 16
    • 0442281595 scopus 로고    scopus 로고
    • A reliable AINV-type preconditioning method for constructing sparse approximate inverse preconditioners in factored form
    • S. KHARCHENKO, L. KOLOTILINA, A. NIKISHIN, AND A. YEREMIN, A reliable AINV-type preconditioning method for constructing sparse approximate inverse preconditioners in factored form, Numer. Linear Algebra Appl., 8 (2001), pp. 165-179.
    • (2001) Numer. Linear Algebra Appl. , vol.8 , pp. 165-179
    • Kharchenko, S.1    Kolotilina, L.2    Nikishin, A.3    Yeremin, A.4
  • 17
    • 21144474663 scopus 로고
    • Factorized sparse approximate inverse preconditionings I. Theory
    • L.Y. KOLOTILINA AND A. Y. YEREMIN, Factorized sparse approximate inverse preconditionings I. Theory, SIAM J. Matrix Anal. Appl., 14 (1993), pp. 45-58.
    • (1993) SIAM J. Matrix Anal. Appl. , vol.14 , pp. 45-58
    • Kolotilina, L.Y.1    Yeremin, A.Y.2
  • 18
    • 84966241510 scopus 로고
    • An incomplete factorization technique for positive definite linear systems
    • T. MANTEUFFEL, An incomplete factorization technique for positive definite linear systems, Math. Comp., 34 (1980), pp. 473-490.
    • (1980) Math. Comp. , vol.34 , pp. 473-490
    • Manteuffel, T.1
  • 19
    • 84966225158 scopus 로고
    • An iterative solution method for linear systems of which the coefficient matrix is a symmetric M-matrix
    • J. MEIJERINK AND H. A. VAN DER VORST, An iterative solution method for linear systems of which the coefficient matrix is a symmetric M-matrix, Math. Comp., 31 (1977), pp. 148-162.
    • (1977) Math. Comp. , vol.31 , pp. 148-162
    • Meijerink, J.1    Van Der Vorst, H.A.2
  • 20
    • 84976824344 scopus 로고
    • Solving sparse symmetric sets of linear equations by preconditioned conjugate gradient method
    • N. MUNKSGAARD, Solving sparse symmetric sets of linear equations by preconditioned conjugate gradient method, ACM Trans. Math. Software, 6 (1980), pp. 206-219.
    • (1980) ACM Trans. Math. Software , vol.6 , pp. 206-219
    • Munksgaard, N.1
  • 21
    • 84985408358 scopus 로고
    • ILUT: A dual threshold incomplete ILU faetorization
    • Y. SAAD, ILUT: A dual threshold incomplete ILU faetorization, Numer. Linear Algebra Appl., 1 (1994), pp. 387-402.
    • (1994) Numer. Linear Algebra Appl. , vol.1 , pp. 387-402
    • Saad, Y.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
  • 25
    • 0001481227 scopus 로고
    • Use of iterative refinement in the solution of sparse linear systems
    • Z. ZLATEV, Use of iterative refinement in the solution of sparse linear systems, SIAM J. Numer. Anal., 19 (1982), pp. 381-399.
    • (1982) SIAM J. Numer. Anal. , vol.19 , pp. 381-399
    • Zlatev, Z.1


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