WIT Press


The Block Stride Reduction (B.S.R.) Algorithm With Application To Domain Decomposition Methods

Price

Free (open access)

Paper DOI

10.2495/HPC970011

Volume

18

Pages

10

Published

1997

Size

728 kb

Author(s)

D.J. Evans

Abstract

In this paper we consider the application of the Block Stride Reduction algorithm for the solution of separable self-adjoint elliptic equations on rectangular domains. Non-overlapping domain decomposition techniques are applied to reduce the differential operator to block diagonally bordered linear systems which can then be solved by the Preconditioned Conjugate Gradient method. Finally, a new preconditioner for such systems is outlined. 1 Introduction In the numerical solution of elliptic partial differential equations for certain cases, the structure of the coefficient matrix in the linear system, i.e. block tridiagonal, allows the use of methods of reduced complexity compared to

Keywords