Domain decomposition methods for the parallel computation of reacting flows (Q1330639): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 12:46, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Domain decomposition methods for the parallel computation of reacting flows |
scientific article |
Statements
Domain decomposition methods for the parallel computation of reacting flows (English)
0 references
18 January 1995
0 references
We make comparisons between relaxation-based linear solvers and also preconditioned iterative methods of conjugate gradient and Chebyshev type, focusing attention on both iteration count and global inner product count. The generalized minimum residual method with block-ILU preconditioning is judged the best serial method among those considered, and parallel numerical experiments on the Encore Multimax demonstrate for it approximately ten-fold speedup on 16 processors.
0 references
relaxation-based linear solvers
0 references
preconditioned iterative methods
0 references
generalized minimum residual method
0 references
block-ILU preconditioning
0 references
Encore Multimax
0 references
