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

DOI10.1016/S0168-9274(01)00108-8zbMath0994.65037OpenAlexW1992884686WikidataQ127372821 ScholiaQ127372821MaRDI QIDQ1349129

Hartmut Häfner, Willi Schönauer

Publication date: 21 May 2002

Published in: Applied Numerical Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0168-9274(01)00108-8

zbMATH Keywords

sparse linear systemsconjugate gradient methodsILU preconditioningpolyalgorithmsFIDISOLATPRES methodautomatic method switchingiterative linear solver package LINSOL

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Packaged methods for numerical algorithms (65Y15)

Related Items

The integration of different variants of the (I)LU algorithm in the LINSOL program package

Uses Software

• FIDISOL
• LINSOL
• VECFEM
• FDEM

Cites Work

• Numerical experiments with two approximate inverse preconditioners
• An engineering approach to generalized conjugate gradient methods and beyond
• Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
• Numerical Linear Algebra for High-Performance Computers
• How we solve PDEs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item