2008
DOI: 10.1007/s00607-008-0002-y
|View full text |Cite
|
Sign up to set email alerts
|

An efficient algebraic multigrid preconditioner for a fast multipole boundary element method

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2009
2009
2023
2023

Publication Types

Select...
5
2

Relationship

1
6

Authors

Journals

citations
Cited by 10 publications
(3 citation statements)
references
References 29 publications
0
3
0
Order By: Relevance
“…The two-fold saddle point problem (4.29) is solved by a preconditioned Bramble-Pasciak CG method [1] for two-fold saddle point problems including the projection P , see [14] for details. The involved preconditioners are an algebraic multigrid preconditioner [22] for the local single layer potentials V i and the preconditioners (3.14) and (4.27) presented for the local Steklov-Poincaré operators S i and the all-floating Schur complement system. All boundary integral operators are realized by the fast multipole method [8,24].…”
Section: Projection Methods and Preconditioningmentioning
confidence: 99%
“…The two-fold saddle point problem (4.29) is solved by a preconditioned Bramble-Pasciak CG method [1] for two-fold saddle point problems including the projection P , see [14] for details. The involved preconditioners are an algebraic multigrid preconditioner [22] for the local single layer potentials V i and the preconditioners (3.14) and (4.27) presented for the local Steklov-Poincaré operators S i and the all-floating Schur complement system. All boundary integral operators are realized by the fast multipole method [8,24].…”
Section: Projection Methods and Preconditioningmentioning
confidence: 99%
“…An incomplete list of more sophisticated preconditioners, which vary in construction time and efficacy, include multilevel hierarchical preconditioners, additive or multiplicative Schwarz,() BPX, sparse approximate inverses,() approximate LU decompositions, clustering,() integral equations of opposite order, Calderon identities, and multigrid. () In the case of multigrid preconditioners, specialized smoothers must be developed since standard smoothers like Jacobi or Gauss‐Seidel will smooth the low, rather than the high, frequency components. Examples of such smoothers may require developing approximate inverses of the integral operator involving, for example, the Laplace‐Beltrami operator …”
Section: Introductionmentioning
confidence: 99%
“…While simple techniques such as block-diagonal preconditioners are easy to construct, they are not always capable of reducing the number of iterations significantly. An incomplete list of more sophisticated preconditioners, which vary in construction time and efficacy, include additive or multiplicative Schwarz [37,38], BPX [39], sparse approximate inverses [40,41], approximate LU decompositions [42], clustering [43,44], integral equations of opposite order [45], Calderon identities [36], or multigrid [46,47,48,49]. In the case of multigrid preconditioners, specialized smoothers must be developed since standard smoothers like Jacobi or Gauss-Seidel will smooth the low, rather than the high, frequency components.…”
Section: Introductionmentioning
confidence: 99%