jvz01

7 ms·

1. 1.▲
   by jvz01 5y ago

   Another good hint is the classical half-angle formulas. You can often avoid calling sin() and cos() altogether!
2. 2.▲
   by jvz01 5y ago

   Little side-note: algorithm as given is scalar; however, its branch-free, and defined entirely in the header file. So, compilers will typically be able to vectorize it, and thus achieve speed up directly based on the vector size. I see po
3. 3.▲
   by jvz01 5y ago

   Yes, aim was to be acurate down to 1 lsb while significantly faster. Feel free to drop terms from the polynomial if you can live with less accurate results! The coefficients were generated by a package called Sollya, I've used it a fe
4. 4.▲
   by jvz01 5y ago

   I have developed very fast, accurate, and vectorizable atan() and atan2() implementations, leveraging AVX/SSE capabilities. You can find them here [warning: self-signed SSL-Cert]. https://fox-toolkit.org/wordpress&#x2