A Fast Parallel High-Precision Summation Algorithm Based on AccSumK - CNRS - Centre national de la recherche scientifique Accéder directement au contenu
Article Dans Une Revue Journal of Computational and Applied Mathematics Année : 2022

A Fast Parallel High-Precision Summation Algorithm Based on AccSumK

Xiaojun Lei
  • Fonction : Auteur
  • PersonId : 1111042
Tongxiang Gu
  • Fonction : Auteur
  • PersonId : 1111043
Hao Jiang
  • Fonction : Auteur
  • PersonId : 1111044
Jin Qi
  • Fonction : Auteur
  • PersonId : 1111045

Résumé

In this paper, we present a new parallel accurate algorithm called PAccSumK for computing summation of floating-point numbers. It is based on AccSumK algorithm. In the experiment, for the summation problems with large condition numbers, our algorithm outperforms in term of accuracy and computing time the PSumK algorithm. The reason is that our algorithm is based on a more accurate algorithm called AccSumK algorithm compared to the SumL algorithm used in PSumK. The proposed parallel algorithms 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.
Fichier principal
Vignette du fichier
PAccSumK_JCAMrev3.pdf (571.8 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03352473 , version 1 (23-09-2021)

Identifiants

Citer

Xiaojun Lei, Tongxiang Gu, Stef Graillat, Hao Jiang, Jin Qi. A Fast Parallel High-Precision Summation Algorithm Based on AccSumK. Journal of Computational and Applied Mathematics, 2022, 406, pp.113827. ⟨10.1016/j.cam.2021.113827⟩. ⟨hal-03352473⟩
68 Consultations
240 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More