Comments on: Exponential Functions: Benchmarks, 8 Times Faster Math.pow() http://martin.ankerl.com/2007/02/12/exponential-functions-benchmarks-11-times-faster-mathpow/ No movement is faster than no movement Fri, 30 Jul 2010 11:00:57 +0000 hourly 1 http://wordpress.org/?v=abc By: Roy van Rijn http://martin.ankerl.com/2007/02/12/exponential-functions-benchmarks-11-times-faster-mathpow/comment-page-1/#comment-513 Roy van Rijn Thu, 15 Feb 2007 20:50:31 +0000 http://martin.ankerl.com/?p=83#comment-513 Nice work :) I used approximation before in J2ME applications, worked like a charm. This one is also very nice, you might have seen it before: http://www.beyond3d.com/articles/fastinvsqrt/ btw, I started a little side-project too, a general selection API for Java JDBC (no over-the-top Hibernate stuff). http://www.redcode.nl/blog11.html Nice work :) I used approximation before in J2ME applications, worked like a charm.

This one is also very nice, you might have seen it before:
http://www.beyond3d.com/articles/fastinvsqrt/

btw, I started a little side-project too, a general selection API for Java JDBC (no over-the-top Hibernate stuff).
http://www.redcode.nl/blog11.html

]]>