Talk:Thiele's interpolation formula: Difference between revisions

m
sign: Hence a subsequent table of (inv sin, inv cos, inv tan) records — while a bonus — is not strictly required.
(6 × arc sin ½, 3 × arc cos ½ and 4 × arc tan 1;)
m (sign: Hence a subsequent table of (inv sin, inv cos, inv tan) records — while a bonus — is not strictly required.)
Line 2:
: I make it 16, with ''x'' varying by steps of 0.05 from 0 to 1.55. (Now, if only I could make my version of this ''work'', but that algol68 code is deeply gnarly; does it really have different base indices in different dimensions?!?) –[[User:Dkf|Donal Fellows]] 16:01, 2 October 2010 (UTC)
 
I picked 32 rows to the table. Basically "'''from''' 0 '''toby''' 10.5505 '''byto''' 01.0555 ..." as 0.05 seems to give the full single precision answer (on an i686 CPU at least). Ideally this size would be calculated from the desired precision, but I don't have a formula for this precision calculation. [[User:NevilleDNZ|NevilleDNZ]] 21:31, 2 October 2010 (UTC)
: The task description modification is nice, but would it be terribly problematic to just provide the table? The task seems to have more stages than it really needs. A TSV table would be pretty useful for the purpose, IMHO. --[[User:Short Circuit|Michael Mol]] 22:35, 2 October 2010 (UTC)
 
The table of (''x, sin x, cos x, tan x'') records is generated prior to any interpolation being done... Then the interpolation is used to create &mdash; user defined &mdash; ''inv sin, inv cos and inv tan'' functions. Hence I figured that the three simple &pi; calculations &mdash; 6 &times; sin<sup>-1</sup> &frac12;, 3 &times; cos<sup>-1</sup> &frac12; and 4 &times; tan<sup>-1</sup> 1 &mdash; simply present/test/prove the interpolation is implemented correctly. Hence a subsequent table of (''inv sin, inv cos, inv tan'') records &mdash; while a bonus &mdash; is not strictly required. [[User:NevilleDNZ|NevilleDNZ]] 23:11, 2 October 2010 (UTC)
 
=== re:base indices in different dimensions ===