Skip to Main content Skip to Navigation
Reports

FFPACK: Finite field linear algebra package

Abstract : The FFLAS project has established that exact matrix multiplication over finite fields can be performed at the speed of the highly optimized numerical BLAS routines. Since many algorithms have been reduced to use matrix multiplication in order to be able to prove an optimal theoretical complexity, this paper shows that those optimal complexity algorithms, such as LSP factorization, rank determinant and inverse computation can also be the most efficient.
Document type :
Reports
Complete list of metadata

https://hal-lara.archives-ouvertes.fr/hal-02101818
Contributor : Colette Orange Connect in order to contact the contributor
Submitted on : Wednesday, April 17, 2019 - 9:07:06 AM
Last modification on : Wednesday, November 24, 2021 - 11:32:02 AM

File

RR2004-02.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02101818, version 1

Collections

Citation

Jean-Guillaume Dumas, Pascal Giorgi, Clément Pernet. FFPACK: Finite field linear algebra package. [Research Report] LIP RR-2004-2, Laboratoire de l'informatique du parallélisme. 2004, 2+17p. ⟨hal-02101818⟩

Share

Metrics

Les métriques sont temporairement indisponibles