Transfer-matrix method

In statistical mechanics, the transfer-matrix method is a mathematical technique which is used to write the partition function into a simpler form. It was introduced in 1941 by Hans Kramers and Gregory Wannier.[1][2] In many one dimensional lattice models, the partition function is first written as an n-fold summation over each possible microstate, and also contains an additional summation of each component's contribution to the energy of the system within each microstate.

Overview

Higher dimensional models contain even more summations. For systems with more than a few particles, such expressions can quickly become too complex to work out directly, even by computer.

Instead, the partition function can be rewritten in an equivalent way. The basic idea is to write the partition function in the form

where v0 and vN+1 are vectors of dimension p and the p × p matrices Wk are the so-called transfer matrices. In some cases, particularly for systems with periodic boundary conditions, the partition function may be written more simply as

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 Nth 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 p × p 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.

As an example of observables that can be calculated from this method, the probability of a particular state occurring at position x is given by:

Where is the projection matrix for state , having elements

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, transfer matrix models for protein-DNA binding, as well as the famous exact solution of the two-dimensional Ising model by Lars Onsager.

gollark: No, it does, but you're dealing with untrusted input and need safety more than an extra millisecond.
gollark: Really, applicationy stuff should be done with... not C, so C can do what it's mildly okay at, weird low level stuff.
gollark: > perl
gollark: If you just create, say, a 32kB array for some input, but it's possible to send more than that and you don't check very carefully everywhere (because C string manipulation functions are horrible and so are C strings), then BUFFER OVERFLOW!
gollark: It does it in not wildly unsafe ways.

See also

References

  1. Kramers, H. A.; Wannier, G. H. (1941). "Statistics of the Two-Dimensional Ferromagnet. Part I". Physical Review. 60 (3): 252–262. Bibcode:1941PhRv...60..252K. doi:10.1103/PhysRev.60.252. ISSN 0031-899X.
  2. Kramers, H. A.; Wannier, G. H. (1941). "Statistics of the Two-Dimensional Ferromagnet. Part II". Physical Review. 60 (3): 263–276. doi:10.1103/PhysRev.60.263. ISSN 0031-899X.

Notes

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.