par Beauwens, Robert 
Référence Numerical linear algebra with applications, 1, 1, page (3-17)
Publication Publié, 1994
Référence Numerical linear algebra with applications, 1, 1, page (3-17)
Publication Publié, 1994
Article révisé par les pairs
| Résumé : | Preconditioned iterative methods are widely used to solve linear systems such as those arising from the finite element formulation of boundary value problems and approximate factorizations are widely used as preconditioners. The ordering of the unknowns is therefore an important issue because it has a strong influence on the convergence behaviour of the iteration method while it is also a decisive aspect for their parallel implementation. Consistent orderings are attractive for parallel implementations and it has been shown that some subclasses of these orderings also enhance the convergence behaviour of the associated iteration methods. This has in particular been shown for the so‐called S/P consistent orderings. A wider definition of this class of orderings has recently been proposed and we investigate here how approximate factorizations should be implemented when using such more general orderings (still called S/P consistent) in order to keep their expected high convergence properties. A simple practical conclusion is suggested, supported by both theoretical and numerical arguments. Copyright © 1994 John Wiley & Sons, Ltd |
