Anonymous user
Talk:Numerical integration/Gauss-Legendre Quadrature: Difference between revisions
Talk:Numerical integration/Gauss-Legendre Quadrature (view source)
Revision as of 22:49, 10 May 2020
, 4 years ago→how can we tell ...: added wording.
(added comments about limits (of precision) in REXX, what determines it.) |
m (→how can we tell ...: added wording.) |
||
| (One intermediate revision by the same user not shown) | |||
Line 1:
__TOC__
== how can we tell ... ==
How can we tell if an implementation of this task is correct? (Ok, if we copy the lisp code and get the same answers that would probably be correct, but that does not address all the abstractions raised in the task description.) --[[User:Rdm|Rdm]] 13:12, 30 May 2011 (UTC)
Line 23 ⟶ 26:
::::(unindent) It's difficult to talk about feasibility abstractly. You could represent var x simply as "root of that function" without fully evaluating it, and later logic may simply eliminate that function, hence the root, altogether, then good, lots of work saved; but if you are forced to take a value at some point, it then all depends on how you are going to use that value: you need to make decision now on precision desired, which can be [[wp:Wilkinson's_polynomial|surprisingly non-trivial]]. Stuff may be theoretically possible, but it's quite different from being practical, alas. --[[User:Ledrug|Ledrug]] 16:40, 28 June 2011 (UTC)
::::::: In the REXX examples, when using more decimal digits of ''pi'' and ''e'', I found the limit of decimal precision is simply determined by how many digits are specified (via '''numeric digits nnn'''). Of course, this slows up computation. -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 04:55, 24 August 2018 (UTC)
== Tables and layout ==
| |||