Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Let $f(x,1)=\sin(x)$ and $f(x,i)=f(\sin(x),i-1)$ ($f$ is the iterated sine function). For arbitrary $N$,$x_0$, how quickly can $f(x_0,N)$ be computed?

Answer to this question discusses Carleman-Matrix method. Is this method precise for very big $N$?

share|cite|improve this question

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.