Related papers: Efficient evaluation of AGP reduced density matric…
The Density Matrix Renormalization Group (DMRG) method is developed for application to realistic nuclear systems. Test results are reported for 24Mg.
Given in the title are two algorithms to compute the extreme eigenstate of a high-dimensional Hermitian matrix using the tensor train (TT) / matrix product states (MPS) representation. Both methods empower the traditional alternating…
We describe a low cost alternative to the standard variational DMRG (density matrix renormalization group) algorithm that is analogous to the combination of selected configuration interaction plus perturbation theory (SCI+PT). We denote the…
In this paper we focus on the solution of shifted quasiseparable systems and of more general parameter dependent matrix equations with quasiseparable representations. We propose an efficient algorithm exploiting the invariance of the…
This paper provides an accurate method to obtain the bidiagonal factorization of many generalized Pascal matrices, which in turn can be used to compute with high relative accuracy the eigenvalues, singular values and inverses of these…
We present an efficient stochastic algorithm for the recently introduced perturbative density matrix renormalization group (p-DMRG) method for large active spaces. The stochastic implementation bypasses the computational bottleneck involved…
Recovering underlying Directed Acyclic Graph (DAG) structures from observational data is highly challenging due to the combinatorial nature of the DAG-constrained optimization problem. Recently, DAG learning has been cast as a continuous…
We present an algorithm for low rank decomposition of tensors of any symmetry type, from fully asymmetric to fully symmetric. It recovers the decomposition one summand at a time via the higher-order power method. This approach is known to…
We reformulate the density matrix renormalization group method (DMRG) in terms of a single block, instead of the standard left and right blocks used in the construction of the superblock. This version of the DMRG, which we call the puncture…
We consider the computation of two normal forms for matrices over the univariate polynomials: the Popov form and the Hermite form. For matrices which are square and nonsingular, deterministic algorithms with satisfactory cost bounds are…
We study the dynamical density matrix renormalization group (DDMRG) and time-dependent density matrix renormalization group (td-DMRG) algorithms in the ab initio context, to compute dynamical correlation functions of correlated systems. We…
For the arbitrary-Lagrangian-Eulerian (ALE) calculations, the geometric information needs to be calculated at each time step due to the movement of mesh. To achieve the high-order spatial accuracy, a large number of matrix inversions are…
We show how to construct highly symmetric algorithms for matrix multiplication. In particular, we consider algorithms which decompose the matrix multiplication tensor into a sum of rank-1 tensors, where the decomposition itself consists of…
We study gradient compression methods to alleviate the communication bottleneck in data-parallel distributed optimization. Despite the significant attention received, current compression schemes either do not scale well or fail to achieve…
This paper provides a unified and detailed presentation of root-node style algebraic multigrid (AMG). Algebraic multigrid is a popular and effective iterative method for solving large, sparse linear systems that arise from discretizing…
A density-matrix renormalization group (DMRG) method for highly anisotropic two-dimensional systems is presented. The method consists in applying the usual DMRG in two steps. In the first step, a pure one dimensional calculation along the…
This paper introduces an efficient algorithm for finding the dominant generalized eigenvectors of a pair of symmetric matrices. Combining tools from approximation theory and convex optimization, we develop a simple scalable algorithm with…
We demonstrate how to parallelize the density matrix renormalization group (DMRG) algorithm in real space through a straightforward modification of serial DMRG. This makes it possible to apply at least an order of magnitude more…
We present a fast randomized algorithm that computes a low rank LU decomposition. Our algorithm uses random projections type techniques to efficiently compute a low rank approximation of large matrices. The randomized LU algorithm can be…
This paper investigates the problem of recovering hyperspectral (HS) images from single RGB images. To tackle such a severely ill-posed problem, we propose a physically-interpretable, compact, efficient, and end-to-end learning-based…