Cache Optimized Solution for Sparse Linear System over Large Order Finite Field
From MaRDI portal
Publication:5114989
Recommendations
- scientific article; zbMATH DE number 503245
- Distributed matrix-free solution of large sparse linear systems over finite fields
- Solving sparse linear systems of equations over finite fields using bit-flipping algorithm
- Cache-Oblivious Sparse Matrix–Vector Multiplication by Using Sparse Matrix Partitioning Methods
- Fast and Efficient Parallel Solution of Sparse Linear Systems
- Cache friendly sparse matrix-vector multiplication
- Cache oblivious sparse matrix multiplication
- Solving sparse linear equations over finite fields
- Solving large dense systems of linear equations on systems with virtual memory and with cache
- Complexity transitions in global algorithms for sparse linear systems over finite fields
Cites work
- scientific article; zbMATH DE number 3956969 (Why is no real title available?)
- scientific article; zbMATH DE number 3635458 (Why is no real title available?)
- scientific article; zbMATH DE number 503245 (Why is no real title available?)
- Algebraic coding theory
- Efficient approximate solution of sparse linear systems
- Fast and efficient parallel solution of dense linear systems
- Iterative solutions to matrix equations of the form \(A_{i}XB_{i}=F_{i}\)
- Krylov Subspace Methods on Supercomputers
- Solving sparse linear equations over finite fields
- Templates for the Solution of Algebraic Eigenvalue Problems
This page was built for publication: Cache Optimized Solution for Sparse Linear System over Large Order Finite Field
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5114989)