Approximate solutions for large transfer matrix problems

DOI10.1016/0021-9991(89)90228-3MaRDI QIDQ1122305zbMATH OpenOpenAlexFDO

Authors Norman H. Fuchs

Publication date 1989

Published in Journal of Computational Physics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0021-9991(89)90228-3

zbMATH Keywords

large transfer matrixlargest eigenvaluelattice modelspartition functionspower methodsparse eigenvectorssparse transfer matrixspin configuration

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Computational methods for sparse matrices (65F50) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)

Review text

In physical lattice models, one is interested in the largest eigenvalue and the corresponding eigenvector for a very large and extremely sparse transfer matrix. However, usually only a small number of the elements in the eigenvector are large, and only these large elements are relevant for the physical description of the model. In order to cut down dramatically the computational effort - as well as storage requirements - in the power method, a modified power method is developed which seeks to compute only the largest elements of the left and right eigenvectors. The idea is to use a sparse representation for the eigenvectors in which only a small fraction of the elements are actually stored, combined with a strategy to select these nonzero elements in such a way that no significant physical information in the model is lost. The such computed sparse eigenvectors are satisfactory in the sense that some physical quantities, such as spin configuration probabilities and partition functions, are determined with high accuracy. However, the corresponding eigenvalue (which describes the free energy) is not so accurate, basically because not all the information present in the sparse left and right eigenvectors are used to compute the eigenvector.

Recommendations

• Sparse matrix factorizations of transfer matrices
• A new Monte Carlo power method for the eigenvalue problem of transfer matrices
• An approximation method for eigenvectors of very large matrices
• A novel algorithm for calculation of the extreme eigenvalues of large Hermitian matrices
• POWEV: A subroutine package to evaluate eigenvalues and eigenvectors of large sparse matrices

Cites work

• Sparse matrix factorizations of transfer matrices
• Statistics of the Two-Dimensional Ferromagnet. Part I

Cited in

(4)

• A new Monte Carlo power method for the eigenvalue problem of transfer matrices
• Application of the transfer matrix method to lattice systems without translational invariance
• Sparse matrix factorizations of transfer matrices
• Fast randomized iteration: diffusion Monte Carlo through the Lens of numerical linear algebra

This page was built for publication: Approximate solutions for large transfer matrix problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1122305)