summaryrefslogtreecommitdiff
path: root/agm.c
blob: 32438e7c3695c5b941f393271605e19348e6460a (plain)
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
#include <stdio.h>
#include <math.h>
#include "gmp.h"
#include "gmp-impl.h"
#include "mpfr.h"



#define MON_INIT(xp, x, p, s) xp = (mp_ptr) TMP_ALLOC(s*BYTES_PER_MP_LIMB);    x -> _mp_prec = p; x -> _mp_d = xp; x -> _mp_size = s; x -> _mp_exp = 0; 




void 
#ifdef __STDC__
mpfr_agm(mpfr_ptr r, mpfr_srcptr op2, mpfr_srcptr op1, unsigned char rnd_mode)
#else
mpfr_agm(r, a, b, rnd_mode)
     mpfr_ptr r; 
     mpfr_srcptr a; 
     mpfr_srcptr b; 
     unsigned char rnd_mode; 
#endif
{
  int i, s, ntotal, p, q, go_on, no, ulps;
  double uo, vo;
  mp_limb_t *up, *vp, *tmpp, *tmpup, *tmpvp, *ap, *bp;
  mpfr_t u, v, tmp, tmpu, tmpv, a, b;
  TMP_DECL(marker1);
  TMP_DECL(marker2);
  TMP_DECL(marker3);


  /* If a or b is NaN, the result is NaN */
  if (FLAG_NAN(op1) || FLAG_NAN(op2)) 
    { SET_NAN(r); return; }


  /* If a or b is negative, the result is NaN */
  if ((SIGN(op1)<0)||(SIGN(op2)<0))
    { SET_NAN(r); return; }


  
  /* If a or b is 0, the result is 0 */
  if ((SIGN(op1)==0)||(SIGN(op2)==0)) 
    { SET_ZERO(r);
    return;
    }

 /* precision of the following calculus */
  q = PREC(r);
  p = q + 15;


  /* Initialisations */
  go_on=1;
  ntotal = ceil(log(p)/log(2)) +1;
  no=0;

  TMP_MARK(marker1);
  s=(p-1)/BITS_PER_MP_LIMB+1;
  MON_INIT(ap, a, p, s);  
  MON_INIT(bp, b, p, s);
  TMP_MARK(marker2);
  MON_INIT(up, u, p, s);
  MON_INIT(vp, v, p, s);   
  MON_INIT(tmpup, tmpu, p, s);  
  MON_INIT(tmpvp, tmpv, p, s);  
  MON_INIT(tmpp, tmp, p, s);  


  /* b and a will be the 2 operands but I want b>= a */
  if (mpfr_cmp(op1,op2) > 0) {
    mpfr_set(b,op1,GMP_RNDN); mpfr_set(a,op2,GMP_RNDN);  
  }
  else {
    mpfr_set(b,op2,GMP_RNDN); mpfr_set(a,op1,GMP_RNDN);  
  }
    
  vo=mpfr_get_d(b);
  uo=mpfr_get_d(a);

  mpfr_set(u,a,GMP_RNDN);
  mpfr_set(v,b,GMP_RNDN);
 
  /* Main loop */

  while (go_on==1) {
    int err;

    err=ceil((3*ntotal+2)*exp(-p*log(2))+3*exp(-p*uo*log(2)/(vo-uo))/log(2));
    
    /* Calculus of un and vn */
    for(i=no;i<ntotal;i++) {    
      mpfr_mul(tmp,u,v,GMP_RNDN);
      /*  printf("dont la racine est\n");   */
      mpfr_sqrt(tmpu,tmp,GMP_RNDN); 
      /*mpfr_print_raw(tmpu);  printf("\n");*/
      mpfr_add(tmp,u,v,GMP_RNDN);
      mpfr_div_2exp(tmpv,tmp,1,GMP_RNDN);
      mpfr_set(u,tmpu,GMP_RNDN);
      mpfr_set(v,tmpv,GMP_RNDN); 
    }

    /*    printf("avant can_round\n v : ");  */
    /* mpfr_out_str(stdout,10,0,v,GMP_RNDN); printf("\n u :");
      mpfr_out_str(stdout,10,0,u,GMP_RNDN);printf("\n"); */
    

    /* Exactness of the result */

    /* Calculus of the nomber of ulps between un and vn */
    /*printf("avant sub entre\n");
     mpfr_print_raw(v);  printf("    -\n");
    mpfr_print_raw(u);  printf("   , en RNDN\n");*/
    mpfr_sub(tmp,v,u,GMP_RNDN);
    mpfr_div(tmpu,tmp,u,GMP_RNDN);
    mpfr_mul_2exp(tmp,tmpu,q+1,GMP_RNDN);
    ulps = (int) floor(mpfr_get_d(tmp));
    if (ulps <0) ulps=-ulps;

    /* If there is more than 2 ulps, we have to do more iterations
       with the same precision */
    if( ulps >=2) {
      go_on=1;
      no=ntotal;
      ntotal+=5;
    }
   
    /* Else, we could have to work with more precision */
    else { 
      int round1, round2; 
      mpfr_t res1, res2;
      mp_limb_t *res1p, *res2p;

      TMP_MARK(marker3);
      s=(q-1)/BITS_PER_MP_LIMB+1;
      MON_INIT(res1p, res1, q, s);  
      MON_INIT(res2p, res2, q, s);  
      round1=mpfr_can_round(v,p-err-1,GMP_RNDU,rnd_mode,q);
      round2=mpfr_can_round(u,p-err-1,GMP_RNDD,rnd_mode,q);
      mpfr_set(res1, v, rnd_mode); 
      mpfr_set(res2, u, rnd_mode); 

      /* If u=v or u & v can be round to the same machine number, we
	 we have found the correct result */

      if (((ulps==0)&&round1)||((ulps==1)&&round1&&round2&&(mpfr_cmp(res1,res2)==0)))
	go_on=0;

      else {
	  go_on=1;
	  p+=5;
	  no=0;
	  ntotal+=3;
	  TMP_FREE(marker2); 
	  TMP_MARK(marker2);
	  s=(p-1)/BITS_PER_MP_LIMB+1;
	  MON_INIT(up, u, p, s);
	  MON_INIT(vp, v, p, s);   
	  MON_INIT(tmpup, tmpu, p, s);  
	  MON_INIT(tmpvp, tmpv, p, s);  
	  MON_INIT(tmpp, tmp, p, s);
	  mpfr_set(u,a,GMP_RNDN);
	  mpfr_set(v,b,GMP_RNDN);
      }
      TMP_FREE(marker3); 
    }
  }
  /* End of while */

  /* Setting of the result */

    mpfr_set(r,v,rnd_mode);


  /* Let's clean */
    TMP_FREE(marker1); 
  
  return ;
}