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 metadatas

https://hal-lara.archives-ouvertes.fr/hal-02101818
Contributor : Colette Orange <>
Submitted on : Wednesday, April 17, 2019 - 9:07:06 AM
Last modification on : Monday, November 4, 2019 - 1:18:02 PM

File

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

Identifiers

  • HAL Id : hal-02101818, version 1

Collections

Citation

J.G. Dumas, P. Giorgi, C. 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

Record views

10

Files downloads

9