diff options
author | Akira Kakuto <kakuto@fuk.kindai.ac.jp> | 2022-11-17 21:05:32 +0000 |
---|---|---|
committer | Akira Kakuto <kakuto@fuk.kindai.ac.jp> | 2022-11-17 21:05:32 +0000 |
commit | e0b69509184f55823eb40ec8e0ab254077d7d2c8 (patch) | |
tree | 680a765631e9a92ad0fb0e5bacfd4a2504ce881c /Build/source/libs/mpfr/mpfr-src/src/sum.c | |
parent | 2a24bd86e93b3660558d991622e465ebadbc4a34 (diff) |
mpfr 4.1.1
git-svn-id: svn://tug.org/texlive/trunk@65043 c570f23f-e606-0410-a88d-b1316a301751
Diffstat (limited to 'Build/source/libs/mpfr/mpfr-src/src/sum.c')
-rw-r--r-- | Build/source/libs/mpfr/mpfr-src/src/sum.c | 9 |
1 files changed, 5 insertions, 4 deletions
diff --git a/Build/source/libs/mpfr/mpfr-src/src/sum.c b/Build/source/libs/mpfr/mpfr-src/src/sum.c index ca3cba48c74..42002de39c7 100644 --- a/Build/source/libs/mpfr/mpfr-src/src/sum.c +++ b/Build/source/libs/mpfr/mpfr-src/src/sum.c @@ -1,6 +1,6 @@ /* Sum -- efficiently sum a list of floating-point numbers -Copyright 2014-2020 Free Software Foundation, Inc. +Copyright 2014-2022 Free Software Foundation, Inc. Contributed by the AriC and Caramba projects, INRIA. This file is part of the GNU MPFR Library. @@ -39,7 +39,7 @@ https://www.gnu.org/licenses/ or write to the Free Software Foundation, Inc., * * in the comp.lang.c FAQ: * - * http://c-faq.com/ansi/constmismatch.html + * https://c-faq.com/ansi/constmismatch.html */ /* See the doc/sum.txt file for the algorithm and a part of its proof @@ -51,7 +51,7 @@ TODO [VL, after a discussion with James Demmel]: Compared to volume 37, number 1-4, pages 101--112, 2004. sorting is not necessary here. It is not done because in the most common cases (where big cancellations are rare), it would take time and be -useless. However the lack of sorting increases the worst case complexity. +useless. However, the lack of sorting increases the worst case complexity. For instance, consider many inputs that cancel one another (two by two). One would need n/2 iterations, where each iteration reads the exponent of each input, therefore n*n/2 read operations. Using a worst-case sort @@ -61,7 +61,8 @@ iteration. But are there practical applications which would be used as tests? Note: see the following paper and its references: -http://www.eecs.berkeley.edu/~hdnguyen/public/papers/ARITH21_Fast_Sum.pdf + http://www.acsel-lab.com/arithmetic/arith21/papers/p54.pdf + (J. Demmel and H. D. Nguyen, Fast Reproducible Floating-Point Summation) VL: This is very different: In MPFR In the paper & references arbitrary precision fixed precision |