Faithful Polynomial Evaluation with Compensated Horner Algorithm

Details Faithful Polynomial Evaluation with Compensated Horner Algorithm Faithful Polynomial Evaluation with Compensated Horner Algorithm

2006-10-20

arxiv.org/abs/cs/0610122v1

Computer Science

Numerical Analysis

Scientific paper

This paper presents two sufficient conditions to ensure a faithful evaluation of polynomial in IEEE-754 floating point arithmetic. Faithfulness means that the computed value is one of the two floating point neighbours of the exact result; it can be satisfied using a more accurate algorithm than the classic Horner scheme. One condition here provided is an apriori bound of the polynomial condition number derived from the error analysis of the compensated Horner algorithm. The second condition is both dynamic and validated to check at the running time the faithfulness of a given evaluation. Numerical experiments illustrate the behavior of these two conditions and that associated running time over-cost is really interesting.

Affiliated with

Also associated with

No associations

Rating

Faithful Polynomial Evaluation with Compensated Horner Algorithm does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Faithful Polynomial Evaluation with Compensated Horner Algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Faithful Polynomial Evaluation with Compensated Horner Algorithm will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-361754