[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [Bug-gsl] Bug in polynomial root finder
From: |
Brian Gough |
Subject: |
Re: [Bug-gsl] Bug in polynomial root finder |
Date: |
Fri, 04 Nov 2011 10:37:30 +0000 |
User-agent: |
Wanderlust/2.15.6 (Almost Unreal) Emacs/23.3 Mule/6.0 (HANACHIRUSATO) |
At Sat, 29 Oct 2011 08:22:53 -0700 (PDT),
Munagala Ramanath wrote:
> # shows bug in GSL polynomial root finder
> p = [1, -4, 2, 10, -17, 10, 6, -16, 12, -16, 16, -8, 28, -8, -48, 32]
> roots = GSL::Poly[ p.reverse ].solve
Thanks for the email. I think that is just a limitation of the solver
algorithm rather than a bug. The algorithm does not work for
arbitrarily high orders and 15th order is probably too high.
--
Brian Gough
- Re: [Bug-gsl] Bug in polynomial root finder,
Brian Gough <=