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
|
/* mpfr_cosh -- hyperbolic cosine
Copyright 2001, 2002, 2004 Free Software Foundation.
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.LIB. If not, write to
the Free Software Foundation, Inc., 59 Temple Place - Suite 330, Boston,
MA 02111-1307, USA. */
#include "mpfr-impl.h"
/* The computation of cosh is done by
cosh= 1/2[e^(x)+e^(-x)] */
int
mpfr_cosh (mpfr_ptr y, mpfr_srcptr xt , mp_rnd_t rnd_mode)
{
/****** Declaration ******/
mpfr_t x;
int inexact;
if (MPFR_UNLIKELY(MPFR_IS_SINGULAR(xt)))
{
if (MPFR_IS_NAN(xt))
{
MPFR_SET_NAN(y);
MPFR_RET_NAN;
}
else if (MPFR_IS_INF(xt))
{
MPFR_SET_INF(y);
MPFR_SET_POS(y);
MPFR_RET(0);
}
else
{
MPFR_ASSERTD(MPFR_IS_ZERO(xt));
return mpfr_set_ui (y, 1, rnd_mode); /* cosh(0) = 1 */
}
}
mpfr_save_emin_emax ();
MPFR_TMP_INIT_ABS(x, xt);
/* General case */
{
/* Declaration of the intermediary variable */
mpfr_t t, te;
/* Declaration of the size variable */
mp_prec_t Nx = MPFR_PREC(x); /* Precision of input variable */
mp_prec_t Ny = MPFR_PREC(y); /* Precision of output variable */
mp_prec_t Nt; /* Precision of the intermediary variable */
long int err; /* Precision of error */
/* compute the precision of intermediary variable */
Nt = MAX(Nx, Ny);
/* The optimal number of bits : see algorithms.ps */
Nt = Nt + 3 + __gmpfr_ceil_log2 (Nt);
/* initialise of intermediary variables */
mpfr_init2 (t, Nt);
mpfr_init2 (te, Nt);
/* First computation of cosh */
for (;;)
{
/* Compute cosh */
mpfr_exp (te, x, GMP_RNDD); /* exp(x) */
mpfr_ui_div (t, 1, te, GMP_RNDU); /* 1/exp(x) */
mpfr_add (t, te, t, GMP_RNDU); /* exp(x) + 1/exp(x)*/
mpfr_div_2ui (t, t, 1, GMP_RNDN); /* 1/2(exp(x) + 1/exp(x))*/
/* Estimation of the error */
err = Nt - 3;
/* Check if we can round */
if (MPFR_UNLIKELY(MPFR_IS_INF(t)) ||
mpfr_can_round (t, err, GMP_RNDN, GMP_RNDZ,
Ny + (rnd_mode == GMP_RNDN)))
break;
/* Actualisation of the precision */
Nt += BITS_PER_MP_LIMB;
mpfr_set_prec (t, Nt);
mpfr_set_prec (te, Nt);
}
inexact = mpfr_set (y, t, rnd_mode);
mpfr_clear (te);
mpfr_clear (t);
}
mpfr_restore_emin_emax ();
return mpfr_check_range (y, inexact, rnd_mode);
}
|
