Use of Iterative Refinement in the Solution of Sparse Linear Systems
From MaRDI portal
Publication:3945481
DOI10.1137/0719024zbMATH Open0485.65022OpenAlexW2089495050MaRDI QIDQ3945481FDOQ3945481
Authors: Zahari Zlatev 
Publication date: 1982
Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0719024
Direct numerical methods for linear systems and matrix inversion (65F05) Iterative numerical methods for linear systems (65F10)
Cited In (16)
- An improved algorithm for the iterative refinement method
- A survey of the advances in the exploitation of the sparsity in the solution of large problems
- Mixed precision algorithms in numerical linear algebra
- Iterative solution of linear systems in the 20th century
- Accelerating the Solution of Linear Systems by Iterative Refinement in Three Precisions
- Efficient implementation of stable Richardson extrapolation algorithms
- LU-decomposition with iterative refinement for solving sparse linear systems
- Performance of adaptive dual-dropping ILUT preconditioners in semiconductor dopant diffusion simulation
- A locally optimized reordering algorithm and its application to a parallel sparse linear system solver
- Comparison of two pivotal strategies in sparse plane rotations
- Implementation of sparse matrix algorithms in an advection-diffusion-chemistry module
- Preconditioning techniques for nonsymmetric and indefinite linear systems
- Applying approximate LU-factorizations as preconditioners in eight iterative methods for solving systems of linear algebraic equations
- General scheme for solving linear algebraic problems by direct methods
- Exploiting the sparsity in the solution of linear ordinary differential equations
- Towards a cost-effective ILU preconditioner with high level fill
This page was built for publication: Use of Iterative Refinement in the Solution of Sparse Linear Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3945481)
