<p>I know CORDIC, but is there a better algorithm to compute $\sin x$ and $\cos x$ within specified $n$-digit accuracy?</p>

CC BY-SA 3.0
2015-06-18T12:43:12.690Z
This [question](http://mathoverflow.net/questions/19946/what-is-the-time-complexity-of-computing-sinx-to-t-bits-of-precision) from mathoverflow seems relevant.
chazisop
CC BY-SA 3.0
2015-06-18T12:59:11.543Z
https://en.wikipedia.org/wiki/Computational_complexity_of_mathematical_operations#Elementary_functions
Emil Jeřábek
CC BY-SA 3.0
2015-06-18T17:37:09.367Z
[CORDIC](https://en.wikipedia.org/wiki/CORDIC) / wikipedia aka digit-by-digit or Volders algorithm
vzn
<approximation-algorithms>
An algorithm to compute sine and cosine within $n$-digit precision
user34491
# An algorithm to compute sine and cosine within $n$-digit precision

(Asked by: username_0 on 2015-06-18)

I know CORDIC, but is there a better algorithm to compute $\sin x$ and $\cos x$ within specified $n$-digit accuracy?

**Tags:** approximation-algorithms
> **Comments:**
> **username_1**: This [question](http://mathoverflow.net/questions/19946/what-is-the-time-complexity-of-computing-sinx-to-t-bits-of-precision) from mathoverflow seems relevant.  
> **username_2**: https://en.wikipedia.org/wiki/Computational_complexity_of_mathematical_operations#Elementary_functions  
> **username_3**: [CORDIC](https://en.wikipedia.org/wiki/CORDIC) / wikipedia aka digit-by-digit or Volders algorithm  

---

## 0 answers

