A reliable block Lanczos algorithm over small finite fields

DOI10.1145/1073884.1073910zbMATH Open1328.11118OpenAlexW2006388893MaRDI QIDQ5262760FDOQ5262760

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

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

zbMATH Keywords

randomized algorithmparallel computingfinite fieldLanczos algorithmlinear system solutionblack box matrix

Mathematics Subject Classification ID

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

Cited In (3)

• \(\mathbb F _2 \) Lanczos revisited
• Title not available (Why is that?)
• Title not available (Why is that?)

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)