A parallel version of the preconditioned conjugate gradient method for boundary element equations
โ Scribed by Matthias Pester; Sergej Rjasanow
- Publisher
- John Wiley and Sons
- Year
- 1995
- Tongue
- English
- Weight
- 699 KB
- Volume
- 2
- Category
- Article
- ISSN
- 1070-5325
No coin nor oath required. For personal study only.
โฆ Synopsis
The parallel version of precondition techniques is developed for matrices arising from the Galerkin boundary element method for two-dimensional domains with Dirichlet boundary conditions. Results were obtained for implementations on a transputer network as well as on an nCUBE-2 parallel computer showing that iterative solution methods are very well suited for a MIMD computer. A comparison of numerical results for iterative and direct solution methods is presented and underlines the superiority of iterative methods for large systems.
๐ SIMILAR VOLUMES
The Preconditioned Conjugate Gradient algorithms (PCG) are used for solving the matrix equations arising from the Finite Element Method (FEM) with high-order element functions. A vectorizable and a non-vectorizable block preconditioner for use with the conjugate gradient method is presented. The alg
Parallel preconditioners are considered for improving the convergence rate of the conjugate gradient method for solving sparse symmetric positive definite systems generated by finite element models of subsurface flow. The difficulties of adapting effective sequential preconditioners to the parallel
Discretization of boundary integral equations leads, in general, to fully populated complex valued non-Hermitian systems of equations. In this paper we consider the e cient solution of these boundary element systems by preconditioned iterative methods of Krylov subspace type. We devise preconditione