Hi, there,
I need to solve hight order polynomial equations like ax^15+bx^12+cx^9+dx^6+ex^3+fx^2+g=0 in my research. Any body knows where to find a c code to solve the roots?
Many thanks,
Whitney
This is a discussion on Looking for a C code for roots of high order polynomials within the C Programming forums, part of the General Programming Boards category; Hi, there, I need to solve hight order polynomial equations like ax^15+bx^12+cx^9+dx^6+ex^3+fx^2+g=0 in my research. Any body knows where to ...
Hi, there,
I need to solve hight order polynomial equations like ax^15+bx^12+cx^9+dx^6+ex^3+fx^2+g=0 in my research. Any body knows where to find a c code to solve the roots?
Many thanks,
Whitney
Say hello to your new best friend: GSL - GNU Scientific Library - GNU Project - Free Software Foundation (FSF)
Can you give a little education about how to find what I want?
The red bit of text is a link. You click on it.
Why don't you use mathlab?
If you're asking what I thnk you're asking, then it is believed to be impossible.
Wikipedia backs this up:For a univariate polynomial of degree less than five, we have closed form solutions such as the quadratic formula. However, even this degree-two solution should be used with care to ensure numerical stability. The degree-four solution is unwieldy and troublesome. Higher-degree polynomials have no such general solution, according to the Abel–Ruffini theorem (1824, 1799).
My homepage
Advice: Take only as directed - If symptoms persist, please see your debugger
Linus Torvalds: "But it clearly is the only right way. The fact that everybody else does it some other way only means that they are wrong"
If you're asking what I thnk you're asking, then it is believed to be impossible.
Wikipedia backs this up:For a univariate polynomial of degree less than five, we have closed form solutions such as the quadratic formula. However, even this degree-two solution should be used with care to ensure numerical stability. The degree-four solution is unwieldy and troublesome. Higher-degree polynomials have no such general solution, according to the Abel–Ruffini theorem (1824, 1799).
My homepage
Advice: Take only as directed - If symptoms persist, please see your debugger
Linus Torvalds: "But it clearly is the only right way. The fact that everybody else does it some other way only means that they are wrong"
If you're asking what I thnk you're asking, then it is believed to be impossible.
Wikipedia backs this up:For a univariate polynomial of degree less than five, we have closed form solutions such as the quadratic formula. However, even this degree-two solution should be used with care to ensure numerical stability. The degree-four solution is unwieldy and troublesome. Higher-degree polynomials have no such general solution, according to the Abel–Ruffini theorem (1824, 1799).
My homepage
Advice: Take only as directed - If symptoms persist, please see your debugger
Linus Torvalds: "But it clearly is the only right way. The fact that everybody else does it some other way only means that they are wrong"
There're numerical methods to solve high order polynomial equation. I've written one that gives me all the roots(including complex roots).using Durand algorithm.
Last edited by Bayint Naung; 05-17-2011 at 01:39 AM.