In this paper we study the complexity of matrix elimination over finite fields in terms of row operations, or equivalently in terms of the distance in the the Cayley graph of GLn(Fq) generated by the elementary matrices. We present an algorithm called striped matrix elimination which is asymptotically faster than traditional Gauss–Jordan elimination. The new algorithm achieves a complexity of O n2 / lo
We present a method of computing with matrices over very small finite fields of size larger than 2. ...
We consider the problem of computing the rank of an m × nmatrix A over a field. We present a randomi...
We improve the current best running time value to invert sparse matrices over finite fields, lowerin...
International audienceThis paper considers elimination algorithms for sparse matrices over finite fi...
This paper surveys some of the recent research on the applications of the algebraic and combinatoria...
(eng) The FFLAS project has established that exact matrix multiplication over finite fields can be p...
International audienceThe FFLAS project has established that exact matrix multiplication over finite...
AbstractWe present a new algorithm for constructing the elimination tree for the Cholesky factor of ...
In this work we describe an efficient implementation of a hierarchy of algorithms for Gaussian elimi...
We consider linear problems in fields, ordered fields, discretely valued fields (with finite residue...
Parallel Gaussian elimination technique for the solution of a system of equations Ax C where A is a ...
International audienceWe want to achieve efficient exact computations, such as the rank, of sparse m...
In this contribution, we present a formalization of the well-known Gauss-Jordan algorithm. It states...
When applying Gaussian elimination to a sparse matrix, it is desirable to avoid turning zeros into n...
Transforming a matrix over a field to echelon form, or decomposing the ma-trix as a product of struc...
We present a method of computing with matrices over very small finite fields of size larger than 2. ...
We consider the problem of computing the rank of an m × nmatrix A over a field. We present a randomi...
We improve the current best running time value to invert sparse matrices over finite fields, lowerin...
International audienceThis paper considers elimination algorithms for sparse matrices over finite fi...
This paper surveys some of the recent research on the applications of the algebraic and combinatoria...
(eng) The FFLAS project has established that exact matrix multiplication over finite fields can be p...
International audienceThe FFLAS project has established that exact matrix multiplication over finite...
AbstractWe present a new algorithm for constructing the elimination tree for the Cholesky factor of ...
In this work we describe an efficient implementation of a hierarchy of algorithms for Gaussian elimi...
We consider linear problems in fields, ordered fields, discretely valued fields (with finite residue...
Parallel Gaussian elimination technique for the solution of a system of equations Ax C where A is a ...
International audienceWe want to achieve efficient exact computations, such as the rank, of sparse m...
In this contribution, we present a formalization of the well-known Gauss-Jordan algorithm. It states...
When applying Gaussian elimination to a sparse matrix, it is desirable to avoid turning zeros into n...
Transforming a matrix over a field to echelon form, or decomposing the ma-trix as a product of struc...
We present a method of computing with matrices over very small finite fields of size larger than 2. ...
We consider the problem of computing the rank of an m × nmatrix A over a field. We present a randomi...
We improve the current best running time value to invert sparse matrices over finite fields, lowerin...
DOI
Add to ORKG