#include <poly-smith-form.h>
|
| | PolySmithFormDomain (const Ring &R) |
| |
| | PolySmithFormDomain (const PolySmithFormDomain &D) |
| |
| template<class Matrix1> |
| void | local (std::vector< Polynomial > &result, const Matrix1 &M, const Polynomial &f, long multiplicity) const |
| |
| template<class Matrix1> |
| void | localRank (std::vector< Polynomial > &result, const Matrix1 &M, const Polynomial &f) const |
| |
| template<class Matrix1> |
| void | localFactored (std::vector< Polynomial > &result, const Matrix1 &M, const Polynomial &sf_factor, long multiplicity) const |
| |
| template<class Matrix1> |
| void | localFactoredRank (std::vector< Polynomial > &result, const Matrix1 &M, const Polynomial &sf_factor) const |
| |
| template<class Matrix1> |
| void | solve (std::vector< Polynomial > &result, const Matrix1 &M, const Polynomial &det, bool isDet=false) const |
| |
| template<class Iterator> |
| size_t | detLimit (const Iterator &begin, const Iterator &end) const |
| |
| template<class Matrix1> |
| size_t | detLimit (const Matrix1 &M) const |
| |
| template<class Matrix1> |
| void | detLocalX (Polynomial &det, const Matrix1 &M) const |
| |
| template<class Matrix1> |
| void | detPopov (Polynomial &det, const Matrix1 &M) const |
| |
| template<class Matrix1> |
| bool | dixon (Polynomial &minpoly, const Matrix1 &M, const Polynomial &f, size_t max_deg) const |
| |
| template<class Matrix1> |
| bool | dixon (Polynomial &mp, const Matrix1 &M) const |
| |
◆ Polynomial
◆ Coeff
| typedef Ring::Coeff Coeff |
◆ RandIter
◆ MatrixDom
◆ Matrix
◆ SubMatrix
◆ PolySmithFormDomain() [1/2]
◆ PolySmithFormDomain() [2/2]
◆ local()
template<class Matrix1>
| void local |
( |
std::vector< Polynomial > & | result, |
|
|
const Matrix1 & | M, |
|
|
const Polynomial & | f, |
|
|
long | multiplicity ) const |
|
inline |
◆ localRank()
template<class Matrix1>
| void localRank |
( |
std::vector< Polynomial > & | result, |
|
|
const Matrix1 & | M, |
|
|
const Polynomial & | f ) const |
|
inline |
◆ localFactored()
template<class Matrix1>
| void localFactored |
( |
std::vector< Polynomial > & | result, |
|
|
const Matrix1 & | M, |
|
|
const Polynomial & | sf_factor, |
|
|
long | multiplicity ) const |
|
inline |
◆ localFactoredRank()
template<class Matrix1>
| void localFactoredRank |
( |
std::vector< Polynomial > & | result, |
|
|
const Matrix1 & | M, |
|
|
const Polynomial & | sf_factor ) const |
|
inline |
◆ solve()
template<class Matrix1>
| void solve |
( |
std::vector< Polynomial > & | result, |
|
|
const Matrix1 & | M, |
|
|
const Polynomial & | det, |
|
|
bool | isDet = false ) const |
|
inline |
◆ detLimit() [1/2]
template<class Iterator>
| size_t detLimit |
( |
const Iterator & | begin, |
|
|
const Iterator & | end ) const |
|
inline |
◆ detLimit() [2/2]
template<class Matrix1>
| size_t detLimit |
( |
const Matrix1 & | M | ) |
const |
|
inline |
◆ detLocalX()
template<class Matrix1>
| void detLocalX |
( |
Polynomial & | det, |
|
|
const Matrix1 & | M ) const |
|
inline |
◆ detPopov()
template<class Matrix1>
| void detPopov |
( |
Polynomial & | det, |
|
|
const Matrix1 & | M ) const |
|
inline |
◆ dixon() [1/2]
◆ dixon() [2/2]
template<class Matrix1>
| bool dixon |
( |
Polynomial & | mp, |
|
|
const Matrix1 & | M ) const |
|
inline |
The documentation for this class was generated from the following file: