Efficient parallel computation of ILU(k) preconditioners

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Efficient parallel computation of ILU(k) preconditioners

Full text

Pdf (118 KB)

Source

Conference on High Performance Networking and Computing archive
Proceedings of the 1999 ACM/IEEE conference on Supercomputing (CDROM) table of contents

Portland, Oregon, United States

Article No. 29

Year of Publication: 1999

ISBN:1-58113-091-0

Authors

David Hysom	Department of Computer Science, Old Dominion University, Norfolk, VA
Alex Pothen	Department of Computer Science, Old Dominion University, Norfolk, VA

Sponsors

IEEE-CS\TCCA : TC on Computer Arhitecture
SIGARCH: ACM Special Interest Group on Computer Architecture

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 33, Citation Count: 2

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/331532.331561 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	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	Edmond Chow , Yousef Saad, Experimental study of ILU preconditioners for indefinite matrices, Journal of Computational and Applied Mathematics, v.86 n.2, p.387-414, Dec. 10, 1997 [doi>10.1016/S0377-0427(97)00171-4]
	6	E. F. D'Azevedo , P. A. Forsyth , Wei-Pai Tang, Towards a cost-effective ILU preconditioner with high-level fill, BIT, v.32 n.3, p.442-463, 1992 [doi>10.1007/BF02074880]
	7	I. S. Duff , G. A. Meurant, The effect of ordering on preconditioned conjugate gradients, BIT, v.29 n.4, p.635-657, 1989 [doi>10.1007/BF01932738]
	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.

CITED BY 2

	Robert D. Falgout , Jim E. Jones , Ulrike Meier Yang, Pursuing scalability for hypre's conceptual interfaces, ACM Transactions on Mathematical Software (TOMS), v.31 n.3, p.326-350, September 2005
	Robert D. Falgout , Jim E. Jones , Ulrike Meier Yang, Conceptual interfaces in hypre, Future Generation Computer Systems, v.22 n.1, p.239-251, January 2006