Question: Effectiveness of Horner's method


Best wishes for this new year.

Horner's algorithm for polynomials is considered more efficient in terms of the number of operations.
However, numerous comparisons (search for real or complex roots, calculations of hundreds of values...)
with Maple on polynomials of high degrees (10,12...) show, for me, no significant difference in times of execution evaluated with the st-time() command.

Has this point already been covered?
Are there specific situations where using the "horner" conversion is relevant with Maple?

Thank you for your clarification.

Best regards.

Please Wait...