Name
Abstract | ||
|---|---|---|
This paper considers the parallel solution of finite element equations using the preconditioned conjugate gradient method on shared memory multiprocessors. The preconditioner used is an incomplete LU factorization of the stiffness matrix. We have designed a new method for implementing parallel forward and backward substitutions which requires the L and U factors to have an independent column structure, which we refer to as I 2 LU . The algorithm has been implemented on an Encore Multimax and parallel efficiencies up to 80% of the maximum possible theoretical value have been obtained using around 6–8 processors. These figures are shown to be comparable with the efficiencies of an implementation of a similar row-oriented approach, based on level scheduling, tested with the same problems. |
Year | DOI | Venue |
|---|---|---|
1997 | 10.1016/S0167-8191(97)00026-4 | Parallel Computing |
Keywords | Field | DocType |
finite element method,shared memory multiprocessor,incomplete lu factorization,pcg method,new parallel ilu preconditioner,conjugate gradient method,independent column,finite element | Conjugate gradient method,Shared memory,Preconditioner,Incomplete Cholesky factorization,Computer science,Parallel computing,Finite element method,Incomplete LU factorization,Stiffness matrix,Conjugate residual method | Journal |
Volume | Issue | ISSN |
23 | 6 | Parallel Computing |
Citations | PageRank | References |
4 | 0.54 | 5 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| M. Pakzad | 1 | 4 | 0.54 |
| J. L. Lloyd | 2 | 4 | 0.88 |
| C. Phillips | 3 | 16 | 2.27 |