Re: finding a symplectic recursion fixed point
- To: mathgroup at smc.vnet.net
- Subject: [mg112053] Re: finding a symplectic recursion fixed point
- From: Roger Bagula <roger.bagula at gmail.com>
- Date: Fri, 27 Aug 2010 04:07:40 -0400 (EDT)
- References: <i5065f$gha$1@smc.vnet.net> <i55gpk$2ck$1@smc.vnet.net>
This method has to be the hard way:
Clear[x, y, z, n, digits, a, b, s, g, a0]
(* SP(2) 3d map*)
digits = 50;
x[n_] := x[n] = -Log[Exp[y[n - 1] + z[n - 1]] + 1]
y[n_] := y[n] = y[n - 1]*Log[2*Cosh[x[n - 1]]]
z[n_] := z[n] = z[n - 1]*Log[2*Cosh[x[n - 1]]]
x[0] := -0.69; y[0] := -0.001; z[0] := -0.001;
a = Table[Point[N[{Re[x[n]], Re[y[n]], Re[z[n]]}]], {n, 0, digits}]
Show[Graphics3D[a]]
One Fixed point is:
{-Log[2],0,0}