FFPACK: finite field linear algebra package 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
Keywords for this software
References in zbMATH (referenced in 4 articles )
Showing results 1 to 4 of 4.
- Cheng, Howard; Labahn, George: A practical implementation of a modular algorithm for ore polynomial matrices (2014)
- Ballico, Edoardo; Brambilla, Maria Chiara; Caruso, Fabrizio; Sala, Massimiliano: Postulation of general quintuple fat point schemes in $\Bbb P^3$ (2012)
- Dumas, Jean-Guillaume; Fousse, Laurent; Salvy, Bruno: Simultaneous modular reduction and Kronecker substitution for small finite fields (2011)
- Dumas, Jean-Guillaume; Giorgi, Pascal; Pernet, Clément: FFPACK: finite field linear algebra package (2004)