| Autor: |
A. Palacio Muniz, J. Jimenez Meana, D. Garcia Quintas, F. Fueyo Tirado, P. Abascal Fuentes |
| Rok vydání: |
2022 |
| Předmět: |
|
| Zdroj: |
Journal of Advances in Mathematics and Computer Science. :20-35 |
| ISSN: |
2456-9968 |
| DOI: |
10.9734/jamcs/2022/v37i630457 |
| Popis: |
Minimizing the computational cost of polynomial evaluation is a main problem in Computational Science. Horner's algorithm efficiently solves the problem of evaluating a polynomial of degree n in time O(n). It is also used to evaluate multivariate polynomials and, as an extension, matrix polynomials.If, in addition, a parallel execution of this method can be carried out, the computational cost of this problem would be further minimized.This makes it especially important to develop a strategy for parallel execution of Horner's method for fast and ecient polynomial evaluation.In this paper we present a parallelization of Horner's method based on polynomial partitioning, as well as a modification of this method to exploit its advantages in the evaluation of sparse polynomials.We also provide an analysis of the numerical error between the proposed parallel method and the classic algorithm. |
| Databáze: |
OpenAIRE |
| Externí odkaz: |
|
