Sparse matrix storage formats and acceleration of iterative solution of linear algebraic systems with dense matrices
DOI10.1007/S10958-013-1296-7zbMATH Open1271.65057OpenAlexW2013663562MaRDI QIDQ357310FDOQ357310
Authors: R. R. Akhunov, S. P. Kuksenko, V. K. Salov, T. R. Gazizov 
Publication date: 30 July 2013
Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10958-013-1296-7
Recommendations
Computational methods for sparse matrices (65F50) Preconditioners for iterative methods (65F08) Iterative numerical methods for linear systems (65F10)
Cites Work
Cited In (10)
- Estimating the effect of indices compression in the CSR-like data storage formats for matrix-vector multiplications and solving linear systems
- A new sparse-matrix storage method for adaptively solving large systems of reaction-diffusion-transport equations
- An efficient storage format for large sparse matrices
- Research on the storage method of large-scale sparse matrix in engineering calculation
- Performance evaluation of domain decomposition method with sparse matrix storage schemes in modern supercomputer
- Comparison between element, edge and compressed storage schemes for iterative solutions in finite element analyses
- LU-decomposition with iterative refinement for solving sparse linear systems
- Optimization of the ILU(0) factorization algorithm with the use of compressed sparse row format
- Effect of the storage format of sparse linear systems on parallel CFD computations
- An optimal storage format for sparse matrices
Uses Software
This page was built for publication: Sparse matrix storage formats and acceleration of iterative solution of linear algebraic systems with dense matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q357310)
