MathGroup Archive 2010

[Date Index] [Thread Index] [Author Index]

Search the Archive

Re: finding a symplectic recursion fixed point


It might help to see the original Migdal-Kadanoff and the fixed point:
T = Exp[b0]*Exp[{{b1, -b1}, {-b1, b1}}];
T1 = Exp[b01]*Exp[{{b11, -b11}, {-b11, b11}}];
B = T.T - T1;
Flatten[Table[B[[i, j]] == 0, {i, 2}, {j, 2}]]
Solve[Flatten[Table[B[[i, j]] == 0, {i, 1}, {j, 2}]], {b01, b11}]
Solve[Flatten[Table[B[[i, j]] == 0, {i, 2}, {j, 1}]], {b01, b11}]
b1=Log[1+Sqrt[2]]/2
Source:
http://books.google.com/books?id=mcCyB3ewyeMC&pg=PA117&lpg=PA117&dq=migdal-kadanoff+recursion&source=bl&ots=WJMD1Oau3D&sig=3NdwgMgxMdNjgeic3Xj0c2x0fWc&hl=en&ei=DEV1TPigNofWtQP6l5ygDQ&sa=X&oi=book_result&ct=result&resnum=8&ved=0CDQQ6AEwBzgK#v=onepage&q=migdal-kadanoff%20recursion&f=false


  • Prev by Date: List of multiple elements
  • Next by Date: Re: scienceworld.wolfram.com
  • Previous by thread: finding a symplectic recursion fixed point
  • Next by thread: Re: finding a symplectic recursion fixed point