Showing cs.SCShow all
2 papers · 1 filter
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.SC2009
On finding multiplicities of characteristic polynomial factors of black-box matrices
Jean-Guillaume Dumas, Clément Pernet, B. David Saunders
We present algorithms and heuristics to compute the characteristic polynomial of a matrix given its minimal polynomial. The matrix is represented as a black-box, i.e., by a functio…