Prospects
Improve Wiedemann on distributed architectures :
Blackbox algorithms with multiple, q, right-hand sides (Lanczos) :
- fewer iterations
- More parallelism, lower communication cost
- Higher computation cost (4 q2 n + M(n,q) instead of 4 n + M(n) per iteration)
- Interest on denser matrices, O(n log(n) ) elements at least
-
More extensive comparisons between elimination and iterative methods ?automatic algorithm choice
Open problem : Memory-efficient iterative method for ranks modulo powers of primes