Fast computation of linear generators for matrix sequences and application to the block Wiedemann algorithm
From MaRDI portal
Publication:2958952
DOI10.1145/384101.384145zbMath1356.68296OpenAlexW2068627304MaRDI QIDQ2958952
Publication date: 3 February 2017
Published in: Proceedings of the 2001 international symposium on Symbolic and algebraic computation (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/inria-00517999/file/fastbw.pdf
Computational methods for sparse matrices (65F50) Analysis of algorithms (68W40) Symbolic computation and algebraic computation (68W30) Matrices over special rings (quaternions, finite fields, etc.) (15B33) Matrices of integers (15B36)
Related Items (3)
Polynomial evaluation and interpolation on special sets of points ⋮ Subquadratic computation of vector generating polynomials and improvement of the block Wiedemann algorithm ⋮ GPU acceleration of dense matrix and block operations for Lanczos method for systems over \(\mathrm{GF}(2)\)
This page was built for publication: Fast computation of linear generators for matrix sequences and application to the block Wiedemann algorithm
