• 2 Vote(s) - 5 Average
• 1
• 2
• 3
• 4
• 5
 Simple method for half iterate NOT based on a fixpoint. tommy1729 Ultimate Fellow     Posts: 1,491 Threads: 355 Joined: Feb 2009 04/30/2013, 01:04 AM Simple method for the half iterate of a taylor series. if g: R -> R x>0 => g(x) > x x,y>0 => g(x+y) > g(x) g is entire. To find f(f(x)) = g(x) Consider g(x) = g0 + g1 x + g2 x^2 + g3 x^3 + ... ( hence g(0) = g0 ) Define f(x) = f0 + f1 x + f2 x^2 + f3 x^3 + ... Now use D^n g(0) = D^n f(f(0)) = n! gn ( this follows from taylor's theorem and the chain rule ) We get g(0) = f(f(0)) = f(f0) = g0 g'(0) = f'(f(0)) f'(0) = f'(f0) f'(0) = g1 pick f0 with 0 < f0 < g0. Now pick an analytic function t(x) such that t(f^(n)(f0)) = f^(n)(0). We arrive at the set of equations : g^(1)(0) = f^(1)(f0) t(f^1(f0)) = g1 which can be solved. Now use the solutions of D^(n-1) g(0) = D^(n-1) f(f(0)) = (n-1)! g(n-1) together with t(x) to solve D^n g(0) = D^n f(f(0)) = n! gn. This is always possible because there are exactly 2 new variables in the n th equation relative to the n-1 th equation who are f^(n)(0) and f^(n)(f0) and by using t(x) we get only 1 new variable per equation. So there is no more a degree of freedom ! Doing so gives us by induction (and the lack of free parameters aka degrees of freedom) all values f^(n)(0) hence we get the values fn. As was desired. f(x) = f0 + f1 x + f2 x^2 + f3 x^3 + ... is now the unique solution based on picking f0 and t(x) assuming t(x) is picked *wisely*. By wisely it is meant that 1) All solution fn are real 2) There are NO branches too choose when we solve for the new variable in each step from equation n-1 to equation n. Note that if for all n : gn > 0 (*) => fn > 0. ( * = COND 1 ) If that is the case we can repeat the procedure to find g^[1/4](x) or equivalently f^[1/2]. HOWEVER it is not certain if the SAME t(x) can be used again. Notice a similar method will probably work finding g^[1/3](x). (with a t1(x) AND t2(x) to remove 2 degrees of freedom) Also note that COND 1 easily gives a method for g^[1/2^m] for integer m. Notice that for a real z : 0

 Possibly Related Threads... Thread Author Replies Views Last Post Tommy's Gaussian method. tommy1729 24 3,893 11/11/2021, 12:58 AM Last Post: JmsNxn The Generalized Gaussian Method (GGM) tommy1729 2 370 10/28/2021, 12:07 PM Last Post: tommy1729 Arguments for the beta method not being Kneser's method JmsNxn 54 6,524 10/23/2021, 03:13 AM Last Post: sheldonison tommy's singularity theorem and connection to kneser and gaussian method tommy1729 2 472 09/20/2021, 04:29 AM Last Post: JmsNxn Why the beta-method is non-zero in the upper half plane JmsNxn 0 328 09/01/2021, 01:57 AM Last Post: JmsNxn Improved infinite composition method tommy1729 5 1,242 07/10/2021, 04:07 AM Last Post: JmsNxn A different approach to the base-change method JmsNxn 0 718 03/17/2021, 11:15 PM Last Post: JmsNxn A support for Andy's (P.Walker's) slog-matrix-method Gottfried 4 4,776 03/08/2021, 07:13 PM Last Post: JmsNxn Doubts on the domains of Nixon's method. MphLee 1 1,005 03/02/2021, 10:43 PM Last Post: JmsNxn Nixon-Banach-Lambert-Raes tetration is analytic , simple and “ closed form “ !! tommy1729 11 3,920 02/04/2021, 03:47 AM Last Post: JmsNxn

Users browsing this thread: 1 Guest(s)