A Parallel Computing Method for the Higher Order Tensor Renormalization Group
arXiv:2110.03607 · doi:10.1016/j.cpc.2022.108423
Abstract
In this paper, we propose a parallel computing method for the Higher Order Tensor Renormalization Group (HOTRG) applied to a -dimensional simple lattice model. Sequential computation of the HOTRG requires computational cost, where is bond dimension, in a step to contract indices of tensors. When we simply distribute elements of a local tensor to each process in parallel computing of the HOTRG, frequent communication between processes occurs. The simplest way to avoid such communication is to hold all the tensor elements in each process, however, it requires memory space. In the presented method, placement of a local tensor element to more than one process is accepted and sufficient local tensor elements are distributed to each process to avoid communication between processes during considering computation step. For the bottleneck part of computational cost, such distribution is achieved by distributing elements of two local tensors to processes according to one of the indices of each local tensor which are not contracted during considering computation. In the case of , computational cost in each process is reduced to and memory space requirement in each process is kept to be .
30 pages, 17 figures
References in corpus (1)
Cited by in corpus (5)
- Matrix product decomposition for two- and three-flavor Wilson fermions: Benchmark results in the lattice Gross-Neveu model at finite density
- Rotations, Negative Eigenvalues, and Newton Method in Tensor Network Renormalization Group
- Grassmann tensor renormalization group approach to -dimensional two-color lattice QCD at finite density
- Triad representation for the anisotropic tensor renormalization group in four dimensions
- Essential difference between 2D and 3D from the perspective of real-space renormalization group