A fast parallel high-precision summation algorithm based on AccSumK. (English) Zbl 1482.65074
Summary: In this paper, we present a new parallel accurate algorithm called for computing summation of floating-point numbers. It is based on algorithm. In the experiment, for the summation problems with large condition numbers, our algorithm outperforms the algorithm in terms of accuracy and computing time. The reason is that our algorithm is based on a more accurate algorithm called algorithm compared to the algorithm used in PSumK. The proposed parallel algorithm in this paper is designed to compute a result as if computed internally in \(K\)-fold the working precision. Numerical results are presented showing the performance and the accuracy of our new parallel algorithm for calculating summation.
MSC:
| 65G50 | Roundoff error |
| 15-04 | Software, source code, etc. for problems pertaining to linear algebra |
| 65F35 | Numerical computation of matrix norms, conditioning, scaling |
| 65F05 | Direct numerical methods for linear systems and matrix inversion |
| 65Y05 | Parallel numerical computation |
References:
| [1] | Rump, S.; Ogita, T.; Oishi, S., Accurate floating-point summation I: faithful rounding, SIAM J. Sci. Comput., 31, 1, 189-224 (2008) · Zbl 1185.65082 |
| [2] | Rump, S.; Ogita, T.; Oishi, S., Accurate floating-point summation part II: sign \(K\)-Fold faithful and rounding to nearest, SIAM J. Sci. Comput., 31, 2, 1269-1302 (2008) · Zbl 1190.65074 |
| [3] | Yamanaka, N.; Ogita, T.; Rump, S.; Oishi, S., A parallel algorithm for accurate dot product, Parallel Comput., 34, 6-8, 392-410 (2008) |
| [4] | Ogita, T.; Rump, S.; Oishi, S., Accurate sum and dot product, SIAM J. Sci. Comput., 26, 6, 1955-1988 (2005) · Zbl 1084.65041 |
| [5] | IEEE Standard for Binary Floating Point Arithmetic, Std 754-2019 (2019), IEEE: IEEE New York |
| [6] | Higham, N., Accuracy and Stability of Numerical Algorithms (2002), SIAM Publications: SIAM Publications Philadelphia · Zbl 1011.65010 |
| [7] | Lange, M.; Rump, S., Sharp estimates for perturbation errors in summations, Math. Comp., 88, 349-368 (2019) · Zbl 1453.65097 |
| [8] | Rump, S., Error bounds for computer arithmetics, (26th IEEE Symposium on Computer Arithmetic (2019), IEEE) |
| [9] | Jeannerod, C.-P.; Rump, S., On relative errors of floating-point operations: Optimal bounds and applications, Math. Comp., 87, 803-819 (2018) · Zbl 1380.65082 |
| [10] | Lange, M.; Rump, S., Error estimates for the summation of real numbers with application to floating-point summation, BIT, 57, 927-941 (2017) · Zbl 1380.65083 |
| [11] | Dekker, T. J., A floating-point technique for extending the available precision, Numer. Math., 18, 224-242 (1971) · Zbl 0226.65034 |
| [12] | Knuth, D. E., The Art of Computer Programming: Seminumerical Algorithms, Vol. 2 (1969), Addison-Wesley: Addison-Wesley Reading, Massachusetts · Zbl 0191.18001 |
| [13] | Rump, S., Inversion of extremely ill-conditioned matrices in floating-point, Jpn. J. Indust. Appl. Math., 26, 249-277 (2009) · Zbl 1185.65050 |
| [14] | Fousse, L.; Hanrot, G.; Lefèvre, V.; Pélissier, P.; Zimmermann, P., MPFR: A Multiple-precision binary floating-point library with correct rounding, ACM Trans. Math. Softw., 33, 2, 13 (2007) · Zbl 1365.65302 |
| [15] | Ahrens, P.; Nguyen, H.; Demmel, J., Efficient Reproducible Floating Point Summation and BLASTechnical Report No. UCB/EECS-2016-121 (2016), EECS Department: EECS Department UC Berkeley |
| [16] | Demmel, J.; Hida, Y., Fast and accurate floating point summation with application to computational geometry, Numer. Algorithms, 37, 101-112 (2004) · Zbl 1074.65054 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
