MAT 3237: Numerical Analysis

Assignment # 01, 25 September 2014 Muhammad Hanif Fauzi

A Naive Polynomial Evaluation

Test codes by computing a polynomial of degree 104 whose coefficients are ai = i + 1, fori = 0, 1, 2, · · · , 104 at point r = 0.1.

1

Horner’s Algorithm

Test codes by computing a polynomial of degree 104 whose coefficients are ai = i + 1, fori = 0, 1, 2, · · · , 104 at point r = 0.1.

From the two algorithm above can be proved that the Horner’s Algorithm is more efficient and fasterthan the Naive Polynomial Evaluation.

2