@Article{cmes.2010.064.091,
AUTHOR = {S.H. Ju},
TITLE = {A Simple OpenMP Scheme for Parallel Iteration Solvers in Finite Element Analysis},
JOURNAL = {Computer Modeling in Engineering \& Sciences},
VOLUME = {64},
YEAR = {2010},
NUMBER = {1},
PAGES = {91--109},
URL = {http://www.techscience.com/CMES/v64n1/33326},
ISSN = {1526-1506},
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 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.},
DOI = {10.3970/cmes.2010.064.091}
}