1999
DOI: 10.1137/s106482759732753x
|View full text |Cite
|
Sign up to set email alerts
|

BILUM: Block Versions of Multielimination and Multilevel ILU Preconditioner for General Sparse Linear Systems

Abstract: We introduce block versions of the multielimination incomplete LU (ILUM) factorization preconditioning technique for solving general sparse unstructured linear systems. These preconditioners have a multilevel structure and, for certain types of problems, may exhibit properties that are typically enjoyed by multigrid methods. Several heuristic strategies for forming blocks of independent sets are introduced and their relative merits are discussed. The advantages of block ILUM over point ILUM include increased r… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

2
81
0
1

Year Published

1999
1999
2015
2015

Publication Types

Select...
6
2
1

Relationship

3
6

Authors

Journals

citations
Cited by 84 publications
(84 citation statements)
references
References 42 publications
2
81
0
1
Order By: Relevance
“…Additional fill-in usually reduces the amount of parallelism in ILU(m) compared to ILU(0), but there are a number of techniques designed to retain it, such as the level-scheduling techniques [15,11] or the multi-coloring algorithms for the ILU factorization with levels based on the power(q)-pattern method [9]. Another workaround is given by the idea of multi-elimination [14,16], which is based on successive independent set coloring [6]. The motivation is that in a step of the Gaussian elimination, there usually exists a large set of rows that can be processed in parallel.…”
Section: Self-adaptive Multi-elimination Preconditionermentioning
confidence: 99%
“…Additional fill-in usually reduces the amount of parallelism in ILU(m) compared to ILU(0), but there are a number of techniques designed to retain it, such as the level-scheduling techniques [15,11] or the multi-coloring algorithms for the ILU factorization with levels based on the power(q)-pattern method [9]. Another workaround is given by the idea of multi-elimination [14,16], which is based on successive independent set coloring [6]. The motivation is that in a step of the Gaussian elimination, there usually exists a large set of rows that can be processed in parallel.…”
Section: Self-adaptive Multi-elimination Preconditionermentioning
confidence: 99%
“…In [3], a multilevel block ILU-factorization was proposed, inspired by BILUM [4]. At level k, A k is approximately factored as…”
Section: An Ebe-ilu Preconditionermentioning
confidence: 99%
“…The elements in this set should form a block independent set [4]. That is, there should be no edge between any two elements in the set of diagonal elements.…”
Section: An Ebe-ilu Preconditionermentioning
confidence: 99%
“…For instance the classical ilu preconditioner is not suitable for parallel architectures. Block versions of ilu, like ilum [9], bilum [12] and amli [1], have a much better data flow for parallel architectures.…”
Section: Introductionmentioning
confidence: 99%