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
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
|
/* Test file for mpfr_agm.
Copyright 1999, 2001, 2002 Free Software Foundation, Inc.
This file is part of the MPFR Library.
The MPFR Library is free software; you can redistribute it and/or modify
it under the terms of the GNU Lesser General Public License as published by
the Free Software Foundation; either version 2.1 of the License, or (at your
option) any later version.
The MPFR Library is distributed in the hope that it will be useful, but
WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public
License for more details.
You should have received a copy of the GNU Lesser General Public License
along with the MPFR Library; see the file COPYING. If not, write to
the Free Software Foundation, Inc., 59 Temple Place - Suite 330, Boston,
MA 02111-1307, USA. */
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include "gmp.h"
#include "mpfr.h"
#include "mpfr-test.h"
double drand_agm _PROTO((void));
double dagm _PROTO((double, double));
void check4 _PROTO((double, double, mp_rnd_t, double));
void check_large _PROTO((void));
void slave _PROTO((int, int));
double
drand_agm (void)
{
double d; long int *i;
i = (long int*) &d;
do {
i[0] = LONG_RAND();
i[1] = LONG_RAND();
} while ((d<1e-153)||(d>1e153)); /* to avoid underflow or overflow
in double calculus in sqrt(u*v) */
return d;
}
double
dagm (double a, double b)
{
double u, v, tmpu, tmpv;
if ((isnan(a))||(isnan(b)))
return a+b;
tmpv=MAX(a,b);
tmpu=MIN(a,b);
do
{
u=tmpu;
v=tmpv;
tmpu=sqrt(u*v);
tmpv=(u+v)/2.0;
}
while (!(((tmpu==u)&&(tmpv==v))||(ulp(u,v)==0)));
/* printf("difference : %i ulp\n",ulp(u,v)); */
return u;
}
#define check(a,b,r) check4(a,b,r,0.0)
void
check4 (double a, double b, mp_rnd_t rnd_mode, double res1)
{
mpfr_t ta, tb, tres;
double res2;
int ck=0;
mpfr_init2(ta, 53);
mpfr_init2(tb, 53);
mpfr_init2(tres, 53);
mpfr_set_d(ta, a, rnd_mode);
mpfr_set_d(tb, b, rnd_mode);
mpfr_agm(tres, ta, tb, rnd_mode);
#ifdef MPFR_HAVE_FESETROUND
mpfr_set_machine_rnd_mode(rnd_mode);
#endif
if (res1==0.0) res1=dagm(a,b); else ck=1;
if (ck==0) printf("%1.20e\n", res1);
res2 = mpfr_get_d1 (tres);
if (ck && res1!=res2 && (!isnan(res1) || !isnan(res2))) {
printf("mpfr_agm failed for a=%1.20e, b=%1.20e, rnd_mode=%d\n",a,b,rnd_mode);
printf("expected result is %1.20e, got %1.20e (%d ulp)\n",res1,res2,
ulp(res2,res1));
/*exit(1);*/
}
mpfr_clear(ta); mpfr_clear(tb); mpfr_clear(tres);
}
void
check_large (void)
{
mpfr_t a, b, agm;
mpfr_init2(a, 82); mpfr_init2(b, 82); mpfr_init2(agm, 82);
mpfr_set_ui(a, 1, GMP_RNDN);
mpfr_set_str_raw(b, "0.1111101100001000000001011000110111101000001011111000100001000101010100011111110010E-39");
mpfr_agm(agm, a, b, GMP_RNDN);
mpfr_set_str_raw(a, "0.1110001000111101101010101010101101001010001001001011100101111011110101111001111100E-4");
if (mpfr_cmp(agm, a)) {
fprintf(stderr, "mpfr_agm failed for precision 82\n"); exit(1);
}
mpfr_clear(a); mpfr_clear(b); mpfr_clear(agm);
}
void
slave (int N, int p)
{
int i;
double a,b;
mpfr_t ta, tb, tres;
mpfr_init2(ta, 53);
mpfr_init2(tb, 53);
mpfr_init2(tres, p);
for(i=0;i<N;i++) {
a = drand_agm();
b = drand_agm();
mpfr_set_d(ta, a, GMP_RNDN);
mpfr_set_d(tb, b, GMP_RNDN);
mpfr_agm(tres, ta, tb, LONG_RAND() % 4 );
}
mpfr_clear(ta); mpfr_clear(ta); mpfr_clear(tres);
printf("fin\n");
}
int
main (int argc, char* argv[])
{
int N;
SEED_RAND (time(NULL));
if (argc==3) { /* tagm N p : N calculus with precision p*/
printf("Doing %d random tests in %d precision\n",atoi(argv[1]),atoi(argv[2]));
slave(atoi(argv[1]),atoi(argv[2]));
return 0;
}
if (argc==2) { /* tagm N: N tests with random double's */
int i;
double a,b;
N = atoi(argv[1]);
for (i=0;i<N;i++) {
a = drand();
b = drand();
check(a, b, LONG_RAND() % 4);
}
return 0;
}
else {
check_large();
check4(2.0, 1.0, GMP_RNDN, 1.45679103104690677029);
check4(6.0, 4.0, GMP_RNDN, 4.94936087247260925182);
check4(62.0, 61.0, GMP_RNDN, 6.14989837188450749750e+01);
check4(0.5, 1.0, GMP_RNDN, 7.28395515523453385143e-01);
check4(1.0, 2.0, GMP_RNDN, 1.45679103104690677029);
check4(234375765.0, 234375000.0, GMP_RNDN, 2.3437538249984395504e8);
check4(8.0, 1.0, GMP_RNDU, 3.615756177597362786);
check4(1.0, 44.0, GMP_RNDU, 1.33658354512981247808e1);
check4(1.0, 3.7252902984619140625e-9, GMP_RNDU, 7.55393356971199025907e-02);
}
/* TODO : tests des infinis dans tagm.c */
return 0;
}
|
