A parallel version of some block preconditionings

From MaRDI portal





A parallel algorithm for an implementation of block preconditioned conjugate gradient methods is developed. The approach is based on approximating tridiagonal solvers by incomplete block odd-even reduction. A stability analysis supports this decision. Using this construction, a significant parallel speed-up for block conjugate gradient methods with preconditioning is achieved. Three test problems related to a second order elliptic problem are solved in a parallel transputer-based computer environment.





Cited in
(22)








This page was built for publication: A parallel version of some block preconditionings

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