par Magolu, Monga Made 
;Van Der Vorst, Henk H.A.
Référence Lecture notes in computer science, 1823, page (89-98)
Publication Publié, 2000
;Van Der Vorst, Henk H.A.Référence Lecture notes in computer science, 1823, page (89-98)
Publication Publié, 2000
Article révisé par les pairs
| Résumé : | A class of parallel incomplete factorization preconditionings for the solution of large linear systems is investigated. The approach may be regarded as a generalized domain decomposition method. Adjacent subdomains have to communicate during the setting up of the preconditioner, and during the application of the preconditioner. Overlap is not necessary to achieve high performance. Fill-in levels are considered in a global way. If necessary, the technique may be implemented as a global re-ordering of the unknowns. Experimental results are reported for two-dimensional problems. |
