Probabilistic analysis of block Wiedemann for leading invariant factors
From MaRDI portal
Publication:2048159
DOI10.1016/j.jsc.2021.06.005zbMath1478.15050arXiv1803.03864OpenAlexW3182187069MaRDI QIDQ2048159
Publication date: 5 August 2021
Published in: Journal of Symbolic Computation, ACM Communications in Computer Algebra (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1803.03864
Analysis of algorithms (68W40) Geometric probability and stochastic geometry (60D05) Determinants, permanents, traces, other special matrix functions (15A15) Matrices over special rings (quaternions, finite fields, etc.) (15B33) Random matrices (algebraic aspects) (15B52) Diagonalization, Jordan forms (15A20)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the similarity transformation between a matrix and its transpose
- Probabilistic analysis of Wiedemann's algorithm for minimal polynomial computation
- Efficient matrix preconditioners for black box linear algebra
- On the complexity of computing determinants
- Probabilistic analysis of block Wiedemann for leading invariant factors
- On the matrix berlekamp-massey algorithm
- Solving sparse linear equations over finite fields
- Solving Homogeneous Linear Equations Over GF(2) via Block Wiedemann Algorithm
- Random Krylov Spaces over Finite Fields
