Numerical experiments to optimize the use of (I)LU preconditioning in the iterative linear solver package LINSOL

In the iterative linear solver package LINSOL several generalized conjugate gradient (CG) methods (or, briefly, CG-type methods) with quite different properties are implemented. With these methods polyalgorithms with automatic method switching are constructed. The “emergency exit” that is taken in t...

Full description

Saved in:
Bibliographic Details
Published in:Applied numerical mathematics Vol. 41; no. 1; pp. 23 - 37
Main Authors: Schönauer, Willi, Häfner, Hartmut
Format: Journal Article Conference Proceeding
Language:English
Published: Amsterdam Elsevier B.V 01.04.2002
Elsevier
Subjects:
(I)LU preconditioning
Automatic method switching
Exact sciences and technology
FIDISOL
Generalized conjugate gradient (CG) methods
LINSOL
Mathematics
Polyalgorithms
Sciences and techniques of general use
Software
Sparse linear systems
Generalized conjugate gradient (CG) methods
LINSOL
(I)LU preconditioning
Software
Automatic method switching
FIDISOL
Polyalgorithms
Sparse linear systems
ISSN:0168-9274, 1873-5460
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In the iterative linear solver package LINSOL several generalized conjugate gradient (CG) methods (or, briefly, CG-type methods) with quite different properties are implemented. With these methods polyalgorithms with automatic method switching are constructed. The “emergency exit” that is taken in the worst case is the ATPRES method (which is very robust, but very slow). In this paper we investigate if (I)LU preconditioning were a better emergency exit and how the drop tolerance for small elements in ILU affects the convergence behavior. The answer will be: it depends.
ISSN:0168-9274
1873-5460
DOI:10.1016/S0168-9274(01)00108-8