• 0 Vote(s) - 0 Average
• 1
• 2
• 3
• 4
• 5
 Matrix Operator Method bo198214 Administrator Posts: 1,386 Threads: 90 Joined: Aug 2007 04/25/2008, 03:39 PM Gottfried Wrote:The symbolic eigensystem-decomposition is enormous resources-consuming and also not yet well documented and verified in a general manner. Here I propose a completely elementary (while still matrix-based) way to arrive at the same result as by eigensystem-analysis. ---------------------------------------------------- As you might recall from my "continuous iteration" article I've found a matrix representation for the coefficients of the powerseries for the U-tetration $\hspace{24} U_t^{^oh}(x)$, where $U_t(x)= U_t^{^o1}(x) = t^x - 1$. Gottfried, as long as you deal with functions with fixed point at 0, for example $b^x-1$ or $xb^x$ there is no need to apply the Diagonalization method in its full generality. Note, that I would like to change the name from matrix operator method to diagonalization method, as this is more specific (for example Walker uses the name "matrix method" for his natural Abel method). For the case of a fixed point at 0, we can use the ordinary formulas of regular iteration. You know there are two cases, first $f'(0)=1$ (which Daniel Geisler calls parabolic) and $0 or $f'(0)>1$ (which Daniel Geisler calls hyperbolic, however I am not really happy with those names, because where is the elliptic case? Is this $0 in opposite to the $f'(0)>1$ which we then would call "properly hyperbolic". Also the hyperbolic and elliptic cases (in the just mentioned sense) exchange by using $f^{-1}$ and hence can be treated quite similarly. This is not the case for hyperbolas and ellipses.) The formula for the parabolic iteration was already mentioned on this forum under the name double binomial formula. The formula for hyperbolic iteration (or elliptic iteration) can be derived from the fact that $f^{\circ t}\circ f=f\circ f^{\circ t}$ and by the regularity condition: $(f^{\circ t})'(0)=(f'(0))^t$ For abbreviation let $g:=f^{\circ t}$, then the first equation can be written as $g_n (f^n)_n + \sum_{m=1}^{n-1} g_m (f^m)_n = f_1 g_n + \sum_{m=2}^n f_m (g^m)_n$ where $f^n$ means the $n$th power, by the subscript index $i$ we denote the $i$th coefficients of the indexed powerseries. We can rearrange the above formula to get a recurrence relation for the coefficients of $g$: $g_n = \frac{1}{(f_1)^n-f_1}\left( f_n (g_1)^n - g_1 f_n + \sum_{m=2}^{n-1} (f_m (g^m)_n - g_m (f^m)_n) \right)$ the only undetermined coefficient is now $g_1$ but we know already that we set $g_1=f_1^t$. The coefficient $(f^m)_n$ is the entry at the m-th row and the n-th column of the Carleman matrix of $f$. We see that in the above formula also the term $(g^m)_n$ occurs though we dont know all the coefficients of $g$ yet, however we have the power formula: $\left(f^p\right)_n=\sum_{ p_1+\dots+p_n=p\\ 1p_1+\dots+np_n=n\\ p_1,\dots,p_n\ge 0 } \frac{p!}{p_1!\dots p_n!} (f_1)^{p_1}\dots (f_{n})^{p_n}$ and see that in $(f^p)_n$ the biggest index taken at $f$ that can occur is $n$. However $p_n$, the exponent of $f_n$, can be bigger than 0 only in the case $p_n=1$ (second line below the sum) and all other $p_i=0$. This however can only happen for $p=1$ (first line below the sum). This case is excluded in $(g^m)_n$ because $m\ge 2$ and so we have indeed a recurrence formula which gives a polynomial in $g_1=f_1^t$ for $g_n$. You see, we not even have to solve a linear equation system for using the diagonalization method on a fixed point at 0. « Next Oldest | Next Newest »

 Messages In This Thread Matrix Operator Method - by Gottfried - 08/12/2007, 08:08 PM RE: Matrix Operator Method - by bo198214 - 08/13/2007, 04:15 AM RE: Matrix Operator Method - by jaydfox - 08/13/2007, 05:40 AM RE: Matrix Operator Method - by Gottfried - 08/13/2007, 09:22 AM RE: Matrix Operator Method - by bo198214 - 08/14/2007, 03:43 PM RE: Matrix Operator Method - by Gottfried - 08/14/2007, 04:15 PM RE: Matrix Operator Method - by bo198214 - 08/26/2007, 12:18 AM RE: Matrix Operator Method - by Gottfried - 08/26/2007, 11:24 AM RE: Matrix Operator Method - by bo198214 - 08/26/2007, 11:39 AM RE: Matrix Operator Method - by Gottfried - 08/26/2007, 04:22 PM RE: Matrix Operator Method - by Gottfried - 08/26/2007, 10:54 PM RE: Matrix Operator Method - by bo198214 - 08/27/2007, 08:29 AM RE: Matrix Operator Method - by Gottfried - 08/27/2007, 11:04 AM RE: Matrix Operator Method - by bo198214 - 08/27/2007, 11:35 AM RE: Matrix Operator Method - by Gottfried - 08/27/2007, 11:58 AM RE: Matrix Operator Method - by bo198214 - 08/27/2007, 12:13 PM RE: Matrix Operator Method - by Gottfried - 08/27/2007, 01:19 PM RE: Matrix Operator Method - by Gottfried - 08/27/2007, 02:29 PM RE: Matrix Operator Method - by bo198214 - 08/27/2007, 02:36 PM RE: Matrix Operator Method - by Gottfried - 08/27/2007, 03:09 PM RE: Matrix Operator Method - by bo198214 - 08/27/2007, 07:15 PM RE: Matrix Operator Method - by Gottfried - 08/27/2007, 08:15 PM RE: Matrix Operator Method - by bo198214 - 08/29/2007, 05:28 PM RE: Matrix Operator Method - by Gottfried - 08/27/2007, 12:43 PM RE: Matrix Operator Method - by Gottfried - 10/08/2007, 12:11 PM RE: Matrix Operator Method - by Gottfried - 10/14/2007, 09:32 PM RE: Matrix Operator Method - by Gottfried - 04/04/2008, 09:41 AM RE: Matrix Operator Method - by Gottfried - 04/17/2008, 09:21 PM RE: Matrix Operator Method - by bo198214 - 04/25/2008, 03:39 PM RE: Matrix Operator Method - by Gottfried - 04/26/2008, 06:09 PM RE: Matrix Operator Method - by bo198214 - 04/26/2008, 06:47 PM RE: Matrix Operator Method - by Gottfried - 04/18/2008, 01:55 PM RE: Matrix Operator Method - by Gottfried - 07/08/2008, 06:46 AM Diagonalization for dxp/basic facts/Pari-routine - by Gottfried - 08/08/2008, 01:12 PM Exact entries for T-tetration Bell-matrix - by Gottfried - 09/24/2008, 08:22 PM RE: Exact entries for T-tetration Bell-matrix - by bo198214 - 09/26/2008, 07:30 AM RE: Exact entries for T-tetration Bell-matrix - by Gottfried - 09/26/2008, 09:56 AM

 Possibly Related Threads... Thread Author Replies Views Last Post Half-iterates and periodic stuff , my mod method [2019] tommy1729 0 74 09/09/2019, 10:55 PM Last Post: tommy1729 A fundamental flaw of an operator who's super operator is addition JmsNxn 4 6,175 06/23/2019, 08:19 PM Last Post: Chenjesu Tetration and Sign operator tetration101 0 241 05/15/2019, 07:55 PM Last Post: tetration101 2 fixpoints , 1 period --> method of iteration series tommy1729 0 1,265 12/21/2016, 01:27 PM Last Post: tommy1729 Tommy's matrix method for superlogarithm. tommy1729 0 1,466 05/07/2016, 12:28 PM Last Post: tommy1729 [split] Understanding Kneser Riemann method andydude 7 7,082 01/13/2016, 10:58 PM Last Post: sheldonison [2015] New zeration and matrix log ? tommy1729 1 2,875 03/24/2015, 07:07 AM Last Post: marraco Kouznetsov-Tommy-Cauchy method tommy1729 0 1,867 02/18/2015, 07:05 PM Last Post: tommy1729 Problem with cauchy method ? tommy1729 0 1,703 02/16/2015, 01:51 AM Last Post: tommy1729 Regular iteration using matrix-Jordan-form Gottfried 7 7,864 09/29/2014, 11:39 PM Last Post: Gottfried

Users browsing this thread: 1 Guest(s)