How can we define the error of the CORDIC Algorithm for calculating sin(x) as a function of the number of iterations/rotations performed?

Asked Oct 22 '23 at 10:30

Active Oct 22 '23 at 10:30

Viewed 31 times

I intend on comparing the CORDIC algorithm and the Taylor Series expansion for computing sin(x). However, I need to compare them on the basis of accuracy and time complexity.

How can we determine the error of the CORDIC Algorithm (similar to how the Lagrange Remainder can be applied to the Taylor Series for an nth degree polynomial)?

Thanks!

asked Oct 22 '23 at 10:30

Ricardo

In most practical cases, target precision and input range are known in advance, which means that Taylor is not optimal (there are polynomials of same degree with smaller (absolute or relative) error on the target interval). – emacs drives me nuts Oct 22 '23 at 12:25

How can we define the error of the CORDIC Algorithm for calculating sin(x) as a function of the number of iterations/rotations performed?

0 Answers0