Parallelization of Horner Method: Implementation Strategy and Error Analysis

Authors

  • 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.

DOI:

https://doi.org/10.9734/bpi/rumcs/v9/402

Keywords:

Horner’s method, classic algorithm, polynomial evaluation, error analysis

Abstract

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.

Downloads

Published

2024-06-17

How to Cite

Policarpo Abascal Fuentes, David García Quintas, Jorge Jiménez Meana, & Antonio Palacio Muñiz. (2024). Parallelization of Horner Method: Implementation Strategy and Error Analysis. Research Updates in Mathematics and Computer Science Vol. 9, 27–46. https://doi.org/10.9734/bpi/rumcs/v9/402

Issue

Research Updates in Mathematics and Computer Science Vol. 9

Section

Chapters