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 re-numbered 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.
Ju, S. (2010). A simple openmp scheme for parallel iteration solvers in finite element analysis. Computer Modeling in Engineering & Sciences, 64(1), 91-109. https://doi.org/10.3970/cmes.2010.064.091
Vancouver Style
Ju S. A simple openmp scheme for parallel iteration solvers in finite element analysis. Comput Model Eng Sci. 2010;64(1):91-109 https://doi.org/10.3970/cmes.2010.064.091
IEEE Style
S. Ju, "A Simple OpenMP Scheme for Parallel Iteration Solvers in Finite Element Analysis," Comput. Model. Eng. Sci., vol. 64, no. 1, pp. 91-109. 2010. https://doi.org/10.3970/cmes.2010.064.091
This work is licensed under a Creative Commons Attribution 4.0 International License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.