A Parallel Compensated Horner Scheme

Abstract : The Compensated Horner Scheme is an accurate and fast algorithm to evaluate univariate polynomials in floating-point arithmetic. The accuracy of the computed result is similar to the one given by the Horner scheme computed in twice the working precision. This Compensated Horner Scheme runs at least as fast as existing implementations producing the same output accuracy. In this talk, we will present a parallel version of the Compensated Horner Scheme. Some experiments on multicore and Graphics Processor Units (GPU) architectures will be presented to show the efficiency of this algorithm.
Type de document :
Communication dans un congrès
CSE 2017, SIAM Conference on Computational Science and Engineering (CSE), Feb 2017, Atlanta, United States. 2017
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01539819
Contributeur : Stef Graillat <>
Soumis le : jeudi 15 juin 2017 - 14:13:01
Dernière modification le : samedi 17 juin 2017 - 01:20:04

Identifiants

  • HAL Id : hal-01539819, version 1

Collections

Citation

Stef Graillat, Youness Ibrahimy, Clothilde Jeangoudoux, Christoph Lauter. A Parallel Compensated Horner Scheme. CSE 2017, SIAM Conference on Computational Science and Engineering (CSE), Feb 2017, Atlanta, United States. 2017. 〈hal-01539819〉

Partager

Métriques

Consultations de la notice

68