• 0 Vote(s) - 0 Average
• 1
• 2
• 3
• 4
• 5
 Iteration basics Ivars Long Time Fellow    Posts: 366 Threads: 26 Joined: Oct 2007 05/24/2008, 08:35 AM bo198214 Wrote:The Abel function counts the iterations of : . The fact that Abel function extends COUNTING to non-integer , negative(?) and complex values of COUNTING is very interesting concept besides the fact it is useful in computations and analysis of iterates. . e.g. . If we turn it upside down, we can may be use the result of t iterations of a function to define what COUNTING with t (e.g. t=I) means. We may get functions which are only COUNTABLE in certain ways, so that Abel equation is not possible to solve for all t. Would that make sense? Ivars bo198214 Administrator Posts: 1,389 Threads: 90 Joined: Aug 2007 05/24/2008, 09:04 AM Ivars Wrote:. If we turn it upside down, we can may be use the result of t iterations of a function to define what COUNTING with t (e.g. t=I) means. Ivars, we do exactly that! How do you think we compute ? I wrote it already bo198214 Wrote:The equation is of course easily applicable to complex nothing needs to be changed just keep the law for complex too. E.g. .in this previous post But btw this give no clue about what x[I]y is. Gottfried Ultimate Fellow     Posts: 767 Threads: 119 Joined: Aug 2007 05/24/2008, 09:47 AM (This post was last modified: 05/24/2008, 09:52 AM by Gottfried.) Ivars Wrote:. e.g. . If we turn it upside down, we can may be use the result of t iterations of a function to define what COUNTING with t (e.g. t=I) means. We may get functions which are only COUNTABLE in certain ways, so that Abel equation is not possible to solve for all t. Would that make sense? Ivars Just some speculation: if we assume the divergent summation 1+3+9+...+3^k+... = 1/(1-3) = -1/2 applicable everywhere in the context of powerseries, then we may also assume x^(1+3+9+...) = x*x^3*x^9*... = x^(-1/2) and for iteration ...f°9(f°3(f(x))) = f°(1+3+9+...)(x) = f°(-1/2)(x) :cool: Then we may take another series in the iterator; I don't remember at the moment which, but I think, there are some divergent series of rational or even integer summands, for whose value the replacement by I makes sense/is consistent. Then we had the same way ... f°c(f°b(f°a(x))) = f°(a+b+c+...)(x) = f°I(x) But don't know, whether this makes sense ... Gottfried Helms, Kassel Ivars Long Time Fellow    Posts: 366 Threads: 26 Joined: Oct 2007 05/24/2008, 07:12 PM (This post was last modified: 05/24/2008, 07:17 PM by Ivars.) Gottfried Wrote:Just some speculation: Then we may take another series in the iterator; I don't remember at the moment which, but I think, there are some divergent series of rational or even integer summands, for whose value the replacement by I makes sense/is consistent. Then we had the same way ... f°c(f°b(f°a(x))) = f°(a+b+c+...)(x) = f°I(x) But don't know, whether this makes sense ... I have seen mentionings of so called Motzkin (first) and Shroder (second) divergent series having value : Also, Catalan numbers based divergent series turn out interesting complex value: It is all explained here: Divergent Series III However, I have not seen such series giving ? Perhaps there are. is significant enough, but would be a clear case to look at. These 3 sums are all located in lower half plane. Are there any in upper? What seems clear, that complex counting and combinatorics are related, although no one seems to know how. Ivars Ivars Long Time Fellow    Posts: 366 Threads: 26 Joined: Oct 2007 05/27/2008, 10:33 AM Please explain in the same simple nice way as "iteration" another much used term here in this thread: "Diagonalization" - I assume limited to relation to hyperoperations/function iterations. Thank You in advance, Ivars Gottfried Ultimate Fellow     Posts: 767 Threads: 119 Joined: Aug 2007 05/27/2008, 07:35 PM Ivars Wrote:Please explain in the same simple nice way as "iteration" another much used term here in this thread: "Diagonalization" - I assume limited to relation to hyperoperations/function iterations. Thank You in advance, Ivars Hi Ivars - HTH Gottfried Attached Files Intro_in_Diagonalization.pdf (Size: 64.69 KB / Downloads: 344) Gottfried Helms, Kassel Ivars Long Time Fellow    Posts: 366 Threads: 26 Joined: Oct 2007 05/30/2008, 06:08 AM Thanks, Gottfried, I tried to summarize my understanding: If a Taylor series of a function f is a result of diagnolization of some infinite 2D matrix M and it has a matrix inverse M^-1 in the domain (or sub) of function f then continuous iterates of f can be calculated by using these matrixes. Would that mean that e.g. for a function whose iterates are 2D (like complex t=u+iv=t(u,v)) or generally n arguments, similar operation can be done via 3D and n+1 D matrixes? Or in this case one diagonal can not represent a function? Ivars Xorter Fellow   Posts: 93 Threads: 30 Joined: Aug 2016 01/02/2017, 05:21 PM I might be a little bit late, but I have an idea. What if I say, we just need to know the so-called nth iterate form? For example: (ax)^on = a^n x Therefor: (e^pi x)^oi = -x Another samples: (ax+b)^on = a^n x + sum 0 to n-1 a^k (1÷x)^on = x^((-1)^n) (x^a)^on = x^(a^n) ... etc. If you need more form, just ask me. So, we just need to subtitute i into the form, right? But unfortunately, I do not know what we should do if the function is more complex. Xorter Unizo « Next Oldest | Next Newest »

 Possibly Related Threads... Thread Author Replies Views Last Post Iteration series: Different fixpoints and iteration series (of an example polynomial) Gottfried 0 3,279 09/04/2011, 05:59 AM Last Post: Gottfried Fractional iteration of x^2+1 at infinity and fractional iteration of exp bo198214 10 19,100 06/09/2011, 05:56 AM Last Post: bo198214 Hyperoperators [n] basics for large n dyitto 9 10,670 03/12/2011, 10:19 PM Last Post: dyitto

Users browsing this thread: 1 Guest(s) 