Re: [PEPr] Call for votes on Math::Math_Polynomial
| From: | Etienne Kneuss | Date: | Sun, 20 Nov 2005 10:11:05 +0000 |
| Subject: | Re: [PEPr] Call for votes on Math::Math_Polynomial | ||
| References: | 1 2 3 4 5 | Groups: | php.pear.dev |
| Request: | Send a blank email to pear-dev+get-40437@lists.php.net to get a copy of this message | ||
Keith Palmer Jr. wrote:
> Also, important to note that I *believe* its actually not possible to
> always find numerical roots for polynomial of degree 5+. There isn't
> any known algorithm to always find the roots, and I think its actually
> been proven that there *can't* be an algorithm to do this.
The point of numerical root-finding algorithms is to find approximations
on expressions that can't be solved, like most of the polynomials of
degree 5+.
So IMO it would be a great addition, if your solve() switched from exact
roots to approximations(PEAR::Numerical_RootFinding) when the degree is
higher than 4.
--
Etienne Kneuss
http://www.colder.ch/
colder@php.net