1990
DOI: 10.1016/0045-7825(90)90113-z
|View full text |Cite
|
Sign up to set email alerts
|

Conjugate gradient solution of finite element equations on the IBM 3090 vector computer utilizing polynomial preconditionings

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

1993
1993
2021
2021

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 11 publications
(1 citation statement)
references
References 14 publications
0
1
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%