Probabilistic analysis of Wiedemann's algorithm for minimal polynomial computation

DOI10.1016/J.JSC.2015.06.005zbMATH Open1375.15022OpenAlexW2007196063MaRDI QIDQ898244FDOQ898244

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

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

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)

Cites Work

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

Cited In (5)

• An analysis of the WITT algorithm
• A block Wiedemann rank algorithm
• Title not available (Why is that?)
• Quantum walks on generalized quadrangles
• Black box linear algebra: extending Wiedemann's analysis of a sparse matrix preconditioner for computations over small fields

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)