Abstract
We 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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.