3 citations · 3 across the 1 of their papers we have counts for
2 papers
cs.SC2018
Probabilistic Analysis of Block Wiedemann for Leading Invariant Factors
Gavin Harrison, Jeremy Johnson, B. David Saunders
We determine the probability, structure dependent, that the block Wiedemann algorithm correctly computes leading invariant factors. This leads to a tight lower bound for the probab…
cs.SC2014★ 3 cited
Probabilistic analysis of Wiedemann's algorithm for minimal polynomial computation
Gavin Harrison, Jeremy Johnson, B. David Saunders
Blackbox algorithms for linear algebra problems start with projection of the sequence of powers of a matrix to a sequence of vectors (Lanczos), a sequence of scalars (Wiedemann) or…