On the complexity of matrix reduction over finite fields
Copyright policy )On the complexity of matrix reduction over finite fields
The authors study the complexity of matrix elimination over finite fields in terms of row operations.They present an algorithm called ``striped matrix elimination'' which is asymptotically faster than traditional Gauss-Jordan elimination. They present results of a large computational study of complexities for small matrices and fields.Finally they give a conjecture on the behaviour of a natural analogue of GLn for semifields and prove this for a certain class of semifields
- Umeå University Sweden
Matrix reduction, algorithm, Matrices over special rings (quaternions, finite fields, etc.), Applied Mathematics, Complexity, Direct numerical methods for linear systems and matrix inversion, Semifields, Complexity and performance of numerical algorithms, Finite fields, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), semifields, Gauss-Jordan elimination
Matrix reduction, algorithm, Matrices over special rings (quaternions, finite fields, etc.), Applied Mathematics, Complexity, Direct numerical methods for linear systems and matrix inversion, Semifields, Complexity and performance of numerical algorithms, Finite fields, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), semifields, Gauss-Jordan elimination
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).18 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Top 10% influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!