Efficient parallel computation of ILU(k) preconditioners

ACM/IEEE SC 1999 Conference, SC 1999

Volumn , Issue , 1999, Pages 29-

  Hysom, David ^a   Pothen, Alex ^a  

^a ECS Building   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84969170205     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SC.1999.10042     Document Type: Conference Paper

References (14)

1. S. Balay,W. D. Gropp, L. Curfman McInnes, and B. F. Smith. PETSc home page. http://www.mcs.anl.gov/petsc, 1999.
2. M. Benzi, W. Joubert, and G Mateescu. Numerical experiments with parallel orderings for ILU preconditioners. Elec. Trans. on Numer. Anal., 8:88-114, 1999.
3. T. C. Chan and H. A. Van der Vorst. Approximate and Incomplete Factorizations, in Parallel Numerical Algorithms. D. E. Keyes, A. Sameh, and V. Venkatakrishnan (eds.), pp. 167-202, Kluwer Academic, Dordrecht, 1997.
4. E. Chow and M. A. Heroux. Block preconditioning toolkit. http://wwwusers. cs.umn.edu/chow/bpkit.html, 1997.
5. E. Chow and Y. Saad. Experimental study of ILU preconditioners of indefinite matrices. J. Comput. Appl. Math, 86:387-414, 1997.
6. E. F. D'Azevedo, P. A. Forsyth, and W.-P. Tang. Towards a cost-effective ILU preconditioner with high level fill. BIT, 32:442-463, 1992.
7. I. S. Duff and G. A. Meurant. The effect of ordering on preconditioned conjugate gradients. BIT, 29, 1983.
8. S. Dui and A. Lichnewsky. A graph-theory approach for analyzing the effects of ordering on ILU preconditioning. Technical Report 1452, Institut National de Recherche in Informatique et en Automatique, Rocqhencourt, BP105-78153, Le Chesnay Cedex, France, 1991.
9. V. Eijkhout. Analysis of parallel incomplete point factorizations. Lin. Algebra. Applic., 154-156:723-740, 1991.
10. G. Karypis and V. Kumar. Parallel threshold-based ILU factorization. Technical Report 061, University of Minnesota, Department of Computer Science/Army HPC Research Center, Minneapolis, MN 5455, 1998.
11. A. Pothen and D Hysom. Fast algorithms for incomplete factorization. in prepatation.
12. D. J. Rose and R. E. Tarjan. Algorithmic aspects of vertex elimination on directed graphs. SIAM J. Appl. Math., 23(1):176-197, 1978.
13. Y. Saad. Sparskit, version 2. http://www-users.cs.umn.edu/saad/software.html, 1990, 1994.
14. Y. Saad. ILUT: A dual-threshold incomplete LU factorization. Numer. Linear Algebra Appl., pages 387-402, 1994.