Probably correct row echelon form in the F4 algorithm
Alexander Demin
Abstract
The computation of row echelon form is one of the main bottlenecks in the F4 algorithm. Several state of the art implementations use a probabilistic algorithm attributed to Monagan, Pearce, and Steel to accelerate this computation. Despite this, no bound on the probability that the algorithm returns an incorrect result appears to be available. In this paper, we provide such a bound. Furthermore, building on this result, we propose a Las-Vegas variant of the F4 algorithm and show experimentally that it can outperform deterministic F4 on some classical examples.
Create a lesson
Related papers
Parallel Integration over Simple Radical Extensions II: Mixed Towers
Sam Blake
Certified local rank and uniqueness barriers for a 48-term matrix-multiplication decomposition
Abhinav Agarwal
Fast matrix multiplication via recursive 4x4x4:48 algorithms into practice
Jean-Guillaume Dumas, Clément Pernet, Alexandre Sedoglavic et al.
Diversity of EML-type operators
Andrzej Odrzywołek
Physical Law Ecology: mapping multi-mechanism ecologies as the zeroth step of data-driven scientific discovery
Xiongheng Bian, Xiangyu Cui, Ma Feng et al.
Maximal rank of 4× 4× 4 and k× 4× 3 tensors over F2
Jason Yang