Low-Rank Representation of Tensor Network Operators with Long-Range Pairwise Interactions

DOI10.1137/19M1287067zbMath1467.65040arXiv1909.02206OpenAlexW3119717722MaRDI QIDQ5147990

Lin Lin, Yu Tong

Publication date: 29 January 2021

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1909.02206

zbMATH Keywords

fast multipole methodmatrix product operator\(\mathcal{H}\)-matrixhierarchical off-diagonal low-rankprojected entangled-pair operatorupper-triangular low-rank matrix

Mathematics Subject Classification ID

Multilinear algebra, tensor calculus (15A69) Matrix completion problems (15A83) Numerical methods for low-rank matrix approximation; matrix compression (65F55)

Related Items

An incremental singular value decomposition approach for large-scale spatially parallel \& distributed but temporally serial data -- applied to technical flows

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tensor-Train Decomposition
• A practical introduction to tensor networks: Matrix product states and projected entangled pair states
• Low-rank tensor structure of linear diffusion operators in the TT and QTT formats
• The density-matrix renormalization group in the age of matrix product states
• A sparse matrix arithmetic based on \({\mathfrak H}\)-matrices. I: Introduction to \({\mathfrak H}\)-matrices
• Construction and arithmetics of \(\mathcal H\)-matrices
• Hierarchical matrices based on a weak admissibility criterion
• Separable type representations of matrices and fast algorithms. Volume 2. Eigenvalue method
• An \(\mathcal O(N\log N)\) fast direct solver for partial hierarchically semi-separable matrices. With application to radial basis function interpolation
• On approximation of functions by exponential sums
• Exact matrix completion via convex optimization
• Dynamical Approximation by Hierarchical Tucker and Tensor-Train Tensors
• Two-Level QTT-Tucker Format for Optimized Tensor Calculus
• Matrix product operator representations
• A Singular Value Thresholding Algorithm for Matrix Completion
• Criticality, the Area Law, and the Computational Power of Projected Entangled Pair States
• Breaking the Curse of Dimensionality, Or How to Use SVD in Many Dimensions
• On the efficient computation of high-dimensional integrals and the approximation by exponential sums
• Numerical operator calculus in higher dimensions
• Solving Rank-Structured Sylvester and Lyapunov Equations
• Approximation of 1/x by exponential sums in [1, ∞)
• A bibliography on semiseparable matrices