Transfer-matrix method

From Wikipedia, the free encyclopedia

The transfer-matrix method is a general technique for solving problems in statistical mechanics.

The basic idea is to write the partition function in the form

\mathcal{Z} = \mathbf{v}_{0} \cdot \left\{ \prod_{k=1}^{N} \mathbf{W}_{k} \right\} \cdot \mathbf{v}_{N+1}

where v0 and vN are vectors of dimension p and the pxp matrices Wk are the so-called transfer matrices. In some cases, particularly for cyclic systems, the partition function may be written more simply as

\mathcal{Z} = \mathrm{tr} \left\{ \prod_{k=1}^{N} \mathbf{W}_{k} \right\}

where "tr" denotes the matrix trace. In either case, the partition function may be solved exactly using eigenanalysis. If the matrices are all the same matrix W, the partition function may be approximated as the N power of the largest eigenvalue of W, since the trace is the sum of the eigenvalues and the eigenvalues of the product of two diagonal matrices equals the product of their individual eigenvalues.

The transfer-matrix method is used when the total system can be broken into a sequence of subsystems that interact only with adjacent subsystems. For example, a three-dimensional cubical lattice of spins in an Ising model can be decomposed into a sequence of two-dimensional planar lattices of spins that interact only adjacently. The dimension p of the pxp transfer matrix equals the number of states the subsystem may have; the transfer matrix itself Wk encodes the statistical weight associated with a particular state of subsystem k-1 being next to another state of subsystem k.

Transfer-matrix methods have been critical for many exact solutions of problems in statistical mechanics, including the Zimm-Bragg and Lifson-Roig models of the helix-coil transition, as well as the two-dimensional Ising model solution that won immortality for Lars Onsager.


 This physics-related article is a stub. You can help Wikipedia by expanding it.
Retrieved from "http://en.wikipedia.org../../../t/r/a/Transfer-matrix_method.html"