Clément Pernet
Clément Pernet
This is a fix to #381 . As noted by @gilvillard the call to `LUdivine` on the Krylov matrix in the bootstrap phase of ArtihProgPrecond method was wrong, as it...
Although the architecture of fgemm is written with genericity in mind (wrt the base field), the management of delayed bounds in Strassen-Winograd's algorithm was somehow hardcoded there, which made this...
The random iterator for ModularExtended is a ModularRanditer which uses as a random source a GivRandom in `givrandom.h` based on a congruential generator modulo 2147483647 a 31 bit prime.
Although asymptotically more expensive (additional log n in space and time), it is expected to perform faster on small enough matrices. We need to experiment to determine whether it is...