Towards an Implementation of a Multilevel ILU Preconditioner on Shared-Memory Computers

Authors:
Arnold Meijster;Fred Wubs
Affiliations:
-;-
Venue:
HPCN Europe 2000 Proceedings of the 8th International Conference on High-Performance Computing and Networking
Year:
2000

Citing 5
Cited 0

A simple parallel algorithm for the maximal independent set problem

SIAM Journal on Computing
A parallel graph coloring heuristic

SIAM Journal on Scientific Computing
ILUM: a multi-elimination ILU preconditioner for general sparse matrices

SIAM Journal on Scientific Computing
How fast the Laplace equation was solved in 1995

Applied Numerical Mathematics
Matrix Renumbering ILU: An Effective Algebraic Multilevel ILU Preconditioner for Sparse Matrices

SIAM Journal on Matrix Analysis and Applications

Quantified Score

Hi-index	0.00

Visualization

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.