2015
DOI: 10.1016/j.compfluid.2015.07.005
|View full text |Cite
|
Sign up to set email alerts
|

A fine-grained block ILU scheme on regular structures for GPGPUs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4

Citation Types

0
5
0

Year Published

2017
2017
2022
2022

Publication Types

Select...
5
1
1

Relationship

0
7

Authors

Journals

citations
Cited by 8 publications
(5 citation statements)
references
References 36 publications
0
5
0
Order By: Relevance
“…Thus, ρ(|D −1 L|) = ρ(D −1 L) = 0. By theorem 1, the chaotic relaxation (11) for this splitting converges.…”
mentioning
confidence: 81%
See 1 more Smart Citation
“…Thus, ρ(|D −1 L|) = ρ(D −1 L) = 0. By theorem 1, the chaotic relaxation (11) for this splitting converges.…”
mentioning
confidence: 81%
“…In this approach, an analysis phase computes (without necessarily reordering the unknowns) sets of rows that can be eliminated in parallel due to the sparsity of the matrix [9,10]. On structured grids with cells ordered by i, j, k, this approach gives rise to wavefront algorithms, where planes of cells having the same value of i + j + k are processed in parallel [11]. This method has the advantage of not adversely affecting the convergence rate while enabling reasonably good memory access patterns.…”
Section: Introductionmentioning
confidence: 99%
“…Note that there are some classical papers for ILU factorizations of block matrices; for examples Saad and Zhang (1999a, 1999b) and Axelsson et al (1989), and the parallelization of block ILU factorization is realized from either level-scheduling or multi-coloring algorithm on point-wise matrices in Chen et al (2018) and Yang and Liu (2015). Some other parallel block ILU schemes are studied in Luo et al (2015a), Luo et al (2015b), Kim and Yun (2000) and Yun (2000).…”
Section: Introductionmentioning
confidence: 99%
“…New algorithms are, nevertheless, trying to expose more parallelism and improve the performance of linear solvers on the GPU by accelerating the incomplete factorization and its use in the linear solver [Anzt et al, , 2016a. Reported speedups for implicit solvers are of one order of magnitude [Luo et al, 2015;Fu et al, 2014;Aissa et al, 2017].…”
Section: Introductionmentioning
confidence: 99%