|
| const Field & | field () const |
| |
| | SigmaBasis (const Field &F, std::vector< Coefficient > &PowerSerie) |
| |
| void | right_basis (std::vector< Coefficient > &SigmaBase, size_t degree, std::vector< size_t > &defect) |
| |
| void | left_basis (std::vector< Coefficient > &SigmaBase, size_t degree, std::vector< size_t > &defect) |
| |
| void | multi_left_basis (std::vector< Coefficient > &SigmaBase1, size_t degree1, std::vector< size_t > &defect1, std::vector< Coefficient > &SigmaBase2, size_t degree2, std::vector< size_t > &defect2) |
| |
| void | multi_right_basis (std::vector< Coefficient > &SigmaBase1, size_t degree1, std::vector< size_t > &defect1, std::vector< Coefficient > &SigmaBase2, size_t degree2, std::vector< size_t > &defect2) |
| |
| void | left_PadeMatrix (std::vector< Coefficient > &Approx, size_t degree, std::vector< size_t > &defect) |
| |
| void | right_PadeMatrix (std::vector< Coefficient > &Approx, size_t degree, std::vector< size_t > &defect) |
| |
| void | multi_left_PadeMatrix (std::vector< Coefficient > &Approx1, size_t degree1, std::vector< Coefficient > &Approx2, size_t degree2, std::vector< size_t > &defect) |
| |
| void | multi_right_PadeMatrix (std::vector< Coefficient > &Approx1, size_t degree1, std::vector< Coefficient > &Approx2, size_t degree2, std::vector< size_t > &defect) |
| |
| template<class Polynomial1, class Polynomial2> |
| void | PM_Basis (Polynomial1 &SigmaBase, const Polynomial2 &PowerSerie, size_t degree, std::vector< size_t > &defect) |
| |
| void | print_multime () |
| |
| template<class Polynomial1, class Polynomial2> |
| void | M_Basis (Polynomial1 &SigmaBase, Polynomial2 &PowerSerie, size_t length, std::vector< size_t > &defect) |
| |
| template<class Polynomial1, class Polynomial2, class Polynomial3> |
| void | ComputeNewSerie (Polynomial1 &NewSerie, const Polynomial2 &SigmaBase, const Polynomial3 &OldSerie, size_t, size_t) |
| |
| void | ComputeNewSerieClassic (std::vector< Coefficient > &NewSerie, const std::vector< Coefficient > &SigmaBase, const std::vector< Coefficient > &OldSerie, size_t degree1, size_t degree2) |
| |
| void | MulSigmaBasis (std::vector< Coefficient > &C, std::vector< Coefficient > &A, std::vector< Coefficient > &B) |
| |
| void | PadeApproximant (std::vector< Coefficient > &Approx, const std::vector< Coefficient > &PowerSerie, size_t length, std::vector< size_t > &defect) |
| |
| void | MultiPadeApproximant (std::vector< Coefficient > &Approx1, size_t degree1, std::vector< Coefficient > &Approx2, size_t degree2, const std::vector< Coefficient > &PowerSerie, std::vector< size_t > &defect) |
| |
| void | new_M_Basis (std::vector< Coefficient > &SigmaBase, std::vector< Coefficient > &PowerSerie, size_t length, std::vector< size_t > &defect) |
| |
| void | new_PM_Basis (std::vector< Coefficient > &SigmaBase, std::vector< Coefficient > &PowerSerie, size_t degree, std::vector< size_t > &defect) |
| |
| void | UpdateSerie (std::vector< Coefficient > &NewSerie, std::vector< Coefficient > &SigmaBase, const std::vector< Coefficient > &OldSerie, size_t degree1, size_t degree2) |
| |
| void | write_maple (const char *name, const Coefficient &C) |
| |
| void | write_maple (const char *name, const std::vector< Coefficient > &P) |
| |
template<class _Field>
class LinBox::SigmaBasis< _Field >
implementation of \(\sigma\)-basis (minimal basis).
- Bibliography
- P. Giorgi, C.P. Jeannerod and G. Villard. On the complexity of polynomial matrix computations. ISSAC'03 doi.