An element-by-element preconditioned conjugate gradient method implemented on a vector computer
β Scribed by Jocelyne Erhel; Alice Traynard; Marina Vidrascu
- Publisher
- Elsevier Science
- Year
- 1991
- Tongue
- English
- Weight
- 444 KB
- Volume
- 17
- Category
- Article
- ISSN
- 0167-8191
No coin nor oath required. For personal study only.
β¦ Synopsis
We consider the linear equation Ax = b where A is a sparse symmetric positive definite matrix arising from a finite element discretisation. We use the preconditioned conjugate gradient method to solve this equation, introducing an element-by-element preconditioner which is based on a Crout's decomposition of the element matrices and an element-by-element product of them. When the mesh is coloured, this preconditioner is largely vectorizable. We implement this method on a CRAY-2, and test it on 2D and 3D elastic and thermal problems and compare it to other classical preconditioners.
π SIMILAR VOLUMES
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 sho
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