For general exponentiation the so called 'CORDIC' algorithms are used. Google
knows about it but you really have to look for them (they're patented). For b
being a positive integer a 'divide and conquor' method would be much better:
a^b == a^(b/2)*a^(b-b/2) where '/' is the integer division operator.
kind regards,
Jos
Yeah, yeah, now lets discuss about 'b' as the positive integer, thats for sissy girls. Show me your real exponents!!.
Ha!, positive integers... ...listening a Chess match on the radio seems more fun to me.
Anyway, thanks Jos, things i've found about CORDIC have been of great help in what i'm doing. I'll share some of it later, in an article.