Distributed ILU(0) and SOR Preconditioners for Unstructured Sparse Linear Systems
暂无分享,去创建一个
[1] Y. Saad,et al. Krylov Subspace Methods on Supercomputers , 1989 .
[2] C.-C. Jay Kuo,et al. Two-Color Fourier Analysis of Iterative Algorithms for Elliptic Problems with Red/Black Ordering , 1990, SIAM J. Sci. Comput..
[3] Kesheng Wu,et al. BASIC SPARSE MATRIX COMPUTATIONS ON THE CM-5 , 1993 .
[4] H. Elman. Iterative methods for large, sparse, nonsymmetric systems of linear equations , 1982 .
[5] Y. Saad,et al. GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems , 1986 .
[6] Yousef Saad,et al. A Flexible Inner-Outer Preconditioned GMRES Algorithm , 1993, SIAM J. Sci. Comput..
[7] Yousef Saad,et al. ILUT: A dual threshold incomplete LU factorization , 1994, Numer. Linear Algebra Appl..
[8] Youcef Saad,et al. Highly Parallel Preconditioners for General Sparse Matrices , 1994 .
[9] J. Meijerink,et al. An iterative solution method for linear systems of which the coefficient matrix is a symmetric -matrix , 1977 .
[10] D. O’Leary. Ordering Schemes for Parallel Processing of Certain Mesh Problems , 1984 .
[11] Michael R. Leuze,et al. Independent set orderings for parallel matrix factorization by Gaussian elimination , 1989, Parallel Comput..
[12] P. E. Plassmann,et al. Parallel iterative solution of sparse linear systems using orderings from graph coloring heuristics , 1990 .
[13] Youcef Saad,et al. A Basic Tool Kit for Sparse Matrix Computations , 1990 .