Re: Roots of a polynomial
- From: Charles Krug <cdkrug@xxxxxxxxxxxxxxxx>
- Date: Tue, 30 Aug 2005 02:31:09 GMT
On Mon, 29 Aug 2005 15:20:14 -0400, Jerry Avins <jya@xxxxxxxx> wrote:
> Martin Blume wrote:
>> "Tim Wescott" schrieb
>>
>>>
>>>The book "Numerical Recipes in C" has a
>>>polynomial root finder.
>>>
>>
>> I keep finding on the web references that are saying
>> that this book is less than optimal. What's the
>> opinion here? Any other good books about numerical
>> methods that can be recommended?
>
> If you mean by "less than optimal" that a clever programmer can write a
> more efficient algorithm, that is often true. It is rarely true that the
> routines don't perform as claimed. Avoiding NR because the code could
> perhaps be improved is like choosing to walk because the bicycle you've
> been offered is less than best.
>
I've never found an instance where NR's code was "wrong" but the
examples are written more for teaching than for performance.
There WERE well known problems with earlier editions of the book, all of
which are noted in the notes.
HOWEVER, NR has EXCELLENT cross references that point to NUMEROUS
implementations, both free and commercial, of nearly all of the
algorithms.
Note the root finding is a tricky problem, as you're necessarily dealing
with very small numbers. Back when the 'c40 was all the rage, we ran
into quite a few problems when the guy implementing the root finding
algorithm "knew" he had it right, but forgot that the 'c40 didn't, by
default, didn't do things with enough accuracy for the kind of algorithm
he was using.
I sure learned a lot about numeric methods on That project.
.
- Prev by Date: Re: Care to give me the IFFT of this 64 lines of data?
- Next by Date: Re: vorbis encoder/decoder for TI C54x Platform?
- Previous by thread: Basic question on upsampling/downsampling
- Next by thread: how to change receive mode of 5402's mcbsp
- Index(es):
Relevant Pages
|
