Solving sparse linear equations over finite fields
IEEE Transactions on Information Theory
Interpolating polynomials from their values
Journal of Symbolic Computation - Special issue on computational algebraic complexity
Processor efficient parallel solution of linear systems over an abstract field
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Solving homogeneous linear equations over GF(2) via block Wiedemann algorithm
Mathematics of Computation
A Uniform Approach for the Fast Computation of Matrix-Type Pade Approximants
SIAM Journal on Matrix Analysis and Applications
Mathematics of Computation
ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
Fast Probabilistic Algorithms for Verification of Polynomial Identities
Journal of the ACM (JACM)
Processor efficient parallel solution of linear systems of equations
Journal of Algorithms
On Wiedemann's Method of Solving Sparse Linear Systems
AAECC-9 Proceedings of the 9th International Symposium, on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Probabilistic algorithms for sparse polynomials
EUROSAM '79 Proceedings of the International Symposiumon on Symbolic and Algebraic Computation
On the complexity of polynomial matrix computations
ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation
Black box linear algebra with the linbox library
Black box linear algebra with the linbox library
Modern Computer Algebra
Reliable Krylov-based algorithms for matrix null space and rank
ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
On the complexity of computing determinants
Computational Complexity
Solving sparse rational linear systems
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Efficient matrix rank computation with application to the study of strongly regular graphs
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
Parallel computation of the rank of large sparse matrices from algebraic K-theory
Proceedings of the 2007 international workshop on Parallel symbolic computation
Exact sparse matrix-vector multiplication on GPU's and multicore architectures
Proceedings of the 4th International Workshop on Parallel and Symbolic Computation
| Hi-index | 0.00 |
This paper makes two contributions to block Wiedemann algorithms. We describe how to compute the minimal generating matrix polynomial using Beckermann and Labahn's Fast Power Hermite-Padé Solver, and we develop a block Monte Carlo method to compute rank of a black box matrix over a large field by extending the Kaltofen-Saunders black box matrix rank algorithm.