source: git/factory/cf_algorithm.h @ fbbb08

spielwiese
Last change on this file since fbbb08 was fbbb08, checked in by Hans Schoenemann <hannes@…>, 13 years ago
singular_homog_flag moved to factory git-svn-id: file:///usr/local/Singular/svn/trunk@13610 2c84dea3-7e68-4137-9b89-c4e89433aadc
  • Property mode set to 100644
File size: 3.7 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
44CanonicalForm maxNorm ( const CanonicalForm & f );
45
46CanonicalForm euclideanNorm ( const CanonicalForm & f );
47//}}}
48
49//{{{ function declarations from cf_chinese.cc
50void chineseRemainder ( const CanonicalForm & x1, const CanonicalForm & q1, const CanonicalForm & x2, const CanonicalForm & q2, CanonicalForm & xnew, CanonicalForm & qnew );
51
52void chineseRemainder ( const CFArray & x, const CFArray & q, CanonicalForm & xnew, CanonicalForm & qnew );
53
54CanonicalForm Farey ( const CanonicalForm & f, const CanonicalForm & q );
55//}}}
56
57//{{{ function declarations from cf_factor.cc
58extern int singular_homog_flag;
59
60bool isPurePoly(const CanonicalForm & f);
61
62bool isPurePoly_m(const CanonicalForm & f);
63
64CFFList factorize ( const CanonicalForm & f, bool issqrfree = false );
65
66CFFList factorize ( const CanonicalForm & f, const Variable & alpha );
67
68CFFList sqrFree ( const CanonicalForm & f );
69
70bool isSqrFree ( const CanonicalForm & f );
71
72CanonicalForm homogenize( const CanonicalForm & f, const Variable & x);
73CanonicalForm homogenize( const CanonicalForm & f, const Variable & x,
74                                const Variable & v1, const Variable & v2);
75Variable get_max_degree_Variable(const CanonicalForm & f);
76CFList get_Terms( const CanonicalForm & f );
77void getTerms( const CanonicalForm & f, const CanonicalForm & t, CFList & result );
78
79
80//}}}
81
82//{{{ function declarations from cf_linsys.cc
83bool linearSystemSolve ( CFMatrix & M );
84
85CanonicalForm determinant ( const CFMatrix & M, int n );
86//}}}
87
88//{{{ function declarations from cf_resultant.cc
89CFArray subResChain ( const CanonicalForm & f, const CanonicalForm & g, const Variable & x );
90
91CanonicalForm resultant ( const CanonicalForm & f, const CanonicalForm & g, const Variable & x );
92//}}}
93
94//{{{ inline CanonicalForm abs ( const CanonicalForm & f )
95//{{{ docu
96//
97// abs() - return absolute value of `f'.
98//
99// The absolute value is defined in terms of the function
100// `sign()'.  If it reports negative sign for `f' than -`f' is
101// returned, otherwise `f'.
102//
103// This behaviour is most useful for integers and rationals.  But
104// it may be used to sign-normalize the leading coefficient of
105// arbitrary polynomials, too.
106//
107// Type info:
108// ----------
109// f: CurrentPP
110//
111//}}}
112inline CanonicalForm
113abs ( const CanonicalForm & f )
114{
115    // it is not only more general to use `sign()' instead of a
116    // direct comparison `f < 0', it is faster, too
117    if ( sign( f ) < 0 )
118        return -f;
119    else
120        return f;
121}
122//}}}
123
124/*ENDPUBLIC*/
125
126#endif /* ! INCL_CF_ALGORITHM_H */
Note: See TracBrowser for help on using the repository browser.