Sparse Gaussian Elimination Modulo p: An Update

DOI10.1007/978-3-319-45641-6_8zbMath1453.65086OpenAlexW2471791783MaRDI QIDQ2829994

Claire Delaplace, Charles Bouillaguet

Publication date: 9 November 2016

Published in: Computer Algebra in Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-45641-6_8

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50)

Related Items (2)

Flexible constrained sampling with guarantees for pattern mining ⋮ An algebraic attack on rank metric code-based cryptosystems

Uses Software

• Magma
• SageMath
• SuperLU
• UMFPACK
• MUMPS
• CHOLMOD
• KLU
• CADO-NFS
• GBLA
• CSparse

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Fully Asynchronous Multifrontal Solver Using Distributed Dynamic Scheduling
• The Magma algebra system. I: The user language
• The Elimination form of the Inverse and its Application to Linear Programming
• Matrices with Two Nonzero Entries per Row
• Large matrix, small rank
• GBLA
• Algorithm 907
• Direct Methods for Sparse Linear Systems
• Factorization of a 768-Bit RSA Modulus
• The Multifrontal Solution of Indefinite Sparse Symmetric Linear
• Solving sparse linear equations over finite fields
• Sparse Partial Pivoting in Time Proportional to Arithmetic Operations
• Some Design Features of a Sparse Matrix Code
• A Supernodal Approach to Sparse Partial Pivoting
• Solving Homogeneous Linear Equations Over GF(2) via Block Wiedemann Algorithm
• Algorithm 832

This page was built for publication: Sparse Gaussian Elimination Modulo p: An Update