Re: Best processors for trig?
- From: Tauno Voipio <tauno.voipio@xxxxxxxxxxxxx>
- Date: Sat, 31 Mar 2007 16:05:28 GMT
Paul Keinanen wrote:
The most difficult of the elementary functions
is the logarithm, its Taylor series uses half of an
infinity to converge.
After all, the only real problem with logs is that you must be able to
calculate it in the 1.0 .. 2.0 range, the rest is trivial.
Do you really need anything more than a 6th degree polynomial ?
Yes - I do.
The MacLaurin series for a log (calculated for log(1 + x))
needs 5000 terms for 4 digits. Pick your favourite formula
collection and have a look.
I had to split the range to (1 .. sqrt(2)) and (sqrt(2) .. 2),
and calculate 5th degree Chebysev series approximations to
get enough precision for single-precision float.
--
Tauno Voipio
tauno voipio (at) iki fi
.
- Follow-Ups:
- Re: Best processors for trig?
- From: Stefan Reuther
- Re: Best processors for trig?
- From: Paul Keinanen
- Re: Best processors for trig?
- References:
- Best processors for trig?
- From: Mike Noone
- Re: Best processors for trig?
- From: Tim Wescott
- Re: Best processors for trig?
- From: larwe
- Re: Best processors for trig?
- From: Tauno Voipio
- Re: Best processors for trig?
- From: Paul Keinanen
- Best processors for trig?
- Prev by Date: Re: Video capture/compression
- Next by Date: Re: Best processors for trig?
- Previous by thread: Re: Best processors for trig?
- Next by thread: Re: Best processors for trig?
- Index(es):
Relevant Pages
|