메뉴 건너뛰기




Volumn 21, Issue 4, 1999, Pages 1337-1356

Distributed Schur complement techniques for general sparse linear systems

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; GRAPH THEORY; INVERSE PROBLEMS; LINEAR SYSTEMS; MATRIX ALGEBRA; PARALLEL PROCESSING SYSTEMS;

EID: 0033294485     PISSN: 10648275     EISSN: None     Source Type: None    
DOI: 10.1137/S1064827597328996     Document Type: Article
Times cited : (112)

References (31)
  • 2
    • 0000131670 scopus 로고
    • Iterative solution of large sparse linear systems arising in certain multidimensional approximation problems
    • M. W. BENSON AND P. O. FREDERICKSON, Iterative solution of large sparse linear systems arising in certain multidimensional approximation problems, Utilitas Math., 22 (1982), pp. 127-140.
    • (1982) Utilitas Math. , vol.22 , pp. 127-140
    • Benson, M.W.1    Frederickson, P.O.2
  • 3
    • 0042403046 scopus 로고
    • Multiplicative and additive Schwarz methods: Convergence in the two-domain case
    • T. Chan, R. Glowinski, J. Périaux, and O. Widlund, eds., SIAM, Philadelphia, PA
    • P. E. BJØRSTAD, Multiplicative and Additive Schwarz methods: Convergence in the two-domain case, in Domain Decomposition Methods, T. Chan, R. Glowinski, J. Périaux, and O. Widlund, eds., SIAM, Philadelphia, PA, 1989.
    • (1989) Domain Decomposition Methods
    • Bjørstad, P.E.1
  • 4
    • 0000020556 scopus 로고
    • To overlap or not to overlap: A note on a domain decomposition method for elliptic problems
    • P. E. BJØRSTAD AND O. B. WIDLUND, To overlap or not to overlap: A note on a domain decomposition method for elliptic problems, SIAM J. Sci. Statist. Comput., 10 (1989), pp. 1053-1061.
    • (1989) SIAM J. Sci. Statist. Comput. , vol.10 , pp. 1053-1061
    • Bjørstad, P.E.1    Widlund, O.B.2
  • 5
    • 84985341546 scopus 로고
    • A comparison of some domain decomposition and ILU preconditioned iterative methods for nonsymmetric elliptic problems
    • X.-C. CAI, W. D. GROPP, AND D. E. KEYES, A comparison of some domain decomposition and ILU preconditioned iterative methods for nonsymmetric elliptic problems, Numer. Linear Algebra Appl., 1 (1994), pp. 477-504.
    • (1994) Numer. Linear Algebra Appl. , vol.1 , pp. 477-504
    • Cai, X.-C.1    Gropp, W.D.2    Keyes, D.E.3
  • 6
    • 0031261348 scopus 로고    scopus 로고
    • Approximate inverse techniques for block-partitioned matrices
    • E. CHOW AND Y. SAAD, Approximate inverse techniques for block-partitioned matrices, SIAM J. Sci. Comput., 18 (1997), pp. 1657-1675.
    • (1997) SIAM J. Sci. Comput. , vol.18 , pp. 1657-1675
    • Chow, E.1    Saad, Y.2
  • 7
    • 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
  • 8
    • 0013269731 scopus 로고    scopus 로고
    • University of Florida sparse matrix collection
    • T. DAVIS, University of Florida sparse matrix collection, NA Digest. 97 (1997); also available online at http://www.cise.ufl.edu/~davis/sparse.
    • (1997) NA Digest. , vol.97
    • Davis, T.1
  • 16
    • 0001253456 scopus 로고
    • A comparison of domain decomposition techniques for elliptic, partial differ ential equation and their parallel implementation
    • D. E. KEYES AND W. D. GROPP, A comparison of domain decomposition techniques for elliptic, partial differ ential equation and their parallel implementation, SIAM J. Sci. Statist. Comput., 8 (1987), pp. s166-s202.
    • (1987) SIAM J. Sci. Statist. Comput. , vol.8
    • Keyes, D.E.1    Gropp, W.D.2
  • 21
    • 0000812783 scopus 로고
    • Partitioning sparse matrices with, eigenvectors of graphs
    • A. POTHEN, H. D. SIMON, AND K. P. LIOU, Partitioning sparse matrices with, eigenvectors of graphs, SIAM J. Matrix Anal. Appl., 11 (1990), pp. 430-452.
    • (1990) SIAM J. Matrix Anal. Appl. , vol.11 , pp. 430-452
    • Pothen, A.1    Simon, H.D.2    Liou, K.P.3
  • 23
    • 0000954680 scopus 로고
    • A flexible inner-outer preconditioned GMRES algorithm
    • Y. SAAD, A flexible inner-outer preconditioned GMRES algorithm, SIAM J. Sci. Statist. Comput., 14 (1993), pp. 461-469.
    • (1993) SIAM J. Sci. Statist. Comput. , vol.14 , pp. 461-469
    • Saad, Y.1
  • 24
    • 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
  • 27
    • 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 (1986), pp. 856-869.
    • (1986) SIAM J. Sci. Statist. Comput. , vol.7 , pp. 856-869
    • Saad, Y.1    Schultz, M.H.2
  • 28
    • 0000874148 scopus 로고    scopus 로고
    • Domain decomposition and multi-level type techniques for general sparse linear systems
    • AMS, Providence, RI
    • Y. SAAD, M. SOSONKINA, AND J. ZHANG, Domain Decomposition and Multi-Level Type Techniques for General Sparse Linear Systems, Contemp. Math. 218, AMS, Providence, RI, 1998.
    • (1998) Contemp. Math. , vol.218
    • Saad, Y.1    Sosonkina, M.2    Zhang, J.3


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