On the approximation of functionals of very large Hermitian matrices represented as matrix product operators

MaRDI QIDQ2363890zbMATH OpenFDO

Authors Moritz August, Mari Carmen Bañuls, Thomas K. Huckle

Publication date 17 July 2017

Published in ETNA - Electronic Transactions on Numerical Analysis (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1610.06086, http://www.emis.de/journals/ETNA/volumes/2011-2020/vol46/abstract_vol46_pp215-232.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

algorithmGauss quadratureHermitian matricesLanczos methodmatrix product operatorsquantum physicstensor decompositions

Mathematics Subject Classification ID

Multilinear algebra, tensor calculus (15A69) Hermitian, skew-Hermitian, and related matrices (15B57) Algorithms for approximation of functions (65D15) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical computation of matrix exponential and similar matrix functions (65F60)

Abstract: We present a method to approximate functionals $extTr,f(A)$ of very high-dimensional hermitian matrices $A$ represented as Matrix Product Operators (MPOs). Our method is based on a reformulation of a block Lanczos algorithm in tensor network format. We state main properties of the method and show how to adapt the basic Lanczos algorithm to the tensor network formalism to allow for high-dimensional computations. Additionally, we give an analysis of the complexity of our method and provide numerical evidence that it yields good approximations of the entropy of density matrices represented by MPOs while being robust against truncations.

Recommendations

• Estimating the trace of matrix functions with application to complex networks
• Computing functions of very large matrices with small TT/QTT ranks by quadrature formulas
• The e-MoM approach for approximating matrix functionals
• Enhanced matrix function approximation
• Matrices, moments, and rational quadrature

Cited in

(5)

• Preconditioned TBiCOR and TCORS algorithms for solving the Sylvester tensor equation
• Iterative Tikhonov regularization of tensor equations based on the Arnoldi process and some of its generalizations
• Estimation of the bilinear form y^ f(A)x for Hermitian matrices
• Entries of continuous functions of large Hermitian tridiagonal 2-Toeplitz matrices
• Low-rank representation of tensor network operators with long-range pairwise interactions

This page was built for publication: On the approximation of functionals of very large Hermitian matrices represented as matrix product operators

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2363890)