Fast Parallel Algorithm for Polynomial Evaluation

Simple item page
dc.contributor.authorPrzemysław Stpiczyński
dc.coverage.spatialBolivia
dc.date.accessioned2026-03-22T15:44:22Z
dc.date.available2026-03-22T15:44:22Z
dc.date.issued2003
dc.descriptionCitaciones: 5
dc.description.abstractWe present a new efficient parallel algorithm for polynomial evaluation based on a previously introduced divide-and-conquer method for solving linear recurrence systems with constant coefficients, which is formulated in terms of the level 1 BLAS (Basic Linear Algebra Subprograms) routine AXPY. We also discuss its platform-independent implementation with OpenMP and finally present the results of experiments performed on a dual processor Pentium III computer running under Linux operating system with Altas as an efficient implementation of BLAS. The sequential version of the algorithm is up to three times faster than the Horner's scheme.
dc.identifier.doi10.1080/10637190310001633673
dc.identifier.urihttps://doi.org/10.1080/10637190310001633673
dc.identifier.urihttps://andeanlibrary.org/handle/123456789/54125
dc.language.isoen
dc.relation.ispartofParallel algorithms and applications
dc.sourceHigher University of San Andrés
dc.subjectPentium
dc.subjectComputer science
dc.subjectParallel computing
dc.subjectDivide and conquer algorithms
dc.subjectScheme (mathematics)
dc.subjectConstant (computer programming)
dc.subjectPolynomial
dc.subjectLinear algebra
dc.subjectDual (grammatical number)
dc.subjectParallel algorithm
dc.titleFast Parallel Algorithm for Polynomial Evaluation
dc.typearticle

Files

Collections

Artículo Científico Publicado