Various iterative methods for solving the linear systems associated with finite element approximations to self-adjoint elliptic differential operators are compared based on their performance on serial and parallel machines. The methods studied are all preconditioned conjugate gradient methods, differing only in the choice of preconditioner. The preconditioners considered arise from diagonal scaling, incomplete Cholesky decomposition, hierarchical basis functions, and a Neumann-Dirichlet domain decomposition technique. The hierarchical basis function idea is shown to be especially effective on both serial and parallel architectures.
|Original language||English (US)|
|Number of pages||18|
|State||Published - Jun 1989|
All Science Journal Classification (ASJC) codes
- Computational Mathematics
- Applied Mathematics
- Subject Classifications: AMS(MOS): 65F10, CR: G1.8