Probabilistic analysis of Wiedemann's algorithm for minimal polynomial computation

DOI10.1016/j.jsc.2015.06.005zbMath1375.15022OpenAlexW2007196063MaRDI QIDQ898244

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

probabilityfinite fieldminimal polynomialmatrixblock blackbox algorithm

Mathematics Subject Classification ID

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

Related Items (2)

Quantum walks on generalized quadrangles ⋮ Probabilistic analysis of block Wiedemann for leading invariant factors

Uses Software

• FFLAS-FFPACK

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the similarity transformation between a matrix and its transpose
• Efficient matrix preconditioners for black box linear algebra
• On the matrix berlekamp-massey algorithm
• Solving sparse rational linear systems
• Black box Frobenius decompositions over small fields
• Solving sparse linear equations over finite fields
• Solving Homogeneous Linear Equations Over GF(2) via Block Wiedemann Algorithm
• Block solution of sparse linear systems over GF (q)
• Analysis of Coppersmith's Block Wiedemann Algorithm for the Parallel Solution of Sparse Linear Systems
• The Generalized Jordan Canonical Form

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