Name
Abstract | ||
|---|---|---|
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 probability, structure independent. We show, using block size slightly larger than r, that the leading r invariant factors are computed correctly with high probability over any field. Moreover, an algorithm is provided to compute the probability bound for a given matrix size and thus to select the block size needed to obtain the desired probability. The worst case probability bound is improved, post hoc, by incorporating the partial information about the invariant factors. |
Year | DOI | Venue |
|---|---|---|
2022 | 10.1016/j.jsc.2021.06.005 | Journal of Symbolic Computation |
Keywords | DocType | Volume |
Invariant factors,Minimum polynomial,Wiedemann's algorithm,Block blackbox algorithm,Probability analysis,Post hoc analysis | Journal | 108 |
ISSN | Citations | PageRank |
0747-7171 | 0 | 0.34 |
References | Authors | |
0 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Gavin Harrison | 1 | 0 | 0.34 |
| Jeremy R. Johnson | 2 | 0 | 0.34 |
| B. David Saunders | 3 | 0 | 0.34 |