![]() |
My Project
|
Interface to factorization and square free factorization algorithms. More...
#include "config.h"
#include "cf_assert.h"
#include "cf_defs.h"
#include "canonicalform.h"
#include "cf_iter.h"
#include "fac_sqrfree.h"
#include "cf_algorithm.h"
#include "facFqFactorize.h"
#include "facFqSquarefree.h"
#include "cf_map.h"
#include "facAlgExt.h"
#include "facFactorize.h"
#include "singext.h"
#include "cf_util.h"
#include "fac_berlekamp.h"
#include "fac_cantzass.h"
#include "fac_univar.h"
#include "fac_multivar.h"
#include "int_int.h"
#include "NTLconvert.h"
#include "factory/cf_gmp.h"
#include "FLINTconvert.h"
Go to the source code of this file.
Variables | |
VAR int | singular_homog_flag =1 |
Interface to factorization and square free factorization algorithms.
Used by: cf_irred.cc
Header file: cf_algorithm.h
Definition in file cf_factor.cc.
Definition at line 398 of file cf_factor.cc.
CFFList factorize | ( | const CanonicalForm & | f, |
bool | issqrfree | ||
) |
factorization over
Definition at line 409 of file cf_factor.cc.
CFFList factorize | ( | const CanonicalForm & | f, |
const Variable & | alpha | ||
) |
factorization over
Definition at line 778 of file cf_factor.cc.
void find_exp | ( | const CanonicalForm & | f, |
int * | exp_f | ||
) |
Definition at line 66 of file cf_factor.cc.
int find_mvar | ( | const CanonicalForm & | f | ) |
Definition at line 83 of file cf_factor.cc.
Variable get_max_degree_Variable | ( | const CanonicalForm & | f | ) |
get_max_degree_Variable returns Variable with highest degree.
We assume f is not a constant!
Definition at line 264 of file cf_factor.cc.
CFList get_Terms | ( | const CanonicalForm & | f | ) |
Definition at line 293 of file cf_factor.cc.
void getTerms | ( | const CanonicalForm & | f, |
const CanonicalForm & | t, | ||
CFList & | result | ||
) |
get_Terms: Split the polynomial in the containing terms.
getTerms: the real work is done here.
Definition at line 283 of file cf_factor.cc.
CanonicalForm homogenize | ( | const CanonicalForm & | f, |
const Variable & | x | ||
) |
homogenize homogenizes f with Variable x
Definition at line 317 of file cf_factor.cc.
CanonicalForm homogenize | ( | const CanonicalForm & | f, |
const Variable & | x, | ||
const Variable & | v1, | ||
const Variable & | v2 | ||
) |
Definition at line 357 of file cf_factor.cc.
bool isPurePoly | ( | const CanonicalForm & | f | ) |
Definition at line 248 of file cf_factor.cc.
bool isPurePoly_m | ( | const CanonicalForm & | f | ) |
Definition at line 238 of file cf_factor.cc.
cf_algorithm.cc - simple mathematical algorithms.
Hierarchy: mathematical algorithms on canonical forms
A "mathematical" algorithm is an algorithm which calculates some mathematical function in contrast to a "structural" algorithm which gives structural information on polynomials.
Compare these functions to the functions in ‘cf_ops.cc’, which are structural algorithms.
Definition at line 103 of file cf_factor.cc.
CFFList sqrFree | ( | const CanonicalForm & | f, |
bool | sort | ||
) |
squarefree factorization
Definition at line 961 of file cf_factor.cc.
void test_cff | ( | CFFList & | L, |
const CanonicalForm & | f | ||
) |
Definition at line 217 of file cf_factor.cc.
Definition at line 396 of file cf_factor.cc.