Sparse Gaussian Elimination Modulo p: An Update
From MaRDI portal
Publication:2829994
Recommendations
- An Implementation of Gaussian Elimination with Partial Pivoting for Sparse Systems
- Parallel sparse Gaussian elimination with partial pivoting
- On the Complexity of Sparse Gaussian Elimination via Bordering
- Fraction free Gaussian elimination for sparse matrices
- Sparse Gaussian elimination with controlled fill-in on a shared memory multiprocessor
- On the complexity of sparse elimination
- Distributed Sparse Gaussian Elimination and Orthogonal Factorization
- Symbolic Factorization for Sparse Gaussian Elimination with Partial Pivoting
- Symbolic and Exact Structure Prediction for Sparse Gaussian Elimination with Partial Pivoting
- Compact formulae in sparse elimination (extended abstract)
Cites work
- scientific article; zbMATH DE number 1643927 (Why is no real title available?)
- scientific article; zbMATH DE number 503245 (Why is no real title available?)
- scientific article; zbMATH DE number 194668 (Why is no real title available?)
- scientific article; zbMATH DE number 5494051 (Why is no real title available?)
- A Supernodal Approach to Sparse Partial Pivoting
- A fully asynchronous multifrontal solver using distributed dynamic scheduling
- Algorithm 832
- Algorithm 907
- Direct Methods for Sparse Linear Systems
- Factorization of a 768-Bit RSA Modulus
- GBLA: Gröbner basis linear algebra package
- Large matrix, small rank
- Matrices with two nonzero entries per row
- Solving Homogeneous Linear Equations Over GF(2) via Block Wiedemann Algorithm
- Solving sparse linear equations over finite fields
- Some Design Features of a Sparse Matrix Code
- Sparse Partial Pivoting in Time Proportional to Arithmetic Operations
- The Magma algebra system. I: The user language
- The Multifrontal Solution of Indefinite Sparse Symmetric Linear
- The elimination form of the inverse and its application to linear programming
Cited in
(7)- Fraction free Gaussian elimination for sparse matrices
- Reduction of Huge, Sparse Matrices over Finite Fields Via Created Catastrophes
- Flexible constrained sampling with guarantees for pattern mining
- An algebraic attack on rank metric code-based cryptosystems
- A new sparse Gaussian elimination algorithm and the Niederreiter linear system for trinomials over \(\mathbb F_2\)
- On the complexity of matrix reduction over finite fields
- Combinatorial Aspects in Sparse Elimination Methods
Describes a project that uses
Uses Software
This page was built for publication: Sparse Gaussian Elimination Modulo p: An Update
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2829994)
