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

Annals of Physics

Higher-order calculations in the real space dynamic renormalization group: One dimension

James H. Luscombe, Gene F. Mazenko

Published Mar 1, 1983• 5 citations
Publisher
DOI
10.1016/0003-4916(83)90056-8

Related papers

Higher order calculations in the real space dynamic renormalization group: One dimension

James Franck Institute

Annals of Physics•Feb 1, 1983•0 citations

高精度テンソル繰り込み群法とその応用

Adachi, Daiki

High-accuracy tensor renormalization group algorithms and their applications (高精度テンソル繰り込み群法とその応用) 氏 名 足立 大樹We propose novel real-space renormalization group algorithms for classical and quantum lattice models.Conventionally, the tensor renormalization group (TRG) algorithm proposed by Levin and Nave in 2007 and the higher-order tensor renormalization group (HOTRG) algorithm proposed by Xie et al. in 2012 have been widely used as efficient numerical renormalization methods to study large-scale classical and quantum spin systems.The accuracy of the tensor network algorithms is generally controlled by the bond dimension χ, which is the cutoff of tensor indices.With a fixed bond dimension χ, TRG can renormalize the two-dimensional squarelattice tensor network within O ( χ 5 ) computational time.However, it is difficult to apply the TRG algorithm to models in three or higher dimensions.On the other hand, HOTRG can be applied, at least in principle, to higher-dimensional models, and it has a higher accuracy than TRG when comparing with the same bond dimension, while the computational cost of O ( χ 4d-1 ) for d-dimensional models is higher than TRG even in two dimensions and too high to execute simulations for higher-dimensional models in practice.New algorithms that can perform the real-space renormalization in general dimensions with a reasonable cost are strongly demanded.

•Mar 23, 2020•0 citations

The Real Space Dynamic Renormalization Group

Gene F. Mazenko, Oriol T. Valls

Topics in current physics•Jan 1, 1982•3 citations

Real Space Renormalization Group

A. J. Berlinsky, Amanda Harris

Graduate texts in physics•Jan 1, 2019•4 citations

A real-space renormalization group for site and bond percolation

PETER J. REYNOLDS, Eugene Stanley, W. Klein

A real-space renormalization group is developed which renormalizes probabilities directly in the percolation problem. An exact transformation is given in one dimension, and a cluster approach is presented for other lattices. The results are in excellent agreement with series calculations for the critical percolation concentration p c (both site and bond), and in good agreement for the correlation length exponent nu p . Additionally, in one dimension, a field-like variable is included and the remaining exponents are calculated.

Journal of Physics C Solid State Physics•Apr 28, 1977•270 citations

Three-dimensional real space renormalization group with well-controlled approximations

Anonymous

Physical review. E•May 12, 2025•0 citations
High-accuracy tensor renormalization group algorithms and their applications (高精度テンソル繰り込み群法とその応用) 氏 名 足立 大樹We propose novel real-space renormalization group algorithms for classical and quantum lattice models.Conventionally, the tensor renormalization group (TRG) algorithm proposed by Levin and Nave in 2007 and the higher-order tensor renormalization group (HOTRG) algorithm proposed by Xie et al. in 2012 have been widely used as efficient numerical renormalization methods to study large-scale classical and quantum spin systems.The accuracy of the tensor network algorithms is generally controlled by the bond dimension χ, which is the cutoff of tensor indices.With a fixed bond dimension χ, TRG can renormalize the two-dimensional squarelattice tensor network within O ( χ 5 ) computational time.However, it is difficult to apply the TRG algorithm to models in three or higher dimensions.On the other hand, HOTRG can be applied, at least in principle, to higher-dimensional models, and it has a higher accuracy than TRG when comparing with the same bond dimension, while the computational cost of O ( χ 4d-1 ) for d-dimensional models is higher than TRG even in two dimensions and too high to execute simulations for higher-dimensional models in practice.New algorithms that can perform the real-space renormalization in general dimensions with a reasonable cost are strongly demanded.
A real-space renormalization group is developed which renormalizes probabilities directly in the percolation problem. An exact transformation is given in one dimension, and a cluster approach is presented for other lattices. The results are in excellent agreement with series calculations for the critical percolation concentration p c (both site and bond), and in good agreement for the correlation length exponent nu p . Additionally, in one dimension, a field-like variable is included and the remaining exponents are calculated.