Talk:Generating trigonometric tables
From Wikipedia, the free encyclopedia
Unfortunately, that's not a useful algorithm for generating sine tables, for a number of reasons. It will only work as the number of divisions tends towards infinity, with infinite-precision arithmetic.
I might add more algorithms, Ive asked a guy about incorporating his page with four algorthms into wikipedia. /sandos
(Has anyone ever actually used the Euler-integration method to compute trig tables?)
I would suggest dividing this article into a few sections:
- Historical computation of trigonometric tables, before computers were widespread. Who did it? What methods did they use? How accurately did they compute them?
- Recurrence algorithms used for FFTs, etcetera, summarizing the formulas that are most often used and their error characteristics.
- Interpolation schemes that are used for employing tables to compute trig. functions of arbitrary arguments.
Probably, there should be a separate article on computing trigonometric functions, not necessarily tables per se, but how they are actually done in practice. (CORDIC algorithms, arithmetic-geometric mean techniques for arbitrary-precision arithmetic, etcetera.)
[edit] Moved
Moved from the article:
- To come
- Buneman's recurrence algorithm for accurate FFTs (Proc. IEEE 75, 1434 (1987)), or some similarly improved scheme (see Tasche, below).
- Calculating accurate approximations for trigonometric functions (CORDIC schemes, etcetera)
- Arbitrary-precision arithmetic methods (quadratically convergent schemes based on arithmetic-geometric mean, related to fast methods for computing pi)
— Timwi 16:24, 6 Mar 2004 (UTC)
[edit] Cool
You may please add some solved problems of trigonometry.{| class="wikitable" |- ! header 1 ! header 2 ! header 3 |- | row 1, cell 1 | row 1, cell 2 | row 1, cell 3 |- | row 2, cell 1 | row 2, cell 2 | row 2, cell 3 |}
