gibson:teaching:fall-2016:math753:horner
Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision | ||
|
gibson:teaching:fall-2016:math753:horner [2016/11/11 11:36] gibson |
gibson:teaching:fall-2016:math753:horner [2016/11/11 11:37] (current) gibson |
||
|---|---|---|---|
| Line 1: | Line 1: | ||
| - | ====== Horner's method ====== | + | ====== Horner's method for polynomial evaluation ====== |
| ===Horner's method without base points === | ===Horner's method without base points === | ||
| Line 17: | Line 17: | ||
| \end{equation*} | \end{equation*} | ||
| - | evaluation only requires 4 adds and 4 multiplies. It's easy to see that these are the same polynmial, just written differently. The approach generalizes to arbitrary-order polynomials, and the payoff gets bigger as the order of the polynomial increases. | + | evaluation only requires 4 adds and 4 multiplies. It's easy to see that these are just two different ways of writing the exact same polynomial. The approach generalizes to arbitrary-order polynomials, and the payoff gets bigger as the order of the polynomial increases. |
| === Horner's method with base points === | === Horner's method with base points === | ||
gibson/teaching/fall-2016/math753/horner.1478892969.txt.gz · Last modified: 2016/11/11 11:36 by gibson
Page Tools
Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Share Alike 3.0 Unported
