Parallelization of Horner Method: Implementation Strategy and Error Analysis | Chapter 3| Research Updates in Mathematics and Computer Science Vol. 9

 

Minimizing the computational cost of polynomial evaluation is a main problem in Computational Science. We present a modification of Horner’s method to exploit its advantages in the evaluation of sparse polynomials. We also propose a polynomial partitioning that allows to perform Horner’s method in parallel. In addition, we provide an analysis of the numerical error between the proposed parallel method and the classic algorithm.

 

Author(s) Details

Policarpo Abascal Fuentes

Department of Mathematics, University of Oviedo, Edificio Polivalente Campus de Viesques, 33203-Gijón, Asturias, Spain.

David García Quintas

Department of Mathematics, University of Oviedo, Edificio Polivalente Campus de Viesques, 33203-Gijón, Asturias, Spain.

Jorge Jiménez Meana

Department of Mathematics, University of Oviedo, Edificio Polivalente Campus de Viesques, 33203-Gijón, Asturias, Spain.

Antonio Palacio Muñiz

Department of Mathematics, University of Oviedo, Edificio Polivalente Campus de Viesques, 33203-Gijón, Asturias, Spain.

 

Please see the link:- https://doi.org/10.9734/bpi/rumcs/v9/402