171 research outputs found

    Reducing Memory Cost of Exact Diagonalization using Singular Value Decomposition

    Full text link
    We present a modified Lanczos algorithm to diagonalize lattice Hamiltonians with dramatically reduced memory requirements, {\em without restricting to variational ansatzes}. The lattice of size NN is partitioned into two subclusters. At each iteration the Lanczos vector is projected into two sets of nsvdn_{{\rm svd}} smaller subcluster vectors using singular value decomposition. For low entanglement entropy SeeS_{ee}, (satisfied by short range Hamiltonians), the truncation error is expected to vanish as exp(nsvd1/See)\exp(-n_{{\rm svd}}^{1/S_{ee}}). Convergence is tested for the Heisenberg model on Kagom\'e clusters of 24, 30 and 36 sites, with no lattice symmetries exploited, using less than 15GB of dynamical memory. Generalization of the Lanczos-SVD algorithm to multiple partitioning is discussed, and comparisons to other techniques are given.Comment: 7 pages, 8 figure

    Collaborative Hierarchical Sparse Modeling

    Full text link
    Sparse modeling is a powerful framework for data analysis and processing. Traditionally, encoding in this framework is done by solving an l_1-regularized linear regression problem, usually called Lasso. In this work we first combine the sparsity-inducing property of the Lasso model, at the individual feature level, with the block-sparsity property of the group Lasso model, where sparse groups of features are jointly encoded, obtaining a sparsity pattern hierarchically structured. This results in the hierarchical Lasso, which shows important practical modeling advantages. We then extend this approach to the collaborative case, where a set of simultaneously coded signals share the same sparsity pattern at the higher (group) level but not necessarily at the lower one. Signals then share the same active groups, or classes, but not necessarily the same active set. This is very well suited for applications such as source separation. An efficient optimization procedure, which guarantees convergence to the global optimum, is developed for these new models. The underlying presentation of the new framework and optimization approach is complemented with experimental examples and preliminary theoretical results.Comment: To appear in CISS 201

    Comments on worldsheet theories dual to free large N gauge theories

    Get PDF
    We continue to investigate properties of the worldsheet conformal field theories (CFTs) which are conjectured to be dual to free large N gauge theories, using the mapping of Feynman diagrams to the worldsheet suggested in hep-th/0504229. The modular invariance of these CFTs is shown to be built into the formalism. We show that correlation functions in these CFTs which are localized on subspaces of the moduli space may be interpreted as delta-function distributions, and that this can be consistent with a local worldsheet description given some constraints on the operator product expansion coefficients. We illustrate these features by a detailed analysis of a specific four-point function diagram. To reliably compute this correlator we use a novel perturbation scheme which involves an expansion in the large dimension of some operators.Comment: 43 pages, 16 figures, JHEP format. v2: added reference
    corecore