Online order basis algorithm and its impact on the block Wiedemann algorithm

Pascal Giorgi (1) , Romain Lebreton (1)

1 ECO - Exact Computing

Order bases are a fundamental tool for linear algebra with polynomial coefficients. In particular, block Wiedemann methods are nowadays able to tackle large sparse matrix problems because they benefit from fast order basis algorithms. However, such fast algorithms suffer from two practical drawbacks: they are not designed for early termination and often require more knowledge on the input than necessary. In this paper, we propose an online algorithm for order basis which allows for both early termination and minimal input requirement while keeping quasi-optimal complexity in the order. Using this algorithm inside block Wiedemann methods leads to an improvement of their practical performance by a constant factor.

Mots clés: Matrix polynomial; Online algorithm; Minimal basis

Domaines: Calcul formel [cs.SC]

Pascal Giorgi, Romain Lebreton. Online order basis algorithm and its impact on the block Wiedemann algorithm. ISSAC 204 - 39th International Symposium on Symbolic and Algebraic Computation, Jul 2014, Kobe, Japan. pp.202-209, ⟨10.1145/2608628.2608647⟩. ⟨lirmm-01232873⟩