another infinite composition gaussian method clone
Yeah nothing huge to mention.
But just another to add to the list of gaussian method , beta method and similar methods.
we want f(s+1) = exp( t(s) * f(s) )
and t(s) strictly rises from 0 at s = -oo to 1 at s = + oo in a fast way.
The gaussian method had t(s) = (1 + erf(s))/2.
The beta has t(s) = 1/(1 + exp(-s)).
the incomplete gamma method had t(s) = 1/(1 + inc.gamma(-s))
etc
You get the idea.
So we want to construct a t(s).
We need something that looks like erf(s) or tanh(s)
Let c = 2/pi
Then such a candidate is the " special function " :
c tt(x)
where tt(x) is the " tommy tan " function ( which I invented many decades ago as a teenager, and somewhat inspired me to do math ... on the other hand I forgot about it mainly lol )
see here where my friend mick asks about the value c :
https://math.stackexchange.com/questions...r-frac-pi2
tt(x) = sum_(n>0) (-1)^[n+1] x^(2n-1) [(2n)! ln(2n)]^(-1)
or for the tex fans :
\[
tt(x) = \sum_{n>0} (-1)^{[n+1]} x^{2n-1} [(2n)! \ln(2n)]^{-1}\\
\]
( notice tt(-x) = - tt(x) )
then t(s) becomes (1 + c tt(s))/2.
NOTICE that c tt(s) is entire !
Now this function has been resurrected and given a life purpose , it might be nice to investigate its properties.
***
I have been thinking/dreaming about an addition function formula tt(a+b) = ... or an asymptotical addition formula.
But maybe that is just a dream not worth persuing.
***
( and ofcourse there are " fake function ideas " related to this but i have mentioned this already too often )
regards
tommy1729
Yeah nothing huge to mention.
But just another to add to the list of gaussian method , beta method and similar methods.
we want f(s+1) = exp( t(s) * f(s) )
and t(s) strictly rises from 0 at s = -oo to 1 at s = + oo in a fast way.
The gaussian method had t(s) = (1 + erf(s))/2.
The beta has t(s) = 1/(1 + exp(-s)).
the incomplete gamma method had t(s) = 1/(1 + inc.gamma(-s))
etc
You get the idea.
So we want to construct a t(s).
We need something that looks like erf(s) or tanh(s)
Let c = 2/pi
Then such a candidate is the " special function " :
c tt(x)
where tt(x) is the " tommy tan " function ( which I invented many decades ago as a teenager, and somewhat inspired me to do math ... on the other hand I forgot about it mainly lol )
see here where my friend mick asks about the value c :
https://math.stackexchange.com/questions...r-frac-pi2
tt(x) = sum_(n>0) (-1)^[n+1] x^(2n-1) [(2n)! ln(2n)]^(-1)
or for the tex fans :
\[
tt(x) = \sum_{n>0} (-1)^{[n+1]} x^{2n-1} [(2n)! \ln(2n)]^{-1}\\
\]
( notice tt(-x) = - tt(x) )
then t(s) becomes (1 + c tt(s))/2.
NOTICE that c tt(s) is entire !
Now this function has been resurrected and given a life purpose , it might be nice to investigate its properties.
***
I have been thinking/dreaming about an addition function formula tt(a+b) = ... or an asymptotical addition formula.
But maybe that is just a dream not worth persuing.
***
( and ofcourse there are " fake function ideas " related to this but i have mentioned this already too often )
regards
tommy1729
