Preconditioning techniques based on a Parallel Hierarchical Interface Decomposition (PHIDAL). |
|
|
|
|
|
|
| In this talk we will present some recent work for computing a parallel incomplete LU factorizations in a hierarchical way. This method exploits Schur complements based on independent sets of "interfaces". The idea borrows from what is referred to in the domain decomposition literature as "wirebasket" preconditioners. The decomposition uses separators in a manner that is similar to the Algebraic Recursive Multilevel Solver (ARMS). In contrast with ARMS, the separators overlap by one level. Furthermore, these separators are decomposed in the graph sense, by using separators of another level by a procedure named "Hierchical Interface Decomposition". The goal of this decomposition is to obtain sets of equations that are not coupled. Drop tolerance strategies are defined so as to limit fill-in to locations where it does not hamper parallelism. A few numerical experiments will be presented. |
|
|
algweb@cerfacs.fr Last Update: Apr 16, 2003 |