Namespaces |
| namespace | FFPACK |
| | Finite Field PACK Set of elimination based routines for dense linear algebra.
|
Defines |
| #define | __FFLASFFPACK_ffpack_minpoly_INL |
Functions |
| template<class Field , class Polynomial > |
| Polynomial & | MinPoly (const Field &F, Polynomial &minP, const size_t N, const typename Field::Element *A, const size_t lda, typename Field::Element *X, const size_t ldx, size_t *P, const FFPACK::FFPACK_MINPOLY_TAG MinTag=FFPACK::FfpackDense, const size_t kg_mc=0, const size_t kg_mb=0, const size_t kg_j=0) |
| | Compute the minimal polynomial of (A,v) using an LUP factorization of the Krylov Base (v, Av, .., A^kv) U,X must be (n+1)*n U contains the Krylov matrix and X, its LSP factorization.
|