include/lacunaryx/linear_factors_univariate.hpp File Reference
#include <algebramix/polynomial_integer.hpp>
#include <multimix/sparse_polynomial.hpp>
#include <multimix/multivariate.hpp>
#include <factorix/irreducible_polynomial_integer.hpp>
#include <factorix/irreducible_polynomial_rational.hpp>
Go to the source code of this file.
Namespaces
Defines
Functions
- template<typename C , typename V , typename M , typename W > void set_as_polynomial (polynomial< C, V > &p, const sparse_polynomial< C, M, W > &q)
- template<typename C , typename M , typename W > polynomial< C > as_polynomial (const sparse_polynomial< C, M, W > &q)
- template<typename C > nat multiplicity (const polynomial< C > &f, const polynomial< C > &p)
- template<typename C , typename E , typename V > sparse_polynomial< C, monomial
< vector< E > >, V > as_sparse_polynomial (const polynomial< rational > &q)
- template<typename C , typename E , typename V > irreducible_factor
< sparse_polynomial< C,
monomial< vector< E > >, V > > as_sparse_factor (const irreducible_factor< polynomial< rational > > &f)
- template<typename C , typename E , typename V > vector< irreducible_factor
< sparse_polynomial< C,
monomial< vector< E > >, V > > > intersect_factors (const vector< irreducible_factor< sparse_polynomial< C, monomial< vector< E > >, V > > > &f1, const vector< irreducible_factor< sparse_polynomial< C, monomial< vector< E > >, V > > > &f2)
- template<typename E , typename C , typename V > sparse_polynomial< C, monomial
< vector< E > >, V > sparse_derive (const sparse_polynomial< C, monomial< vector< E > >, V > &p)
- template<typename E , typename C , typename V > C gap_univariate (const sparse_polynomial< C, monomial< vector< E > >, V > &p)
- template<typename E , typename C , typename V > vector< sparse_polynomial< C,
monomial< vector< E > >, V > > partition_univariate (const sparse_polynomial< C, monomial< vector< E > >, V > &q, E g)
- template<typename C , typename E , typename V > nat multiplicity (const sparse_polynomial< C, monomial< vector< E > >, V > &f, const sparse_polynomial< C, monomial< vector< E > >, V > &p)
- template<typename E , typename C , typename V > vector< irreducible_factor
< sparse_polynomial< C,
monomial< vector< E > >, V > > > non_cyclotomic_factors (const sparse_polynomial< C, monomial< vector< E > >, V > &q, E gap)
- template<typename E , typename C , typename V > vector< irreducible_factor
< sparse_polynomial< C,
monomial< vector< E > >, V > > > cyclotomic_factors (const sparse_polynomial< C, monomial< vector< E > >, V > &p)
- template<typename E , typename C , typename V > pair< C, vector
< irreducible_factor
< sparse_polynomial< C,
monomial< vector< E > >, V > > > > gap_and_cyclotomic_factors (const sparse_polynomial< C, monomial< vector< E > >, V > &p)
- template<typename E , typename C , typename V > vector< irreducible_factor
< sparse_polynomial< C,
monomial< vector< E > >, V > > > linear_factors_univariate (const sparse_polynomial< C, monomial< vector< E > >, V > &q)
Define Documentation
| #define Monomial monomial< vector<E> > |
| #define Sparse_factor irreducible_factor<Sparse_polynomial> |
| #define Sparse_factors vector<Sparse_factor> |
| #define Sparse_polynomial sparse_polynomial<C, Monomial, V> |
| #define Univariate_factor irreducible_factor<polynomial <rational> > |
| #define Univariate_factors vector<Univariate_factor> |
| #define Univariate_polynomial polynomial<C> |
