Re:Why doesn't GCC optimize a*a*a*a*a*a to (a*a*a)*(a*a*a)? ...
by stephencanon on Saturday March 29, 2014 @01:14PM
(#7492958)
I pointed part of this out:
> it provides reasonable conservative bounds
It is the technique of backwards-error analysis that is naive, not the resulting bound. A “naive” method is not “simple” or “dumb” (or “aggressive” or whatever you think the opposite of “conservative” might be). It is simply a method that doesn’t use some a priori knowledge that’s available for the specific problem at hand. Backwards-error analysis is a naive technique in that it doesn’t benefit from specialized theorems of floating-point that allow one to establish tighter bounds, like the one I proved.
It's not naive. It's conservative, the exact opposite.