Accurate evaluation of bivariate polynomials.

Du, P.; Jiang, H.; Li, H.; Cheng, L.; Yang, C.

doi:10.1109/PDCAT.2016.25

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

Accurate evaluation of bivariate polynomials.

MPS-Authors

/persons/resource/persons206972

Li, H.
Research Group of Statistical Inverse-Problems in Biophysics, MPI for Biophysical Chemistry, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Du, P., Jiang, H., Li, H., Cheng, L., & Yang, C. (2016). Accurate evaluation of bivariate polynomials. In H. Shen, Y. Sang, & H. Tian (Eds.), 17th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT) 2016 (pp. 51-56).

Cite as: https://hdl.handle.net/11858/00-001M-0000-002D-9EE0-4

Abstract

Polynomials are widely used in scientific computing and engineering. In this paper, we present an accurate and fast compensated algorithm to evaluate bivariate polynomials with floating-point coefficients. This algorithm is applying error free transformations to the bivariate Horner scheme and sum the final decomposition accurately. We also prove the proposed algorithm's accuracy with forward error analysis that the accuracy of the computed result is similar to the result computed by the bivariate Horner scheme in twice the working precision. Numerical experiments illustrate the behavior and it has higher efficiency than the bivariate Horner scheme implemented in double-double library.