[Bug math/706] pow() produces inaccurate results for base ~ 1.0, and large integer exponent on 32-bit x86

["vincent-srcware at vinc17 dot net" <sourceware-bugzilla@sourceware.org>]

http://sourceware.org/bugzilla/show_bug.cgi?id=706

Vincent Lefèvre <vincent-srcware at vinc17 dot net> changed:

           What    |Removed                     |Added
----------------------------------------------------------------------------
            Summary|pow() produces inaccurate   |pow() produces inaccurate
                   |results for base ~ 1.0, and |results for base ~ 1.0, and
                   |large exponent on 32-bit    |large integer exponent on
                   |x86                         |32-bit x86

--- Comment #14 from Vincent Lefèvre <vincent-srcware at vinc17 dot net> 2012-02-28 16:36:13 UTC ---
I've done some tests, and it seems that pow(x,y) for large y is inaccurate only
when y is an integer. So, if I understand correctly, an iterative algorithm is
used for integers y, and a log-exp algorithm (which seems accurate enough on
the few values I've tested) is used for other values. So, a possible easy fix
would be to always use the log-exp algorithm, possibly except for small
integers y.

Note: I've updated the bug summary following this observation (large exponent →
large integer exponent).

-- 
Configure bugmail: http://sourceware.org/bugzilla/userprefs.cgi?tab=email
------- You are receiving this mail because: -------
You are on the CC list for the bug.