1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
|
/*
Copyright 2014-2016 by
Laboratoire d'Informatique de Paris 6 - Équipe PEQUAN
Sorbonne Universités
UPMC Univ Paris 06
UMR 7606, LIP6
Boîte Courrier 169
4, place Jussieu
F-75252 Paris Cedex 05
France
Contributor Ch. Lauter
christoph.lauter@lip6.fr
This software is a computer program whose purpose is to provide an
environment for safe floating-point code development. It is
particularly targeted to the automated implementation of
mathematical floating-point libraries (libm). Amongst other features,
it offers a certified infinity norm, an automatic polynomial
implementer and a fast Remez algorithm.
This software is governed by the CeCILL-C license under French law and
abiding by the rules of distribution of free software. You can use,
modify and/ or redistribute the software under the terms of the CeCILL-C
license as circulated by CEA, CNRS and INRIA at the following URL
"http://www.cecill.info".
As a counterpart to the access to the source code and rights to copy,
modify and redistribute granted by the license, users are provided only
with a limited warranty and the software's author, the holder of the
economic rights, and the successive licensors have only limited
liability.
In this respect, the user's attention is drawn to the risks associated
with loading, using, modifying and/or developing or reproducing the
software by the user in light of its specific status of free software,
that may mean that it is complicated to manipulate, and that also
therefore means that it is reserved for developers and experienced
professionals having in-depth computer knowledge. Users are therefore
encouraged to load and test the software's suitability as regards their
requirements in conditions enabling the security of their systems and/or
data to be ensured and, more generally, to use and operate it in the
same conditions as regards security.
The fact that you are presently reading this means that you have had
knowledge of the CeCILL-C license and that you accept its terms.
This program is distributed WITHOUT ANY WARRANTY; without even the
implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
*/
#ifndef POLYNOMIALS_H
#define POLYNOMIALS_H
#include <stdint.h>
#include <gmp.h>
#include <mpfr.h>
#include <stdio.h>
#include "mpfi-compat.h"
/* An abstract type for polynomials */
typedef struct __polynomial_struct_t * polynomial_t;
/* Operations on polynomials */
/* Cache handling */
void polynomialInitializeCaches();
void polynomialFreeCaches();
/* Constructors */
polynomial_t polynomialFromMpfrConstant(mpfr_t);
polynomial_t polynomialFromMpzConstant(mpz_t);
polynomial_t polynomialFromMpqConstant(mpq_t);
polynomial_t polynomialFromIntConstant(int);
polynomial_t polynomialFromIdentity();
polynomial_t polynomialFromMpfrCoefficients(mpfr_t *, unsigned int);
int polynomialFromConstantExpressionCoefficients(polynomial_t *, struct nodeStruct **, unsigned int);
int polynomialFromExpression(polynomial_t *, struct nodeStruct *);
int polynomialFromExpressionOnlyRealCoeffs(polynomial_t *, struct nodeStruct *);
/* Copy-Constructor */
polynomial_t polynomialFromCopy(polynomial_t);
/* Destructor */
void polynomialFree(polynomial_t);
/* Comparisons */
int polynomialEqual(polynomial_t, polynomial_t, int);
int polynomialIsIdentity(polynomial_t, int);
int polynomialIsConstant(polynomial_t, int);
int polynomialStructurallyEqual(polynomial_t, polynomial_t, int);
/* Arithmetical operations */
polynomial_t polynomialAdd(polynomial_t, polynomial_t);
polynomial_t polynomialSub(polynomial_t, polynomial_t);
polynomial_t polynomialMul(polynomial_t, polynomial_t);
polynomial_t polynomialNeg(polynomial_t);
polynomial_t polynomialCompose(polynomial_t, polynomial_t);
void polynomialDiv(polynomial_t *, polynomial_t *, polynomial_t, polynomial_t);
int polynomialPow(polynomial_t *, polynomial_t, polynomial_t);
polynomial_t polynomialPowUnsignedInt(polynomial_t, unsigned int);
polynomial_t polynomialDeriv(polynomial_t);
/* Rewrite operations */
polynomial_t polynomialHornerize(polynomial_t);
polynomial_t polynomialCanonicalize(polynomial_t);
/* Tests for rewrite operations */
int polynomialIsHornerized(polynomial_t);
int polynomialIsCanonicalized(polynomial_t);
/* Accessors */
void polynomialGetDegree(mpz_t, polynomial_t);
int polynomialGetDegreeAsInt(polynomial_t);
struct nodeStruct *polynomialGetIthCoefficient(polynomial_t, mpz_t);
struct nodeStruct *polynomialGetIthCoefficientIntIndex(polynomial_t, int);
int polynomialGetCoefficients(struct nodeStruct ***, unsigned int *, polynomial_t);
struct nodeStruct *polynomialGetExpression(polynomial_t);
struct nodeStruct *polynomialGetExpressionExplicit(polynomial_t);
/* Displaying and conversion to strings */
void polynomialFPrintf(FILE *, polynomial_t);
char *polynomialToString(polynomial_t);
/* Evaluation */
void polynomialEvalMpfr(mpfr_t, polynomial_t, mpfr_t);
void polynomialEvalMpfi(sollya_mpfi_t, polynomial_t, sollya_mpfi_t);
/* Rounding of coefficients */
int polynomialCoefficientsAreDyadic(polynomial_t, int);
int polynomialCoefficientsAreRational(polynomial_t, int);
polynomial_t polynomialRoundDyadic(polynomial_t, mp_prec_t);
polynomial_t polynomialRoundRational(polynomial_t, mp_prec_t);
polynomial_t polynomialRound(polynomial_t, mp_prec_t);
/* A function to prevent memory reference loops */
int polynomialReferencesExpression(polynomial_t, struct nodeStruct *);
/* A hashing function */
uint64_t polynomialHash(polynomial_t);
#endif /* ifdef POLYNOMIALS_H*/
|
