Re: fast pow() for limited inputs

Robin Green <[email protected]> Thu, 19 Aug 2010 10:57:05 -0700
Newsgroups gmane.games.devel.algorithms
Message-ID <[email protected]>
On Wed, Aug 18, 2010 at 11:35 PM, Fabian Giesen <[email protected]> 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.

------------------------------------------------------------------------------
This SF.net email is sponsored by 

Make an app they can't live without
Enter the BlackBerry Developer Challenge
http://p.sf.net/sfu/RIM-dev2dev 
_______________________________________________
GDAlgorithms-list mailing list
[email protected]
https://lists.sourceforge.net/lists/listinfo/gdalgorithms-list
Archives:
http://sourceforge.net/mailarchive/forum.php?forum_name=gdalgorithms-list