2 comments

  • PaulHoule3 hours ago
    When I was in high school I thought book this was so much fun<p><a href="http:&#x2F;&#x2F;182.160.97.198:8080&#x2F;xmlui&#x2F;bitstream&#x2F;handle&#x2F;123456789&#x2F;118&#x2F;Francis_Scheid_Schaums_Outline_of_Numerical_Analysis%2C_Second_Edition____1989.pdf?sequence=1&amp;isAllowed=y" rel="nofollow">http:&#x2F;&#x2F;182.160.97.198:8080&#x2F;xmlui&#x2F;bitstream&#x2F;handle&#x2F;123456789&#x2F;...</a><p>which is all about the kind of numerical analysis you would do by hand and introduces a lot of really cool math like the calculus of differences<p><a href="https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Finite_difference" rel="nofollow">https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Finite_difference</a>
    • yababa_y1 minute ago
      i&#x27;ve been missing this knowledge! thank you for the recommendation.
  • gus_massa3 hours ago
    Nitpicking:<p>&gt; <i>You’re never going to get error less than 10E−15 since that’s the error in the tabulated values,</i><p>If you have like 100 (or 400) values in the table, you can squeeze one more digit.<p>In the simple case, imagine you have the constant pi, with 15 digits, repeated 100 times. If the rounding was done in a random direction like<p><pre><code> floor(pi * 1E15 + random() - 1&#x2F;2 ) &#x2F; 1E15 </code></pre> then you can use statistic to get an average with an error that is like K&#x2F;sqrt(N) where K is a constant and N is the number of samples. If you were paying attention in you statistic clases, you probably know the value of K, but it&#x27;s not my case. Anyway, just pick N=100 or N=400 or something like that and you get another digit for &quot;free&quot;.<p>Nobody builds a table for a constant and uses a uniform offset for rounding. Anyway, with some smooth function that has no special values in the points where it&#x27;s sample, the exact value of the cut decimal is quite &quot;random&quot; and you get a similar randomization.