Re: [PEPr] Call for votes on Math::Math_Polynomial
| From: | Keith Palmer Jr. | Date: | Sat, 19 Nov 2005 17:30:13 +0000 |
| Subject: | Re: [PEPr] Call for votes on Math::Math_Polynomial | ||
| References: | 1 2 | Groups: | php.pear.dev |
| Request: | Send a blank email to pear-dev+get-40429@lists.php.net to get a copy of this message | ||
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