Cart (Loading....) | Create Account
Close category search window
 

Long Integers and Polynomial Evaluation with Estrin's Scheme

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Bodrato, M. ; mambaSoft, Torino, Italy ; Zanoni, Alberto

In this paper the problem of univariate polynomial evaluation is considered. When both polynomial coefficients and the evaluation "point" are integers, unbalanced multiplications (one factor having many more digits than the other one) in classical Ruffini-Horner rule do not let computations completely benefit of sub quadratic methods, like Karatsuba, Toom-Cook and Schonhage-Strassen's. We face this problem by applying an approach originally proposed by Estrin to augment parallelism exploitation in computation. We show that it is also effective in the sequential case, whenever data dimensions grow, e.g. in the long integer case. We add some adjustments to Estrin's proposal obtaining a smoother behavior around corner cases, and to avoid performance degradation when most of the coefficients are zero. This way, a new general algorithm is obtained, improving both theoretical complexity and actual performance. The algorithm itself is very simple, and its use can be usefully extended to evaluation of polynomials on rationals or on polynomials (polynomial composition). Some tests, results and comparisons obtained with PARI/GP are also presented, for both dense and "sparse" polynomials.

Published in:

Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), 2011 13th International Symposium on

Date of Conference:

26-29 Sept. 2011

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.