Orderings for incomplete factorization preconditioning of nonsymmetric problems

Numerical experiments are presented whereby the effect of reorderings on the convergence of preconditioned Krylov subspace methods for the solution of nonsymmetric linear systems is shown. The preconditioners used in this study are different variants of incomplete factorizations. It is shown that ce...

Full description

Saved in:
Bibliographic Details
Published in:SIAM journal on scientific computing 1999, Vol.20 (5), p.1652-1670
Main Authors: BENZI, M, SZYLD, D. B, VAN DUIN, A
Format: Article
Language:English
Subjects:
Algebra
Exact sciences and technology
Experiments
Iterative methods
Laboratories
Linear and multilinear algebra, matrix theory
Mathematics
Numerical analysis
Numerical analysis. Scientific computation
Numerical linear algebra
Partial differential equations, boundary value problems
Sciences and techniques of general use
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Numerical experiments are presented whereby the effect of reorderings on the convergence of preconditioned Krylov subspace methods for the solution of nonsymmetric linear systems is shown. The preconditioners used in this study are different variants of incomplete factorizations. It is shown that certain reorderings for direct methods, such as reverse Cuthill--McKee, can be very beneficial. The benefit can be seen in the reduction of the number of iterations and also in measuring the deviation of the preconditioned operator from the identity.
ISSN:1064-8275
1095-7197
DOI:10.1137/S1064827597326845