Re: [Algorithms] fast pow() for limited inputs
Brought to you by:
vexxed72
|
From: Robin G. <rob...@gm...> - 2010-08-19 17:57:13
|
On Wed, Aug 18, 2010 at 11:35 PM, Fabian Giesen <ry...@gm...> wrote:
>
>> I would also love to just see a sample implementation of pow(), log(),
>> and exp() somewhere, even that might be helpful.
>
> glibc math implementations are in sysdeps/ieee754 for generic IEEE-754
> compliant platforms, with optimized versions for all relevant
> architectures in sysdeps/<arch>. If you really want to know how it's
> implemented :)
What he said.
Also, take a look at the CEPHES library for platform agnostic
reference implementations of the C math functions and some extras like
cotangent, cuberoot and integer powers:
http://www.netlib.org/cephes/
And here's an X86 specific implementation of powf() that claims to be
faster (than what, it doesn't say):
http://www.xyzw.de/c190.html
- Robin Green.
|