Towards an implementation of a multilevel ILU preconditioner on shared-memory computers

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

1 Citation (Scopus)
236 Downloads (Pure)

Abstract

Recently, substantial progress has been made in the development of multilevel ILU-factorizations. These methods are attractive for very large problems due to their good convergence properties. We consider the parallelization of the instance MRILU, where we restrict to a version intended for scalar problems. The most time consuming parts in using MRILU are repeated multiplication of two sparse matrices in the construction phase and the multiplication of a sparse matrix and a full vector in the solution phase. Algorithms for these operations, as well as matrix transposition, are presented and have been tested on a Cray J90.
Original languageEnglish
Title of host publicationHIGH PERFORMANCE COMPUTING AND NETWORKING, PROCEEDINGS
EditorsM Bubak, R Williams, H Afsarmanesh, B Hertzberger
Place of PublicationBERLIN
PublisherSpringer
Pages109-118
Number of pages10
ISBN (Print)3-540-67553-1
Publication statusPublished - 2000
Event8th International Conference on High Performance Computing and Networking - , Netherlands
Duration: 8-May-200010-May-2000

Publication series

NameLECTURE NOTES IN COMPUTER SCIENCE
PublisherSPRINGER-VERLAG BERLIN
Volume1823
ISSN (Print)0302-9743

Other

Other8th International Conference on High Performance Computing and Networking
CountryNetherlands
Period08/05/200010/05/2000

Keywords

  • SPARSE MATRICES

Cite this