Is there any ways to compute iterations of a oscillating function ?
#1
So we all know we can use fixed point to calculate iterations. Functions that converge to a real value, then using Schroeder's equation to compute it.
But, when the function converges to a oscillating pattern? When the upper limit and downwards limit converges, and it keeps oscillating between the 2 (like for \({^x}a\) when \(a\) is between \(0\) and \(e^{-e}\)), is there a way, an equation to compute it?

The only way I've found to do so, is with function that converge into the negative iterations and oscillates in the positive (or vice versa if you use the inverse function). You compute it on the converging side, then apply the inverse function, but it's kinda cheating...
Regards

Shanghai46
Reply
#2
The best way is to converge on the function could be using a oscillating diagram or by tetrating the limit and the maximum of the equation until it's over.
Reply
#3
(10/15/2023, 12:47 AM)leon Wrote: The best way is to converge on the function could be using a oscillating diagram or by tetrating the limit and the maximum of the equation until it's over.

Ummmm......What?
Regards

Shanghai46
Reply
#4
One way is using sin or cos 


For instance 

https://tetrationforum.org/showthread.php?tid=1622

Bo and Leo and others went into this in various places.


regards

tommy1729
Reply
#5
(10/15/2023, 11:17 PM)tommy1729 Wrote: One way is using sin or cos 


For instance 

https://tetrationforum.org/showthread.php?tid=1622

Bo and Leo and others went into this in various places.


regards

tommy1729

btw , the links are dead but just paste the (thread identifation numbers) tid numbers and you can get there !

( because the name of the domain changed )


regards

tommy1729
Reply
#6
(10/15/2023, 08:03 PM)Shanghai46 Wrote:
(10/15/2023, 12:47 AM)leon Wrote: The best way is to converge on the function could be using a oscillating diagram or by tetrating the limit and the maximum of the equation until it's over.

Ummmm......What?

An oscillating diagram is a diagram that rough computes for you on both negative and positive and in-between so you don't even have to use it just plug in the numbers. An oscillating function changes from pos to neg if numbers are big enough so it's iterations will always have sign this means you can compute iterations by taking the maximum going backwards etc

Sorry if I was unclear
Reply


Possibly Related Threads…
Thread Author Replies Views Last Post
  Anyone have any ideas on how to generate this function? JmsNxn 3 1,628 05/21/2023, 03:30 PM
Last Post: Ember Edison
  [MSE] Mick's function Caleb 1 1,144 03/08/2023, 02:33 AM
Last Post: Caleb
  [special] binary partition zeta function tommy1729 1 904 02/27/2023, 01:23 PM
Last Post: tommy1729
  [NT] Extending a Jacobi function using Riemann Surfaces JmsNxn 2 1,532 02/26/2023, 08:22 PM
Last Post: tommy1729
  digit extracting iterations tommy1729 0 623 02/05/2023, 11:08 PM
Last Post: tommy1729
  toy zeta function tommy1729 0 739 01/20/2023, 11:02 PM
Last Post: tommy1729
  geometric function theory ideas tommy1729 0 800 12/31/2022, 12:19 AM
Last Post: tommy1729
  Iterated function convergence Daniel 1 1,273 12/18/2022, 01:40 AM
Last Post: JmsNxn
  Qs on extension of continuous iterations from analytic functs to non-analytic Leo.W 18 9,924 09/18/2022, 09:37 PM
Last Post: tommy1729
  Fibonacci as iteration of fractional linear function bo198214 48 24,743 09/14/2022, 08:05 AM
Last Post: Gottfried



Users browsing this thread: 1 Guest(s)