### Abstract

This study develops an OpenMP scheme to parallel the preconditioned conjugate gradient methods (PCG) in shared memory computers. The proposed method is simple and systematic, so a minor change in traditional PCG methods may produce effective parallelism. At first, the global stiffness matrix is renumbered in order to produce a parallel three-line form matrix, and a subroutine only needs to be called once in the finite element analysis. Several basic OpenMP commands are then added into the traditional incomplete Cholesky factorization (ILU) and symmetric successive over-relaxation (SSOR) codes to make the procedures of matrix multiplication, decomposition, forward substitution, and backward substitution fully parallel.

Original language | English |
---|---|

Pages (from-to) | 91-108 |

Number of pages | 18 |

Journal | CMES - Computer Modeling in Engineering and Sciences |

Volume | 64 |

Issue number | 1 |

Publication status | Published - 2010 Oct 11 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Software
- Modelling and Simulation
- Computer Science Applications

### Cite this

}

*CMES - Computer Modeling in Engineering and Sciences*, vol. 64, no. 1, pp. 91-108.

**A simple OpenMP scheme for parallel iteration solvers in finite element analysis.** / Ju, S. H.

Research output: Contribution to journal › Article

TY - JOUR

T1 - A simple OpenMP scheme for parallel iteration solvers in finite element analysis

AU - Ju, S. H.

PY - 2010/10/11

Y1 - 2010/10/11

N2 - This study develops an OpenMP scheme to parallel the preconditioned conjugate gradient methods (PCG) in shared memory computers. The proposed method is simple and systematic, so a minor change in traditional PCG methods may produce effective parallelism. At first, the global stiffness matrix is renumbered in order to produce a parallel three-line form matrix, and a subroutine only needs to be called once in the finite element analysis. Several basic OpenMP commands are then added into the traditional incomplete Cholesky factorization (ILU) and symmetric successive over-relaxation (SSOR) codes to make the procedures of matrix multiplication, decomposition, forward substitution, and backward substitution fully parallel.

AB - This study develops an OpenMP scheme to parallel the preconditioned conjugate gradient methods (PCG) in shared memory computers. The proposed method is simple and systematic, so a minor change in traditional PCG methods may produce effective parallelism. At first, the global stiffness matrix is renumbered in order to produce a parallel three-line form matrix, and a subroutine only needs to be called once in the finite element analysis. Several basic OpenMP commands are then added into the traditional incomplete Cholesky factorization (ILU) and symmetric successive over-relaxation (SSOR) codes to make the procedures of matrix multiplication, decomposition, forward substitution, and backward substitution fully parallel.

UR - http://www.scopus.com/inward/record.url?scp=77957588977&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77957588977&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:77957588977

VL - 64

SP - 91

EP - 108

JO - CMES - Computer Modeling in Engineering and Sciences

JF - CMES - Computer Modeling in Engineering and Sciences

SN - 1526-1492

IS - 1

ER -