source: git/factory/cf_algorithm.h @ 1a9dc5

spielwiese
Last change on this file since 1a9dc5 was f78374, checked in by Martin Lee <martinlee84@…>, 12 years ago
chg: more changes of squarefree decomposition according to master
  • Property mode set to 100644
File size: 3.9 KB
Line 
1/* emacs edit mode for this file is -*- C++ -*- */
2/* $Id$ */
3
4#ifndef INCL_CF_ALGORITHM_H
5#define INCL_CF_ALGORITHM_H
6
7//{{{ docu
8//
9// cf_algorithm.h - declarations of higher level algorithms.
10//
11// Header file corresponds to: cf_algorithms.cc, cf_chinese.cc,
12//   cf_factor.cc, cf_linsys.cc, cf_resultant.cc
13//
14// Hierarchy: mathematical algorithms on canonical forms
15//
16// Developers note:
17// ----------------
18// This header file collects declarations of most of the
19// functions in Factory which implement higher level algorithms
20// on canonical forms (factorization, gcd, etc.) and declarations
21// of some low level mathematical functions, too (absolute value,
22// euclidean norm, etc.).
23//
24//}}}
25
26// #include "config.h"
27
28#include "canonicalform.h"
29#include "variable.h"
30
31/*BEGINPUBLIC*/
32
33//{{{ function declarations from cf_algorithm.cc
34CanonicalForm psr ( const CanonicalForm & f, const CanonicalForm & g, const Variable & x );
35
36CanonicalForm psq ( const CanonicalForm & f, const CanonicalForm & g, const Variable & x );
37
38void psqr ( const CanonicalForm & f, const CanonicalForm & g, CanonicalForm & q, CanonicalForm & r, const Variable & x );
39
40CanonicalForm bCommonDen ( const CanonicalForm & f );
41
42bool fdivides ( const CanonicalForm & f, const CanonicalForm & g );
43
44bool fdivides ( const CanonicalForm & f, const CanonicalForm & g, CanonicalForm& quot );
45
46bool tryFdivides ( const CanonicalForm & f, const CanonicalForm & g, const CanonicalForm& M, bool& fail );
47
48CanonicalForm maxNorm ( const CanonicalForm & f );
49
50CanonicalForm euclideanNorm ( const CanonicalForm & f );
51//}}}
52
53//{{{ function declarations from cf_chinese.cc
54void chineseRemainder ( const CanonicalForm & x1, const CanonicalForm & q1, const CanonicalForm & x2, const CanonicalForm & q2, CanonicalForm & xnew, CanonicalForm & qnew );
55
56void chineseRemainder ( const CFArray & x, const CFArray & q, CanonicalForm & xnew, CanonicalForm & qnew );
57
58CanonicalForm Farey ( const CanonicalForm & f, const CanonicalForm & q );
59//}}}
60
61//{{{ function declarations from cf_factor.cc
62extern int singular_homog_flag;
63
64bool isPurePoly(const CanonicalForm & f);
65
66bool isPurePoly_m(const CanonicalForm & f);
67
68CFFList factorize ( const CanonicalForm & f, bool issqrfree = false );
69
70CFFList factorize ( const CanonicalForm & f, const Variable & alpha );
71
72CFFList sqrFree ( const CanonicalForm & f, bool sort= false );
73
74bool isSqrFree ( const CanonicalForm & f );
75
76CanonicalForm homogenize( const CanonicalForm & f, const Variable & x);
77CanonicalForm homogenize( const CanonicalForm & f, const Variable & x,
78                                const Variable & v1, const Variable & v2);
79Variable get_max_degree_Variable(const CanonicalForm & f);
80CFList get_Terms( const CanonicalForm & f );
81void getTerms( const CanonicalForm & f, const CanonicalForm & t, CFList & result );
82
83
84//}}}
85
86//{{{ function declarations from cf_linsys.cc
87bool linearSystemSolve ( CFMatrix & M );
88
89CanonicalForm determinant ( const CFMatrix & M, int n );
90//}}}
91
92//{{{ function declarations from cf_resultant.cc
93CFArray subResChain ( const CanonicalForm & f, const CanonicalForm & g, const Variable & x );
94
95CanonicalForm resultant ( const CanonicalForm & f, const CanonicalForm & g, const Variable & x );
96//}}}
97
98//{{{ inline CanonicalForm abs ( const CanonicalForm & f )
99//{{{ docu
100//
101// abs() - return absolute value of `f'.
102//
103// The absolute value is defined in terms of the function
104// `sign()'.  If it reports negative sign for `f' than -`f' is
105// returned, otherwise `f'.
106//
107// This behaviour is most useful for integers and rationals.  But
108// it may be used to sign-normalize the leading coefficient of
109// arbitrary polynomials, too.
110//
111// Type info:
112// ----------
113// f: CurrentPP
114//
115//}}}
116inline CanonicalForm
117abs ( const CanonicalForm & f )
118{
119    // it is not only more general to use `sign()' instead of a
120    // direct comparison `f < 0', it is faster, too
121    if ( sign( f ) < 0 )
122        return -f;
123    else
124        return f;
125}
126//}}}
127
128/*ENDPUBLIC*/
129
130#endif /* ! INCL_CF_ALGORITHM_H */
Note: See TracBrowser for help on using the repository browser.