anisotropic tensor
Recently Published Documents


TOTAL DOCUMENTS

32
(FIVE YEARS 9)

H-INDEX

9
(FIVE YEARS 2)

2021 ◽  
Vol 2021 (03) ◽  
pp. 047
Author(s):  
Takashi Hiramatsu ◽  
Kai Murai ◽  
Ippei Obata ◽  
Shuichiro Yokoyama
Keyword(s):  

2021 ◽  
Vol 2021 (1) ◽  
Author(s):  
Shinichiro Akiyama ◽  
Yoshinobu Kuramashi ◽  
Takumi Yamashita ◽  
Yusuke Yoshimura

Abstract We analyze the chiral phase transition of the Nambu-Jona-Lasinio model in the cold and dense region on the lattice, developing the Grassmann version of the anisotropic tensor renormalization group algorithm. The model is formulated with the Kogut-Susskind fermion action. We use the chiral condensate as an order parameter to investigate the restoration of the chiral symmetry. The first-order chiral phase transition is clearly observed in the dense region at vanishing temperature with μ/T ∼ O(103) on a large volume of V = 10244. We also present the results for the equation of state.


2020 ◽  
Vol 102 (5) ◽  
Author(s):  
Daiki Adachi ◽  
Tsuyoshi Okubo ◽  
Synge Todo

2020 ◽  
Vol 2020 (1) ◽  
Author(s):  
Hideaki Oba

Abstract The bottleneck part of an anisotropic tensor renormalization group (ATRG) is a bond-swapping part that consists of a contraction of two tensors and a partial singular value decomposition of a matrix, and their computational costs are $O(\chi^{2d+1})$, where $\chi$ is the maximum bond dimension and $d$ is the dimensionality of the system. We propose an alternative method for the bond-swapping part and it scales with $O(\chi^{\max(d+3,7)})$, though the total cost of ATRG with the method remains $O(\chi^{2d+1})$. Moreover, the memory cost of the whole algorithm can be reduced from $O(\chi^{2d})$ to $O(\chi^{\max(d+1,6)})$. We examine ATRG with or without the proposed method in the 4D Ising model and find that the free energy density of the proposed algorithm is consistent with that of the original ATRG while the elapsed time is significantly reduced. We also compare the proposed algorithm with a higher-order tensor renormalization group (HOTRG) and find that the value of the free energy density of the proposed algorithm is lower than that of HOTRG in the fixed elapsed time.


2019 ◽  
Vol 16 (supp02) ◽  
pp. 1941001 ◽  
Author(s):  
Miguel Angel Javaloyes

We introduce the anisotropic tensor calculus, which is a way of handling tensors that depends on the direction remaining always in the same class. This means that the derivative of an anisotropic tensor is a tensor of the same type. As an application we show how to define derivations using anisotropic linear connections in a manifold. In particular, we show that the Chern connection of a Finsler metric can be interpreted as the Levi-Civita connection and we introduce the anisotropic curvature tensor. We also relate the concept of anisotropic connection with the classical concept of linear connections in the vertical bundle. Furthermore, we also introduce the concept of anisotropic Lie derivative.


2019 ◽  
Vol 40 (1) ◽  
pp. 285-321
Author(s):  
Christian Rieger ◽  
Holger Wendland

AbstractWe derive sampling inequalities for discrete point sets that are of anisotropic tensor product form. Such sampling inequalities can be used to prove convergence for arbitrary stable reconstruction processes. As usual in the context of high-dimensional problems, our sampling inequalities are expressed in terms of the number of data sites, i.e., the number of points in the sparse grid. To this end, new bounds on specific monotone sets and on the number of points in an anisotropic sparse grid are derived.


Author(s):  
Xin Jin ◽  
Xiaotong Wang ◽  
Qian Huang ◽  
Changqing Yang ◽  
Chengtao Yi ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document