A block Wiedemann rank algorithm
William J. Turner · 2006
This paper makes two contributions to block Wiedemann algorithms. We describe how to compute the minimal generating matrix polynomial using Beckermann and Labahn's Fast Power Hermite-Padé Solver, and we develop a block Monte Carlo method to compute rank of a black box matrix over a large field by extending the Kaltofen-Saunders black box matrix rank algorithm.