Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Cambridge University Press eBooks

Transfer matrix and diagonalisation of spin chains

Joseph Marie Thijssen

Published Mar 22, 2007• 0 citations
Publisher

Abstract

Introduction In Chapters 8 and 10 we studied methods for simulating classical systems consisting of many interacting degrees of freedom. In these methods, a sequence of system configurations is generated, and from this sequence averages of physical quantities, given as functions of the degrees of freedom (positions and momenta, or spins), can be determined. These quantities are called mechanical quantities, and the expressions of their expectation values are called mechanical averages . There exist, however, quantities that cannot be determined straightforwardly using these methods. These quantities include free energies and chemical potentials. The point is that these quantities are not given as a normalised average, which for mechanical quantities is replaced by an average over the configurations generated in the simulation. In the previous chapters we have seen that it is not straightforward to find free energies and chemical potentials using MC and MD methods (see Section 10.5). In this chapter we discuss a method which enables us to find free energies for lattice spin models with very high accuracy; this is the transfer matrix method . This method calculates the free energy of a model defined on a strip of finite width and infinite length directly in terms of the largest eigenvalue of a large matrix, the transfer matrix . This matrix contains essentially the Boltzmann weights for adding an extra row of spins to the strip. In Chapter 12 we shall see that the transfer matrix is the analogue of the time evolution operator in quantum mechanics.

DOI
10.1017/cbo9781139171397.013

Related papers

Numerical methods

Hidetoshi Nishimori, Gerardo Ortíz

Abstract This chapter introduces a few typical numerical methods used in modern studies of phase transitions and critical phenomena in spin systems. The first section describes the stochastic dynamics of a generic system with discrete degrees of freedom following the master equation. This section serves as a theoretical basis for the Monte Carlo method that includes the heat bath and Metropolis algorithms of configuration updates. Another useful numerical technique is the transfer matrix method, described in the last section, and which is applied for numerically exact evaluation of the free energy and related physical quantities.

Oxford University Press eBooks•Dec 2, 2010•1 citation

The transfer matrix

Julia M. Yeomans

Abstract The aim of this chapter is to describe how transfer matrices can be used to solve one-dimensional classical spin models. The idea is to write down the partition function in terms of a matrix, the transfer matrix. The thermodynamic properties of the model are then wholly described by the eigenspectrum of the matrix. In particular the free energy per spin in the thermodynamic limit depends only on the largest eigenvalue and the correlation length only on the two largest eigenvalues through simple formulae.

Oxford University Press eBooks•May 7, 1992•0 citations

Approximation method for spin-½ Ising models

S. Gartenhaus

An approximation for calculating the thermodynamic properties of spin-\textonehalf{} Ising models is described. The method is based on the formulation of Kramers and Wannier for the square lattice, and involves expressing the free energy in terms of the limiting maximum eigenvalue of a matrix sequence which represents the contribution from a single spin of the lattice. The application of this formulation to various two- and three-dimensional lattices shows that many of these are characterized by an identically structured matrix sequence with exactly two nonvanishing elements in each row and column. To explore the potential of using this similarity and its simplicity for analyzing Ising models we consider the two-dimensional square lattice in an external field and approximate the doubly infinite lattice by a semi-infinite one consisting of $n (\ensuremath{\le}10)$ infinitely long rows. Calculations are carried out and compared with (1) Onsager's formula for the free energy, (2) the Onsanger-Yang formula for the spontaneous magnetization, and (3) values calculated from series. Except for the region around the critical point where the correlation length exceeds $n$ lattice spacings, substantial agreement---to better than 12 places of decimals in some cases---is obtained. As an additional measure of the potential of this method, a value for the critical exponent $\ensuremath{\delta}$ is computed by the extrapolation of the magnetization along the critical isotherm. The result is found to be in excellent agreement with the known value for $\ensuremath{\delta}$.

Physical review. B, Condensed matter•Feb 1, 1983•10 citations

Classical statistical physics: One dimension

Jean Zinn‐Justin

This chapter, within the framework of classical statistical mechanics, discusses a family of models defined on one-dimensional lattices. It studies the simplest local examples: models that involve only interactions between nearest neighbours on the lattice. For such models, correlation functions can be calculated by a transfer matrix formalism. The chapter first describes some general properties of transfer matrices in one-dimensional models. This formalism is used to establish various properties of correlation functions, like the thermodynamic or infinite volume limit, the large-distance behaviour of the two-point correlation function, and introduces the very important concept of correlation length. Connected correlation functions, cumulants of the distribution, play a particularly important role. Indeed, these functions satisfy the cluster property, which characterizes their decay at large distance. The transfer matrix formalism is applied to the example of a Gaussian Boltzmann weight, which is studied in detail. The chapter calculates the partition function and correlation functions explicitly, and observes that , the correlation length diverges, making it possible to define a continuum limit. It shows that results of the continuum limit can be reproduced directly by solving a partial differential equation in which all traces of the initial lattice structure have disappeared. Finally, it exhibits a slightly more general class of models which share the same properties: divergent correlation length and continuum limit. Exercises are provided at the end of the chapter.

Oxford University Press eBooks•Jul 5, 2007•0 citations

Selected problems in lattice statistical mechanics

Yao-ban Chan

This thesis consists of an introduction and four chapters, with each chapter covering a different topic.In the introduction, we introduce the models that we study in the later chapters.In Chapter 2, we study corner transfer matrices as a method for generating series expansions in statistical mechanical models.This is based on the work of Baxter, whose CTM equations we re-derive in detail.We then propose two methods that utilise these CTM equations to derive series expansions.The first one is based on iterating through the equations sequentially.We ran this algorithm on the hard squares model and produced 48 series terms.The second method, based on the corner transfer matrix renormalization group method of Nishino and Okunishi, is much faster (though still exponential in time), but only currently works for numerical calculations.In Chapter 3, we apply the finite lattice method and our renormalization group corner transfer matrix method to the Ising model with second-nearest-neighbour interactions.In particular, we study the crossover exponent of the critical line near the pointThrough a scaling assumption, we predict this exponent to be 4 7 , which is supported by our numerical methods.We also estimate the location of the critical lines, and the critical exponent of the magnetization along the lower phase boundary.In Chapter 4, we study the problem of n-friendly directed lattice walks confined in a horizontal strip.We find the general transfer matrix for two walkers, and use this and a method of recurrences to calculate generating functions for certain specific cases via Padé approximants.Using generating function arguments, we then derive the generating function for the number of walks for two walkers in strips of width 3 and 4, three walkers in a strip of width 4, and p vicious walkers in strips of width 2p -1, 2p, and 2p + 1. Finally we generalise the model by introducing another parameter, called bandwidth.In Chapter 5, we study mean unknotting times, in a problem motivated by DNA entanglement.Firstly, we find the mean unknotting times for minimal embeddings of low-crossing knots.Then we look at generating random embeddings by using self-avoiding polygon trails (SAPTs).After proving Kesten's pattern theorem, we use it and the model of a walk on an n-cube to estimate that the mean unknotting time grows exponentially in the length of the SAPT.We try to find the growth constant by using the pivot algorithm to generate SAPTs, but the low-length behaviour of the mean unknotting time appears to follow a power law, leading us to believe that much longer trails are needed.• To my supervisors:-Tony, for looking after me from beginning to end (and after); -Ian, for looking after me at conferences among other things (and reading 230 pages while attending one); and-Andrew, for putting up with me knocking on his door every other day or so.• To my family:-My parents, for always supporting, feeding and housing me;-Yi-Shuen, for having someone to talk to and play games with;-Mandy, for providing entertainment; and last but not least, -Bilbo, for looking cute.• To inanimate objects:-Computer games, for keeping me sane;-Table tennis, for keeping me entertained, exercised and friend-ly at the same time; and-Piano, for giving me something else to do.

•Dec 1, 2005•3 citations

Transfer Matrix of the Two-dimensional Ising Model

Giuseppe Mussardo

Abstract This chapter deals with the exact solution of the two-dimensional Ising model as it is achieved through the transfer matrix formalism. It discusses the crucial role played by the commutative properties of the transfer matrices, which lead to a functional equation for their eigenvalues. The exact free energy of the Ising model and its critical point can be identified by means of the lowest eigenvalue. The chapter covers Baxter's approach, the Yang–Baxter equation and its relation to the Boltzmann weights, the R-matrix, and discusses activity away from the critical point, the six-vertex model, as well as functional equations and symmetries.

Oxford University Press eBooks•Mar 26, 2020•0 citations
Introduction In Chapters 8 and 10 we studied methods for simulating classical systems consisting of many interacting degrees of freedom. In these methods, a sequence of system configurations is generated, and from this sequence averages of physical quantities, given as functions of the degrees of freedom (positions and momenta, or spins), can be determined. These quantities are called mechanical quantities, and the expressions of their expectation values are called mechanical averages . There exist, however, quantities that cannot be determined straightforwardly using these methods. These quantities include free energies and chemical potentials. The point is that these quantities are not given as a normalised average, which for mechanical quantities is replaced by an average over the configurations generated in the simulation. In the previous chapters we have seen that it is not straightforward to find free energies and chemical potentials using MC and MD methods (see Section 10.5). In this chapter we discuss a method which enables us to find free energies for lattice spin models with very high accuracy; this is the transfer matrix method . This method calculates the free energy of a model defined on a strip of finite width and infinite length directly in terms of the largest eigenvalue of a large matrix, the transfer matrix . This matrix contains essentially the Boltzmann weights for adding an extra row of spins to the strip. In Chapter 12 we shall see that the transfer matrix is the analogue of the time evolution operator in quantum mechanics.
Abstract This chapter introduces a few typical numerical methods used in modern studies of phase transitions and critical phenomena in spin systems. The first section describes the stochastic dynamics of a generic system with discrete degrees of freedom following the master equation. This section serves as a theoretical basis for the Monte Carlo method that includes the heat bath and Metropolis algorithms of configuration updates. Another useful numerical technique is the transfer matrix method, described in the last section, and which is applied for numerically exact evaluation of the free energy and related physical quantities.
Abstract The aim of this chapter is to describe how transfer matrices can be used to solve one-dimensional classical spin models. The idea is to write down the partition function in terms of a matrix, the transfer matrix. The thermodynamic properties of the model are then wholly described by the eigenspectrum of the matrix. In particular the free energy per spin in the thermodynamic limit depends only on the largest eigenvalue and the correlation length only on the two largest eigenvalues through simple formulae.
An approximation for calculating the thermodynamic properties of spin-\textonehalf{} Ising models is described. The method is based on the formulation of Kramers and Wannier for the square lattice, and involves expressing the free energy in terms of the limiting maximum eigenvalue of a matrix sequence which represents the contribution from a single spin of the lattice. The application of this formulation to various two- and three-dimensional lattices shows that many of these are characterized by an identically structured matrix sequence with exactly two nonvanishing elements in each row and column. To explore the potential of using this similarity and its simplicity for analyzing Ising models we consider the two-dimensional square lattice in an external field and approximate the doubly infinite lattice by a semi-infinite one consisting of $n (\ensuremath{\le}10)$ infinitely long rows. Calculations are carried out and compared with (1) Onsager's formula for the free energy, (2) the Onsanger-Yang formula for the spontaneous magnetization, and (3) values calculated from series. Except for the region around the critical point where the correlation length exceeds nnn lattice spacings, substantial agreement---to better than 12 places of decimals in some cases---is obtained. As an additional measure of the potential of this method, a value for the critical exponent $\ensuremath{\delta}$ is computed by the extrapolation of the magnetization along the critical isotherm. The result is found to be in excellent agreement with the known value for $\ensuremath{\delta}$.
This chapter, within the framework of classical statistical mechanics, discusses a family of models defined on one-dimensional lattices. It studies the simplest local examples: models that involve only interactions between nearest neighbours on the lattice. For such models, correlation functions can be calculated by a transfer matrix formalism. The chapter first describes some general properties of transfer matrices in one-dimensional models. This formalism is used to establish various properties of correlation functions, like the thermodynamic or infinite volume limit, the large-distance behaviour of the two-point correlation function, and introduces the very important concept of correlation length. Connected correlation functions, cumulants of the distribution, play a particularly important role. Indeed, these functions satisfy the cluster property, which characterizes their decay at large distance. The transfer matrix formalism is applied to the example of a Gaussian Boltzmann weight, which is studied in detail. The chapter calculates the partition function and correlation functions explicitly, and observes that , the correlation length diverges, making it possible to define a continuum limit. It shows that results of the continuum limit can be reproduced directly by solving a partial differential equation in which all traces of the initial lattice structure have disappeared. Finally, it exhibits a slightly more general class of models which share the same properties: divergent correlation length and continuum limit. Exercises are provided at the end of the chapter.
This thesis consists of an introduction and four chapters, with each chapter covering a different topic.In the introduction, we introduce the models that we study in the later chapters.In Chapter 2, we study corner transfer matrices as a method for generating series expansions in statistical mechanical models.This is based on the work of Baxter, whose CTM equations we re-derive in detail.We then propose two methods that utilise these CTM equations to derive series expansions.The first one is based on iterating through the equations sequentially.We ran this algorithm on the hard squares model and produced 48 series terms.The second method, based on the corner transfer matrix renormalization group method of Nishino and Okunishi, is much faster (though still exponential in time), but only currently works for numerical calculations.In Chapter 3, we apply the finite lattice method and our renormalization group corner transfer matrix method to the Ising model with second-nearest-neighbour interactions.In particular, we study the crossover exponent of the critical line near the pointThrough a scaling assumption, we predict this exponent to be 4 7 , which is supported by our numerical methods.We also estimate the location of the critical lines, and the critical exponent of the magnetization along the lower phase boundary.In Chapter 4, we study the problem of n-friendly directed lattice walks confined in a horizontal strip.We find the general transfer matrix for two walkers, and use this and a method of recurrences to calculate generating functions for certain specific cases via Padé approximants.Using generating function arguments, we then derive the generating function for the number of walks for two walkers in strips of width 3 and 4, three walkers in a strip of width 4, and p vicious walkers in strips of width 2p -1, 2p, and 2p + 1. Finally we generalise the model by introducing another parameter, called bandwidth.In Chapter 5, we study mean unknotting times, in a problem motivated by DNA entanglement.Firstly, we find the mean unknotting times for minimal embeddings of low-crossing knots.Then we look at generating random embeddings by using self-avoiding polygon trails (SAPTs).After proving Kesten's pattern theorem, we use it and the model of a walk on an n-cube to estimate that the mean unknotting time grows exponentially in the length of the SAPT.We try to find the growth constant by using the pivot algorithm to generate SAPTs, but the low-length behaviour of the mean unknotting time appears to follow a power law, leading us to believe that much longer trails are needed.• To my supervisors:-Tony, for looking after me from beginning to end (and after); -Ian, for looking after me at conferences among other things (and reading 230 pages while attending one); and-Andrew, for putting up with me knocking on his door every other day or so.• To my family:-My parents, for always supporting, feeding and housing me;-Yi-Shuen, for having someone to talk to and play games with;-Mandy, for providing entertainment; and last but not least, -Bilbo, for looking cute.• To inanimate objects:-Computer games, for keeping me sane;-Table tennis, for keeping me entertained, exercised and friend-ly at the same time; and-Piano, for giving me something else to do.
Abstract This chapter deals with the exact solution of the two-dimensional Ising model as it is achieved through the transfer matrix formalism. It discusses the crucial role played by the commutative properties of the transfer matrices, which lead to a functional equation for their eigenvalues. The exact free energy of the Ising model and its critical point can be identified by means of the lowest eigenvalue. The chapter covers Baxter's approach, the Yang–Baxter equation and its relation to the Boltzmann weights, the R-matrix, and discusses activity away from the critical point, the six-vertex model, as well as functional equations and symmetries.