Probabilistic analysis of Wiedemann's algorithm for minimal polynomial computation

DOI10.1016/J.JSC.2015.06.005MaRDI QIDQ898244zbMATH OpenOpenAlexFDO

Authors N. E. Zubov

Publication date 8 December 2015

Published in Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jsc.2015.06.005

zbMATH Keywords

matrixminimal polynomialprobabilityfinite fieldblock blackbox algorithm

Mathematics Subject Classification ID

Numerical linear algebra (65F99) Polynomials in number theory (11C08) Canonical forms, reductions, classification (15A21)

Recommendations

• A block Wiedemann rank algorithm
• Black box linear algebra: extending Wiedemann's analysis of a sparse matrix preconditioner for computations over small fields
• Analysis of Coppersmith's Block Wiedemann Algorithm for the Parallel Solution of Sparse Linear Systems

Cites work

• scientific article; zbMATH DE number 177858 (Why is no real title available?)
• scientific article; zbMATH DE number 1253961 (Why is no real title available?)
• scientific article; zbMATH DE number 1460605 (Why is no real title available?)
• scientific article; zbMATH DE number 2151192 (Why is no real title available?)
• Analysis of Coppersmith's Block Wiedemann Algorithm for the Parallel Solution of Sparse Linear Systems
• Black box Frobenius decompositions over small fields
• Block solution of sparse linear systems over GF (q)
• Efficient matrix preconditioners for black box linear algebra
• On the matrix Berlekamp-Massey algorithm
• On the similarity transformation between a matrix and its transpose
• Solving Homogeneous Linear Equations Over GF(2) via Block Wiedemann Algorithm
• Solving sparse linear equations over finite fields
• Solving sparse rational linear systems
• The Generalized Jordan Canonical Form

Cited in

(5)

• An analysis of the WITT algorithm
• A block Wiedemann rank algorithm
• scientific article; zbMATH DE number 2151185 (Why is no real title available?)
• Quantum walks on generalized quadrangles
• Black box linear algebra: extending Wiedemann's analysis of a sparse matrix preconditioner for computations over small fields

Describes a project that uses

Uses Software

• FFLAS-FFPACK

This page was built for publication: Probabilistic analysis of Wiedemann's algorithm for minimal polynomial computation

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