Python Forum
Thread Rating:
  • 0 Vote(s) - 0 Average
  • 1
  • 2
  • 3
  • 4
  • 5
Carlssons method for log
Anyone have experiance from the Carlssons method for log?
I have this code but it doesnt seem to work.
def fast_approx_ln(x,n):
    d = empty([n+1,n+1])
    a0 = (1+x)/2
    g0 = sqrt(x)
    for i in range(n):
        a0 = (a0+g0)/2
        g0 = sqrt(a0*g0)
        a0 = d[0,i]
    for k in range(n):
     for i in range(n):
           d[k,i] = (d[k-1,i]-4**(-k)*d[k-1,i-1])/(1-4**(-k))
Yoriz write Jul-01-2021, 06:05 PM:
Please post all code, output and errors (in their entirety) between their respective tags. Refer to BBCode help topic on how to post. Use the "Preview Post" button to make sure the code is presented as you expect before hitting the "Post Reply/Thread" button.
Can you provide a link? I can't find anything about Carlssons method
perhaps something here:
I haven't scanned the list, but you can open the links and search for carlssons.
I did look at diagram2vec and it has a section on Adcock-Carlsson polynomials if that's what your looking for.

Forum Jump:

User Panel Messages

Announcement #1 8/1/2020
Announcement #2 8/2/2020
Announcement #3 8/6/2020