Dissecting Andrew's slog solution
#11
By the way, if you're wondering about the periodicity to the graph (which resembles the periodicity of the root test graphs), the explanation is simple. There are errors in both the magnitude and phase (complex rotation) of the terms, and these errors diminsh with increasing matrix size.

The errors in magnitude should be fairly stable, but the errors in phase will be magnified when the real part is approaching 0. The explanation is easier to understand if we look strictly at the cosine function (which gives us the real part).

\( \cos(1.5 + \epsilon) \) has a greater absolute error than \( \cos(\epsilon) \). If you then divide by the expected result, the errors are magnified further, because 1 divided by \( \cos(1.5 + \epsilon) \) is about 14.
~ Jay Daniel Fox
Reply


Messages In This Thread
Dissecting Andrew's slog solution - by jaydfox - 08/28/2007, 07:23 AM
RE: Dissecting Andrew's slog solution - by jaydfox - 09/10/2007, 05:22 PM

Possibly Related Threads…
Thread Author Replies Views Last Post
  Revisting my accelerated slog solution using Abel matrix inversion jaydfox 22 69,834 05/16/2021, 11:51 AM
Last Post: Gottfried
  A note on computation of the slog Gottfried 6 26,355 07/12/2010, 10:24 AM
Last Post: Gottfried
  Improving convergence of Andrew's slog jaydfox 19 68,240 07/02/2010, 06:59 AM
Last Post: bo198214
  intuitive slog base sqrt(2) developed between 2 and 4 bo198214 1 10,178 09/10/2009, 06:47 PM
Last Post: bo198214
  sexp and slog at a microcalculator Kouznetsov 0 7,305 01/08/2009, 08:51 AM
Last Post: Kouznetsov
  Convergence of matrix solution for base e jaydfox 6 23,158 12/18/2007, 12:14 AM
Last Post: jaydfox
  SAGE code implementing slog with acceleration jaydfox 4 17,406 10/22/2007, 12:59 AM
Last Post: jaydfox
  Computing Andrew's slog solution jaydfox 16 48,057 09/20/2007, 03:53 AM
Last Post: andydude



Users browsing this thread: 1 Guest(s)