1993
DOI: 10.1016/0955-7997(93)90004-5
|View full text |Cite
|
Sign up to set email alerts
|

Multi-level hierarchical preconditioners for boundary element systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
12
0

Year Published

1998
1998
2017
2017

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 17 publications
(12 citation statements)
references
References 12 publications
0
12
0
Order By: Relevance
“…In sparse systems, matvec products may consume more than 90% of the total CPU time spent by the solver, as in the case of the PCG with the main diagonal of the system taken for preconditioner. Even when more complex preconditioning techniques are employed, such as ILU factorization [2], polynomial [3], multi-level [4] or domain decomposition [5] techniques, the task of performing matvec products consumes a significant amount of the total CPU time. Therefore, the optimization of this kind of operation is of extreme importance.…”
Section: Introductionmentioning
confidence: 99%
“…In sparse systems, matvec products may consume more than 90% of the total CPU time spent by the solver, as in the case of the PCG with the main diagonal of the system taken for preconditioner. Even when more complex preconditioning techniques are employed, such as ILU factorization [2], polynomial [3], multi-level [4] or domain decomposition [5] techniques, the task of performing matvec products consumes a significant amount of the total CPU time. Therefore, the optimization of this kind of operation is of extreme importance.…”
Section: Introductionmentioning
confidence: 99%
“…The reasons for that is the exceptionally good convergence properties of their preconditioned versions. Important results for non-hermitian BE systems are reported by , Mansur, Araújo and Malaghini (1992), Barra et al (1993), Prasad et al (1994), and Valente and Pina (2001). In Saad and van der Vorst (2000), a complete review on iterative solvers is provided; more than 200 references are cited.…”
Section: General Aspectsmentioning
confidence: 99%
“…Some issues in the analysis of larger three-dimensional BEM systems through preconditioned GMRES were evidenced by Leung and Walker (1997), who also proposed a strategy to overcome some limitations and extend the applicability of the algorithm to systems with some thousands of unknowns. Barra et al (1993) proposed a strategy for the construction of preconditioners for GMRES solved BEM problems, while Wang et al (2005) investigated a class of preconditioners for fast multipole BEMs.…”
Section: Introductionmentioning
confidence: 99%