Numerical experiments to optimize the use of (I)LU preconditioning in the iterative linear solver package LINSOL
DOI10.1016/S0168-9274(01)00108-8zbMATH Open0994.65037OpenAlexW1992884686WikidataQ127372821 ScholiaQ127372821MaRDI QIDQ1349129FDOQ1349129
Hartmut Haefner, 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
Recommendations
conjugate gradient methodssparse linear systemsILU preconditioningpolyalgorithmsFIDISOLATPRES methodautomatic method switchingiterative linear solver package LINSOL
Computational methods for sparse matrices (65F50) Packaged methods for numerical algorithms (65Y15) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Parallel iterative methods for sparse linear systems
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Numerical Linear Algebra for High-Performance Computers
- How we solve PDEs
- Numerical experiments with two approximate inverse preconditioners
- Title not available (Why is that?)
- An engineering approach to generalized conjugate gradient methods and beyond
- Development of a black-box solver for nonlinear systems of elliptic and parabolic PDE's
Cited In (1)
Uses Software
This page was built for publication: Numerical experiments to optimize the use of (I)LU preconditioning in the iterative linear solver package LINSOL
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1349129)