Re: [Algorithms] approximation to pow(n,x)?

[Oscar F. <os...@tr...>]

 x^m = exp(m log x)

So really you need a fast exp and log function.

Can you newton-raphson refine a log and exp calculation?  I've never tried
... perhaps someone else can help there.

Failing that you could probably use tables for the calculations though this,
obviously, limits the range of powers you can perform.

2009/11/4 Juan Linietsky <re...@gm...>

> Hi guys! I was wondering if there are fast ways to approximate the
> curve resulting from pow(n,x) where n is in range [0..1] and x > 0
> using only floating point (without strange pointer casts/etc)..
>
> Cheers
>
> Juan Linietsky
>
>
> ------------------------------------------------------------------------------
> Let Crystal Reports handle the reporting - Free Crystal Reports 2008 30-Day
> trial. Simplify your report design, integration and deployment - and focus
> on
> what you do best, core application coding. Discover what's new with
> Crystal Reports now.  http://p.sf.net/sfu/bobj-july
> _______________________________________________
> GDAlgorithms-list mailing list
> GDA...@li...
> https://lists.sourceforge.net/lists/listinfo/gdalgorithms-list
> Archives:
> http://sourceforge.net/mailarchive/forum.php?forum_name=gdalgorithms-list
>