Difference between revisions of "Thread:User talk:Rednaxela/FastTrig/Faster normalXAngle -- faster sin,cos,tan/reply (10)"
Jump to navigation
Jump to search
m (Reply to Faster normalXAngle --> faster sin,cos,tan) |
m |
||
(One intermediate revision by the same user not shown) | |||
Line 1: | Line 1: | ||
− | Have a look | + | Have a look at ''Polynomial Approximations to Sine and Cosine''. This uses no memory and is even faster than the lookup table approach. Skilgannon uses this as far as I know. |
+ | |||
+ | Also have a look at Chebyshev Approximation (<s>http://metamerist.com/cheby/example38.htm</s> [http://web.archive.org/web/20131017170401/http://metamerist.com/cheby/example38.htm archive]) which works pretty well for atan, asin and acos. |
Latest revision as of 06:21, 15 August 2018
Have a look at Polynomial Approximations to Sine and Cosine. This uses no memory and is even faster than the lookup table approach. Skilgannon uses this as far as I know.
Also have a look at Chebyshev Approximation (http://metamerist.com/cheby/example38.htm archive) which works pretty well for atan, asin and acos.