Orderings for incomplete factorization preconditioning of nonsymmetric problems

Journal Article · Sat May 01 00:00:00 EDT 1999 · SIAM Journal on Scientific Computing

DOI:https://doi.org/10.1137/S1064827597326845· OSTI ID:687493

Benzi, M ^[1]; Szyld, D B ^[2]; Van Duin, A ^[3]

---

1. Los Alamos National Lab., NM (United States). Scientific Computing Group
2. Temple Univ., Philadelphia, PA (United States). Dept. of Mathematics
3. Leiden Univ. (Netherlands). Dept. of Computer Science

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.

• Sponsoring Organization: USDOE, Washington, DC (United States); National Science Foundation, Washington, DC (United States)
• DOE Contract Number: W-7405-ENG-36
• OSTI ID: 687493
• Journal Information: SIAM Journal on Scientific Computing, Vol. 20, Issue 5; Other Information: PBD: May 1999
• Country of Publication: United States
• Language: English

Related Subjects

99 MATHEMATICS
COMPUTERS
INFORMATION SCIENCE
MANAGEMENT
LAW
MISCELLANEOUS
MATRICES
ITERATIVE METHODS
FACTORIZATION
CONVERGENCE
SYMMETRY
EQUATIONS