Use of Iterative Refinement in the Solution of Sparse Linear Systems
From MaRDI portal
Publication:3945481
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
- 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
- Comparison of two pivotal strategies in sparse plane rotations
- A locally optimized reordering algorithm and its application to a parallel sparse linear system solver
- Implementation of sparse matrix algorithms in an advection-diffusion-chemistry module
- Applying approximate LU-factorizations as preconditioners in eight iterative methods for solving systems of linear algebraic equations
- Preconditioning techniques for nonsymmetric and indefinite linear systems
- Accelerating the solution of linear systems by iterative refinement in three precisions
- 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)
