Re: [PEPr] Call for votes on Math::Math_Polynomial

Well, PEAR users are not looking for semi-working packages ;) Implementing PEAR::Math_Numerical_RootFinding for 5+ degree polynomials would also be a nice idea. Keith Palmer Jr. wrote: > Yeah I'll be looking into adding features with future releases. I have > a semi-working factoring/finding the roots for 1st, 2nd, and 3rd > degree polynomials, and 4th degree isn't too much worse than the 3rd > degree one. > > Finding critical points/minimums/maximums is pretty easy too using the > derivative, so I'll do this in the future. > > - Keith > > Etienne Kneuss wrote: > >> Keith Palmer wrote: >> >> >>> I'm also looking into algorithms to find the GCD of the polynomial, >>> and polynomial factoring. >> >> >> I don't think it will me possible without too much overhead. >> >> Anyway, that might help you: >> >> http://mathworld.wolfram.com/PolynomialFactorization.html >> http://documents.wolfram.com/v4/MainBook/A.9.5.html >> http://wseas.org/mastorakis/IEEE_CAS1_Jan.pdf >> > -- Etienne Kneuss http://www.colder.ch/ colder@php.net