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
  Tommy's Gaussian method. tommy1729 18 346 07/28/2021, 12:24 AM
Last Post: JmsNxn
  Arguments for the beta method not being Kneser's method JmsNxn 9 391 07/23/2021, 04:05 PM
Last Post: JmsNxn
  Improved infinite composition method tommy1729 5 242 07/10/2021, 04:07 AM
Last Post: JmsNxn
  " tommy quaternion " tommy1729 13 3,086 03/23/2021, 01:21 PM
Last Post: tommy1729
  A different approach to the base-change method JmsNxn 0 445 03/17/2021, 11:15 PM
Last Post: JmsNxn
  A support for Andy's (P.Walker's) slog-matrix-method Gottfried 4 4,127 03/08/2021, 07:13 PM
Last Post: JmsNxn
  Doubts on the domains of Nixon's method. MphLee 1 620 03/02/2021, 10:43 PM
Last Post: JmsNxn
  My interpolation method [2020] tommy1729 1 2,200 02/20/2020, 08:40 PM
Last Post: tommy1729
  Kneser method question tommy1729 9 8,285 02/11/2020, 01:26 AM
Last Post: sheldonison
  Half-iterates and periodic stuff , my mod method [2019] tommy1729 0 1,799 09/09/2019, 10:55 PM
Last Post: tommy1729



Users browsing this thread: 1 Guest(s)