I齧 looking for an JAVA algorithm, which can compute the roots of
an polynomial given by coefficients f.e. in array:
[a0 a1 a2 a3 ...]
polynomial: a0 + a1*x + a2*x^2 + a3*x^3...= 0
x = ?
Could anybody help me to find some web links to source codes of
advanced mathematics functions such as finding roots of an polynomial?
Thank You
Cechyn
Grobner bases allow you to find roots of polynomials.
I think (although I'm doing this from very vague memories of someone telling me about it) that if you compute the chain of derivatives, then you can find the number of roots between two values by evaluating the chain at the two values and counting the number of changes of sign. I can't recall whether that's differences of sign between the two chains, or multiplying the corresponding values from the two chains and counting the transitions in the merged chain.
Thank you, but there are only principles of some basic algorithms
on this web (http://mathworld.wolfram.com/topics/Polynomials.html)
I齞 prefer some JAVA source files archive with special mathematical
functions. I have already found one with special linear algebra and
matrix functions.
For my problem, I need JAVA archive with numerical mathematics methods
If anybody knows such one, I'l be very happy.
Thank you
Cechyn
check out the books
numerical recipes in XXX
I don't think there is a java version available, but
it's no problem to convert a c implementation into a java implementation.
I can't tell if the algorithm you are looking for is in the book, but it is worth a look
regards
Spieler
Numerical Recipes contains such algorithms. Basically they
find one root and then divide by the according monomial and
thus find all roots step by step.
Numerical Recipes in C is available online as a pdf download somewhere,
so check that one one.
Regards,
Stepan
> check out the books
>
> numerical recipes in XXX
>
> I don't think there is a java version available, but
> it's no problem to convert a c implementation into a
> java implementation.
>
> I can't tell if the algorithm you are looking for is
> in the book, but it is worth a look
>
> regards
> Spieler