Rewriting polynomials for computers

octohydra
Messages
7
Reaction score
0
Suppose I have a REALLY big polynomial:
a_0 + a_1 x + a_2 x^2 + a_3 x^3+a_4 x^4+ \cdots + a_n x^n
I can rewrite the polynomial as a combination of multiplication and addition operators (instead of exponents) that a computer tends to like as such:
a_0 + x \left( a_1 + x \left( a_2 + x \left( a_3 + x \left(a_4 + \cdots + a_n x \left)\right. \cdots \right)\right)\right)\right)

  • Does this process have a name?
  • Is there an algorithm to do this?
  • Is there an implementation of this on Sage or MATLAB/Octave or Mathematica?
 
Mathematics news on Phys.org
I believe this is called Horner's Rule. I'm sure there's an algorithm, but I don't recall what it is. Check online for more information about it.

I don't know what MATLAB and the others have for Horner's Rule.
 
Mark44 said:
I believe this is called Horner's Rule. I'm sure there's an algorithm, but I don't recall what it is. Check online for more information about it.

I don't know what MATLAB and the others have for Horner's Rule.


http://en.wikipedia.org/wiki/Horner_scheme"

Thanks! The information at the wiki page is more than plenty for me.
 
Last edited by a moderator:
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.
Back
Top