Thread Rating:
  • 1 Vote(s) - 5 Average
  • 1
  • 2
  • 3
  • 4
  • 5
Tommy's matrix method for superlogarithm.
#1
Essentially my matrix method is based on solving

F(x) = F(exp(x)) - 1

In terms of Taylor series.

We pick the expansion point x = 0 because the distance
Between the curve exp and id is minimum at x=0.

This is mentioned before here


http://math.eretrandre.org/tetrationforu....php?tid=3

The way I solve the infinite matrix is different.

First i solve the truncated linear with 7 variables and 6 equations.
And then minimize the Sum of squares for them.

Now i plug in the value of these 7 variables into the truncation 16 variables and 8 equations and again minimize the Sum of squares.

Then continue 34 equations and 17 variables etc etc.

By minimizing the Sum of squares we get the highest possible radius ( Up to the fixpoint ).

Since that radius extends to 1 we are Done.

Regards

Tommy1729
Reply


Possibly Related Threads...
Thread Author Replies Views Last Post
  Half-iterates and periodic stuff , my mod method [2019] tommy1729 0 175 09/09/2019, 10:55 PM
Last Post: tommy1729
  tommy's simple solution ln^[n](2sinh^[n+x](z)) tommy1729 1 2,301 01/17/2017, 07:21 AM
Last Post: sheldonison
  2 fixpoints , 1 period --> method of iteration series tommy1729 0 1,345 12/21/2016, 01:27 PM
Last Post: tommy1729
  [split] Understanding Kneser Riemann method andydude 7 7,335 01/13/2016, 10:58 PM
Last Post: sheldonison
  Dangerous limits ... Tommy's limit paradox tommy1729 0 1,784 11/27/2015, 12:36 AM
Last Post: tommy1729
  Tommy's Gamma trick ? tommy1729 7 5,812 11/07/2015, 01:02 PM
Last Post: tommy1729
  Tommy triangles tommy1729 1 1,914 11/04/2015, 01:17 PM
Last Post: tommy1729
  Tommy-Gottfried divisions. tommy1729 0 1,554 10/09/2015, 07:39 AM
Last Post: tommy1729
  Tommy's hyperlog tommy1729 0 1,611 06/11/2015, 08:23 AM
Last Post: tommy1729
Sad Tommy-Mandelbrot function tommy1729 0 1,831 04/21/2015, 01:02 PM
Last Post: tommy1729



Users browsing this thread: 1 Guest(s)