An Approximate Probabilistic Model for Structured Gaussian Elimination

DOI10.1006/JAGM.1999.1008MaRDI QIDQ4242656zbMATH OpenOpenAlexFDO

Authors Edward A. Bender, E. Rodney Canfield

Publication date 6 October 1999

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jagm.1999.1008

zbMATH Keywords

structured Gaussian elimination

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Recommendations

• scientific article; zbMATH DE number 503245
• Sparse Gaussian Elimination Modulo p: An Update
• Symbolic Factorization for Sparse Gaussian Elimination with Partial Pivoting
• Probabilistic analysis of complex Gaussian elimination without pivoting

Cited in

(4)

• \(\mathbb F _2 \) Lanczos revisited
• We are on the same side. Alternative sieving strategies for the number field sieve
• Triangulating meet-in-the-middle attack
• Fast matrix decomposition in F₂

This page was built for publication: An Approximate Probabilistic Model for Structured Gaussian Elimination

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4242656)