Domain decomposition methods for the parallel computation of reacting flows

From MaRDI portal
(Redirected from Publication:1330639)





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.











This page was built for publication: Domain decomposition methods for the parallel computation of reacting flows

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1330639)