An element-by-element preconditioned conjugate gradient method implemented on a vector computer
colouringcomparison of methodsCrout element-by-element preconditionerfinite elementincomplete Cholesky decompositionlarge sparse systemspreconditioned conjugate gradient methodvectorization
Boundary value problems for second-order elliptic equations (35J25) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Thermodynamics in solid mechanics (74A15) Finite element methods applied to problems in solid mechanics (74S05)
For large linear algebraic systems with a sparse symmetric positive definite coefficient matrix arising e.g. from the finite element discretization of elliptic boundary value problems the preconditioned conjugate gradient method is known as an efficient iterative solver. Among the various preconditioners, the Crout EBE (element-by-element) preconditioner is quite popular and has already been implemented in available finite element codes. It is further known that this preconditioner is highly vectorizable when using an appropriate colouring of the graph associated with the triangulation. For 2D and 3D elastic and thermal problems the authors compute the speed- up gained by vectorization (on a CRAY-2) and compare the performance of the EBE preconditioner with other standard preconditioners. It is not so surprising that EBE is much faster than diagonal preconditioning but inferior to the preconditioner based on incomplete Cholesky decomposition.
- The block preconditioned conjugate gradient method on vector computers
- scientific article; zbMATH DE number 3917546
- scientific article; zbMATH DE number 3903846
- scientific article; zbMATH DE number 708864
- scientific article; zbMATH DE number 4184921
- Vectorization of some block preconditioning conjugate gradient methods
- A parallel version of the preconditioned conjugate gradient method for boundary element equations
- On vectorizing the preconditioned generalized conjugate residual methods
- A general finite element preconditioning for the conjugate gradient method
- scientific article; zbMATH DE number 3844481
- Large-scale vectorized implicit calculations in solid mechanics on a Cray X-MP/48 utilizing EBE preconitioned conjugate gradients
- A GPU implementation of the PCG method for large-scale image-based finite element analysis in heterogeneous periodic media
- Element-by-element linear and nonlinear solution schemes
- scientific article; zbMATH DE number 4074338 (Why is no real title available?)
- scientific article; zbMATH DE number 4076783 (Why is no real title available?)
- On vectorizing the preconditioned generalized conjugate residual methods
- Vectorizable preconditioners for mixed finite element solution of second-order elliptic problems
- Comparison of lanczos and conjugate gradients for the element-by-element solution of finite element equations on the ibm 3090 vector computer
- scientific article; zbMATH DE number 1354047 (Why is no real title available?)
- scientific article; zbMATH DE number 708864 (Why is no real title available?)
- Pixel-based boundary element method for computing effective thermal conductivity of heterogeneous materials
- Isosurface-based marching cube algorithm for smooth geometric topology optimization within adaptive octree SBFE approach
- Conjugate gradient solution of finite element equations on the IBM 3090 vector computer utilizing polynomial preconditionings
- An analysis of some element-by-element techniques
This page was built for publication: An element-by-element preconditioned conjugate gradient method implemented on a vector computer
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1180617)
