summaryrefslogtreecommitdiff
path: root/doc/algorithms.tex
diff options
context:
space:
mode:
authorvlefevre <vlefevre@280ebfd0-de03-0410-8827-d642c229c3f4>2011-03-10 13:30:33 +0000
committervlefevre <vlefevre@280ebfd0-de03-0410-8827-d642c229c3f4>2011-03-10 13:30:33 +0000
commitd3c5edc38d7c38c084423b6478871b9cc74683a8 (patch)
tree923aecff5ce8cb80ead1355529433a07517bc775 /doc/algorithms.tex
parent8c302c055c3943df8c89556dc60be66e7c614102 (diff)
downloadmpfr-d3c5edc38d7c38c084423b6478871b9cc74683a8.tar.gz
[doc/algorithms.tex] For the Bessel function, say that the algorithm
assumes that no underflows/overflows occur. git-svn-id: svn://scm.gforge.inria.fr/svn/mpfr/trunk@7558 280ebfd0-de03-0410-8827-d642c229c3f4
Diffstat (limited to 'doc/algorithms.tex')
-rw-r--r--doc/algorithms.tex3
1 files changed, 2 insertions, 1 deletions
diff --git a/doc/algorithms.tex b/doc/algorithms.tex
index 9a033d80e..0e84f1e50 100644
--- a/doc/algorithms.tex
+++ b/doc/algorithms.tex
@@ -3369,7 +3369,8 @@ $z \rightarrow \pm\infty$, and tends to $0$ when $z \rightarrow 0$, except
$J_0$ which tends to $1$.
We use the following algorithm, with working precision $w$, and rounding
-to nearest:
+to nearest. Warning! This algorithm assumes that no underflows/overflows
+occur.
\begin{quote}
$x \leftarrow \circ(z^n)$ \\
$y \leftarrow \circ(z^2)/4$ [division by $4$ is exact] \\