𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Independent columns: A new parallel ILU preconditioner for the PCG method

✍ Scribed by M. Pakzad; J.L. Lloyd; C. Phillips


Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
818 KB
Volume
23
Category
Article
ISSN
0167-8191

No coin nor oath required. For personal study only.

✦ Synopsis


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 independenr column struchm, which we refer to as I'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.


πŸ“œ SIMILAR VOLUMES


A new method for the preparation of poly
✍ Thomas C. Shen; Mei-Ling Wang πŸ“‚ Article πŸ“… 1995 πŸ› John Wiley and Sons 🌐 English βš– 451 KB πŸ‘ 1 views

## Abstract A new method to prepare polymeric PLOT columns by using __in situ__ polymerization technology is described. The method involves a straightforward __in situ__ polymerization of the monomer. The polymer produced is directly coated on the metal tubing. This eliminates many of the steps nee

A New Parallel Solver for the Nonperiodi
✍ M. Garbey; D. Tromeur-Dervout πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 270 KB

We present a specific use of domain decomposition and decomposition in function space combined with asymptotic analytical qualitative results to obtain, on parallel computers, efficient and accurate solvers [3] for rapidly varying quasi-planar unsteady combustion fronts in liquids. In particular, we