2002
DOI: 10.1016/s0168-9274(01)00110-6
|View full text |Cite
|
Sign up to set email alerts
|

Sparse approximate inverse smoothers for geometric and algebraic multigrid

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
20
0

Year Published

2002
2002
2024
2024

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 41 publications
(22 citation statements)
references
References 22 publications
1
20
0
Order By: Relevance
“…Also, incomplete factorization preconditioners have been shown to provide good smoothers for multigrid (see, e.g., [290]). Recent studies [69,70,270] have shown that sparse approximate inverses can also provide effective and robust smoothers for both geometric and algebraic multigrid, especially for tough problems (see also [19,29,30,234] for early work in this direction). Conversely, the ever-increasing size of the linear systems arising in countless applications has exposed the limitations of nonscalable methods (such as incomplete factorization and sparse approximate inverse preconditioners), and it is now generally agreed that the multilevel paradigm must somehow be incorporated into these techniques in order for these to remain competitive.…”
Section: Algebraic Multilevel Variantsmentioning
confidence: 99%
“…Also, incomplete factorization preconditioners have been shown to provide good smoothers for multigrid (see, e.g., [290]). Recent studies [69,70,270] have shown that sparse approximate inverses can also provide effective and robust smoothers for both geometric and algebraic multigrid, especially for tough problems (see also [19,29,30,234] for early work in this direction). Conversely, the ever-increasing size of the linear systems arising in countless applications has exposed the limitations of nonscalable methods (such as incomplete factorization and sparse approximate inverse preconditioners), and it is now generally agreed that the multilevel paradigm must somehow be incorporated into these techniques in order for these to remain competitive.…”
Section: Algebraic Multilevel Variantsmentioning
confidence: 99%
“…Some additional theoretical results are given in [23], including for a diagonal approximate inverse smoother, which may be preferable over damped Jacobi. Experimental results in the algebraic multigrid context are given in [22]. Although none of these studies used parallel implementations, parallel implementations of sparse approximate inverses are available [27].…”
Section: Polynomial Smoothingmentioning
confidence: 99%
“…We remark that similar approaches are used in the field of sparse approximate inverse smoothers, cf. Bröker and Grote in [3]. The construction of interpolation in FAMG is based on the minimization of…”
Section: Norm Minimization and Filter Conditionmentioning
confidence: 99%