4 citations · 7 across the 3 of their papers we have counts for
5 papers
On Parametric Linear System Solving
Robert M. Corless, Mark Giesbrecht, Leili Rafiee Sevyeri +1
Parametric linear systems are linear systems of equations in which some symbolic parameters, that is, symbols that are not considered to be candidates for elimination or solution i…
Equivalences for Linearizations of Matrix Polynomials
Robert M. Corless, Leili Rafiee Sevyeri, B. David Saunders
One useful standard method to compute eigenvalues of matrix polynomials of degree at most in (denoted of grade , for sho…
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…
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…
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…