pith. sign in

arxiv: 1308.4911 · v1 · pith:IYWETH5Znew · submitted 2013-08-22 · ✦ hep-ph · physics.comp-ph

Compression algorithm for discrete light-cone quantization

classification ✦ hep-ph physics.comp-ph
keywords algorithmeigenvectorscompressiondiscretehamiltonianhamiltonianslight-conelongitudinal
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.