A note on computation of the slog
#2
This is ingenious!
So we have for each coefficient two sequences, where for each the n+1-th element can be computed only from the previous n elements, and the coefficient is the scalar product of both sequences.
Perhaps we can solve the convergence problem with this decomposition.
Reply


Messages In This Thread
A note on computation of the slog - by Gottfried - 03/12/2009, 01:34 PM
RE: A note on computation of the slog - by bo198214 - 03/12/2009, 05:24 PM

Possibly Related Threads…
Thread Author Replies Views Last Post
  Revisting my accelerated slog solution using Abel matrix inversion jaydfox 22 68,932 05/16/2021, 11:51 AM
Last Post: Gottfried
  Improving convergence of Andrew's slog jaydfox 19 67,804 07/02/2010, 06:59 AM
Last Post: bo198214
  Single-exp series computation code mike3 0 7,221 04/20/2010, 08:59 PM
Last Post: mike3
  intuitive slog base sqrt(2) developed between 2 and 4 bo198214 1 10,115 09/10/2009, 06:47 PM
Last Post: bo198214
  sexp and slog at a microcalculator Kouznetsov 0 7,270 01/08/2009, 08:51 AM
Last Post: Kouznetsov
  An error estimate for fixed point computation of b^x bo198214 0 6,912 05/31/2008, 04:11 PM
Last Post: bo198214
  SAGE code implementing slog with acceleration jaydfox 4 17,293 10/22/2007, 12:59 AM
Last Post: jaydfox
  Dissecting Andrew's slog solution jaydfox 15 45,005 09/20/2007, 05:53 AM
Last Post: jaydfox
  Computing Andrew's slog solution jaydfox 16 47,674 09/20/2007, 03:53 AM
Last Post: andydude



Users browsing this thread: 1 Guest(s)