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
- {{#invoke:WikidataIB|getLink|Q2739444}} scientific article; zbMATH DE number 1643927 (Why is no real title available?)
- {{#invoke:WikidataIB|getLink|Q4279567}} scientific article; zbMATH DE number 503245 (Why is no real title available?)
- {{#invoke:WikidataIB|getLink|Q4692656}} scientific article; zbMATH DE number 194668 (Why is no real title available?)
- {{#invoke:WikidataIB|getLink|Q5301682}} scientific article; zbMATH DE number 5494051 (Why is no real title available?)
- {{#invoke:WikidataIB|getLink|Q4243526}} A Supernodal Approach to Sparse Partial Pivoting
- {{#invoke:WikidataIB|getLink|Q71526}} A fully asynchronous multifrontal solver using distributed dynamic scheduling
- {{#invoke:WikidataIB|getLink|Q5461192}} Algorithm 832
- {{#invoke:WikidataIB|getLink|Q2989122}} Algorithm 907
- {{#invoke:WikidataIB|getLink|Q3432847}} Direct Methods for Sparse Linear Systems
- {{#invoke:WikidataIB|getLink|Q3582763}} Factorization of a 768-Bit RSA Modulus
- {{#invoke:WikidataIB|getLink|Q2985820}} GBLA: Gröbner basis linear algebra package
- {{#invoke:WikidataIB|getLink|Q2883835}} Large matrix, small rank
- {{#invoke:WikidataIB|getLink|Q2819775}} Matrices with two nonzero entries per row
- {{#invoke:WikidataIB|getLink|Q4286604}} Solving Homogeneous Linear Equations Over GF(2) via Block Wiedemann Algorithm
- {{#invoke:WikidataIB|getLink|Q3746790}} Solving sparse linear equations over finite fields
- {{#invoke:WikidataIB|getLink|Q4185736}} Some Design Features of a Sparse Matrix Code
- {{#invoke:WikidataIB|getLink|Q3804073}} Sparse Partial Pivoting in Time Proportional to Arithmetic Operations
- {{#invoke:WikidataIB|getLink|Q1369784}} The Magma algebra system. I: The user language
- {{#invoke:WikidataIB|getLink|Q3662515}} The Multifrontal Solution of Indefinite Sparse Symmetric Linear
- {{#invoke:WikidataIB|getLink|Q2778583}} The elimination form of the inverse and its application to linear programming
Cited in
(7)- Reduction of Huge, Sparse Matrices over Finite Fields Via Created Catastrophes
- Fraction free Gaussian elimination for sparse matrices
- A new sparse Gaussian elimination algorithm and the Niederreiter linear system for trinomials over \(\mathbb F_2\)
- An algebraic attack on rank metric code-based cryptosystems
- On the complexity of matrix reduction over finite fields
- Flexible constrained sampling with guarantees for pattern mining
- 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)
