A reliable block Lanczos algorithm over small finite fields

DOI10.1145/1073884.1073910MaRDI QIDQ5262760zbMATH OpenOpenAlexFDO

Authors Bradford Hovinen, Wayne Eberly

Publication date 16 July 2015

Published in Proceedings of the 2005 international symposium on Symbolic and algebraic computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1073884.1073910

zbMATH Keywords

black box matrixfinite fieldLanczos algorithmlinear system solutionparallel computingrandomized algorithm

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Randomized algorithms (68W20) Symbolic computation and algebraic computation (68W30)

Recommendations

• Reliable Krylov-based algorithms for matrix null space and rank
• Yet another block Lanczos algorithm: how to simplify the computation and reduce reliance on preconditioners in the small field case
• scientific article; zbMATH DE number 1676636
• scientific article; zbMATH DE number 1253981
• A block Wiedemann rank algorithm

Cited in

(7)

• \(\mathbb F _2 \) Lanczos revisited
• scientific article; zbMATH DE number 1676636 (Why is no real title available?)
• Yet another block Lanczos algorithm: how to simplify the computation and reduce reliance on preconditioners in the small field case
• scientific article; zbMATH DE number 4153897 (Why is no real title available?)
• Euclid’s algorithm and the Lanczos method over finite fields
• scientific article; zbMATH DE number 1253981 (Why is no real title available?)
• The Block Lanczos Algorithm

This page was built for publication: A reliable block Lanczos algorithm over small finite fields

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