Optimized Approximative pow() in C / C++

Mostly thanks to this reddit discussion, I have updated my pow() approximation for C / C++. I have now two different versions:

This new code uses the union trick, instead of the weird casting trick I’ve used before. This means that -fno-strict-aliasing is no more required any more when compiling, and it is also a bit faster because one less temporary variables is needed. When you have a little endian machine, you have to exchange u.x[0] and u.x[1]. On my PC, this version is 4.2 times faster than the much more precise pow().

Besides that, I also have now a slower approximation that has much less error when the exponent is larger than 1. It makes use exponentiation by squaring, which is exact for the integer part of the exponent, and uses only the exponent’s fraction for the approximation:

This code is 3.3 times faster than pow(). Writing a microbenchmark is not easy, so I have posted mine here. Here is also a Java version of the more accurate pow approximation.

Any ideas how this could be improved? Please post them!


  1. Pieter says:

    The new approximation does not work with negative exponents because the loop will never end. Is the first approximation valid for negative exponents?

    • martinus says:

      It does not work with negative constants, but you can use this trick:

      a^(-b) = 1/(a^b)

      so when b is negative, just calculate

      1.0/pow(a, abs(b))

  2. inlineWillIncreaseit says:

    I have seen some people use the old fashion Taylor aproximations in they calculus but there are some better algorithms.
    Don’t they use some asm and some tables for that

  3. Pingback: 1584 | ?? ?? ????
  4. Steve says:

    You could modify the function like this so it can handle negative exponents:

    inline double CompOgdenRobust::fastPrecisePow(double a, double b)
    if (b >= 1;

    return r * u.d;

Leave a Reply

Your email address will not be published. Required fields are marked *