![]() |
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 "int_int.h"#include "NTLconvert.h"#include <factory/cf_gmp.h>#include "FLINTconvert.h"Go to the source code of this file.
Variables | |
| 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 379 of file cf_factor.cc.
| CFFList factorize | ( | const CanonicalForm & | f, |
| bool | issqrfree | ||
| ) |
factorization over
or
Definition at line 390 of file cf_factor.cc.
| CFFList factorize | ( | const CanonicalForm & | f, |
| const Variable & | alpha | ||
| ) |
factorization over
or
Definition at line 617 of file cf_factor.cc.
| void find_exp | ( | const CanonicalForm & | f, |
| int * | exp_f | ||
| ) |
Definition at line 53 of file cf_factor.cc.
| int find_mvar | ( | const CanonicalForm & | f | ) |
Definition at line 70 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 245 of file cf_factor.cc.
| CFList get_Terms | ( | const CanonicalForm & | f | ) |
Definition at line 274 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 264 of file cf_factor.cc.
| CanonicalForm homogenize | ( | const CanonicalForm & | f, |
| const Variable & | x | ||
| ) |
homogenize homogenizes f with Variable x
Definition at line 298 of file cf_factor.cc.
| CanonicalForm homogenize | ( | const CanonicalForm & | f, |
| const Variable & | x, | ||
| const Variable & | v1, | ||
| const Variable & | v2 | ||
| ) |
Definition at line 338 of file cf_factor.cc.
| bool isPurePoly | ( | const CanonicalForm & | f | ) |
Definition at line 229 of file cf_factor.cc.
| bool isPurePoly_m | ( | const CanonicalForm & | f | ) |
Definition at line 219 of file cf_factor.cc.
| void out_cf | ( | const char * | s1, |
| const CanonicalForm & | f, | ||
| const char * | s2 | ||
| ) |
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 90 of file cf_factor.cc.
| void out_cff | ( | CFFList & | L | ) |
Definition at line 187 of file cf_factor.cc.
| CFFList sqrFree | ( | const CanonicalForm & | f, |
| bool | sort | ||
| ) |
squarefree factorization
Definition at line 757 of file cf_factor.cc.
| void test_cff | ( | CFFList & | L, |
| const CanonicalForm & | f | ||
| ) |
Definition at line 198 of file cf_factor.cc.
| int singular_homog_flag =1 |
Definition at line 377 of file cf_factor.cc.