A block Wiedemann rank algorithm

DOI10.1145/1145768.1145822MaRDI QIDQ2959008zbMATH OpenOpenAlexFDO

Authors William J. Turner

Publication date 3 February 2017

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

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

zbMATH Keywords

black box linear algebrablock Wiedemann methodpower Hermite-Padé approximationrank algorithm

Mathematics Subject Classification ID

Padé approximation (41A21) Monte Carlo methods (65C05) Numerical interpolation (65D05) Computational methods for sparse matrices (65F50)

Recommendations

• Subquadratic computation of vector generating polynomials and improvement of the block Wiedemann algorithm
• Probabilistic analysis of Wiedemann's algorithm for minimal polynomial computation
• Matrix rank certification
• Fast computation of linear generators for matrix sequences and application to the block Wiedemann algorithm
• Reliable Krylov-based algorithms for matrix null space and rank

Cited in

(7)

• On the computation of the rank of block bidiagonal Toeplitz matrices
• Online order basis algorithm and its impact on the block Wiedemann algorithm
• scientific article; zbMATH DE number 1254299 (Why is no real title available?)
• Matrix rank certification
• A reliable block Lanczos algorithm over small finite fields
• Subquadratic computation of vector generating polynomials and improvement of the block Wiedemann algorithm
• Probabilistic analysis of Wiedemann's algorithm for minimal polynomial computation

This page was built for publication: A block Wiedemann rank algorithm

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