- Motivated by a connection with block iterative methods for solving linear systems over finite fields, we consider the probability that the Krylov space generated by a fixed linear mapping and a random set of elements in a vector space over a finite field equals the space itself. We obtain an exact formula for this probability and from it we derive good lower bounds that approach 1 exponentially fast as the size of the set increases.
- Publisher copy:
- Copyright date:
Random Krylov spaces over finite fields
If you are the owner of this record, you can report an update to it here: Report update to this record