/explore
|
You are here 
|
curatedsql.com | ||
| | | | |
nuxx.net
|
|
| | | | | ||
| | | | |
nuxx.net
|
|
| | | | | ||
| | | | |
djalil.chafai.net
This post is devoted to a couple of simple fast algorithms. The Horner algorithm. The naive way to evaluate at point \( {z} \) the polynomial \[ P(z):=a_nz^n+\cdots+a_1z+a_0 \] is to compute separately \( {a_nz^n,\ldots,a_1z,a_0} \) and to sum up the results. The complexity of this evaluation algorithm is \( {O(n^2)} \). It could be more clever to compute recursively... |
|
| | | | | ||
| | | | |
runswiththedug.wordpress.com
Visit the post for more. |
|
| | | |||
