In the article "Fast Parallel Computation of Characteristic Polynomial by Leverrier's Power Sum Method Adapted to Fields of Finite Characteristic" by Arnold Schonhage 1993, the author represets an algorithm for computing the characteristic polynomial of nxn matrix A over finite field from which the invertibility of A can be detected and the inverse of A can be calculated.
Is it the best parallel algorithm for matrix inversion over finite fields ?
Is there any refference where I can find this algorithm in more details and more explanations ?
Has anyone implemented this algorithm in some liberary or is there any open source implementation of it ?
Many Thanks !
http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.144.7602&rep=rep1&type=pdf
in theses "Computational Aspects of Discrete Logarithms" by Rob Lambert,
Lanczos-type finite termination methods are considered for the solution
of linear systems over finite fields. Maybe it may help.
- Badges
- Science topic
- Similar topics
- Computer Science
- Computing