arXiv · 1308.4911
Compression algorithm for discrete light-cone quantization
Abstract
We adapt the compression algorithm of Weinstein, Auerbach, and Chandra from eigenvectors of spin lattice Hamiltonians to eigenvectors of light-front field-theoretic Hamiltonians. The latter are approximated by the standard discrete light-cone quantization technique, which provides a matrix representation of the Hamiltonian eigenvalue problem. The eigenvectors are represented as singular value decompositions of two-dimensional arrays, indexed by transverse and longitudinal momenta, and compressed by truncation of the decomposition. The Hamiltonian is represented by a rank-four tensor that is decomposed as a sum of contributions factorized into direct products of separate matrices for transverse and longitudinal interactions. The algorithm is applied to a model theory, to illustrate its use.
Explore related subjects
Keep this discovery
Xiao Pu, Sophia S. Chabysheva, John R. Hiller. 2013-08-22. Compression algorithm for discrete light-cone quantization. https://doi.org/10.1103/physreve.88.063302
Cite the original work for its findings. Save a collection to share your selection of sources.