Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

WORLD SCIENTIFIC eBooks

Concepts of Data-Sparse Tensor-Product Approximation in Many-Particle Modelling

Heinz‐Jürgen Flad, Wolfgang Hackbusch, Boris N. Khoromskij, Reinhold Schneider

Published Apr 1, 2010• 12 citations
Publisher

Abstract

We present concepts of data-sparse tensor approximations to the functions and operators arising in many-particle models of quantum chemistry. Our approach is based on the systematic use of structured tensor-product representations where the low-dimensional components are represented in hierarchical or wavelet based matrix formats. The modern methods of tensor-product approximation in higher dimensions are discussed with the focus on analytically based approaches. We give numerical illustrations which confirm the efficiency of tensor decomposition techniques in electronic structure calculations.

DOI
10.1142/9789812836021_0020

Related papers

Tensor product approximation with optimal rank in quantum chemistry

Sambasiva Rao Chinnamsetty, Mike Espig, Boris N. Khoromskij +2 more

Tensor product decompositions with optimal separation rank provide an interesting alternative to traditional Gaussian-type basis functions in electronic structure calculations. We discuss various applications for a new compression algorithm, based on the Newton method, which provides for a given tensor the optimal tensor product or so-called best separable approximation for fixed Kronecker rank. In combination with a stable quadrature scheme for the Coulomb interaction, tensor product formats enable an efficient evaluation of Coulomb integrals. This is demonstrated by means of best separable approximations for the electron density and Hartree potential of small molecules, where individual components of the tensor product can be efficiently represented in a wavelet basis. We present a fairly detailed numerical analysis, which provides the basis for further improvements of this novel approach. Our results suggest a broad range of applications within density fitting schemes, which have been recently successfully applied in quantum chemistry.

The Journal of Chemical Physics•Aug 28, 2007•61 citations

Tensor product methods in numerical simulation of high-dimensional dynamical problems

Sergey Dolgov

Quantification of stochastic or quantum systems by a joint probability density or wave function is a notoriously difficult computational problem, since the solution depends on all possible states (or realizations) of the system. Due to this combinatorial flavor, even a system containing as few as ten particles may yield as many as $10^{10}$ discretized states. None of even modern supercomputers are capable to cope with this curse of dimensionality straightforwardly, when the amount of quantum particles, for example, grows up to more or less interesting order of hundreds. A traditional approach for a long time was to avoid models formulated in terms of probabilistic functions, and simulate particular system realizations in a randomized process. Since different times in different communities, data-sparse methods came into play. Generally, they aim to define all data points indirectly, by a map from a low amount of representers, and recast all operations (e.g. linear system solution) from the initial data to the effective parameters. The most advanced techniques can be applied (at least, tried) to any given array, and do not rely explicitly on its origin. The current work contributes further progress to this area in the particular direction: tensor product methods for separation of variables. The separation of variables has a long history, and is based on the following elementary concept: a function of many variables may be expanded as a product of univariate functions. On the discrete level, a function is encoded by an array of its values, or a tensor. Therefore, instead of a huge initial array, the separation of variables allows to work with univariate factors with much less efforts. The dissertation contains a short overview of existing tensor representations: canonical PARAFAC, Hierarchical Tucker, Tensor Train (TT) formats, as well as the artificial tensorisation, resulting in the Quantized Tensor Train (QTT) approximation method. The contribution of the dissertation consists in both theoretical constructions and practical numerical algorithms for high-dimensional models, illustrated on the examples of the Fokker-Planck and the chemical master equations. Both arise from stochastic dynamical processes in multiconfigurational systems, and govern the evolution of the probability function in time. A special focus is put on time propagation schemes and their properties related to tensor product methods. We show that these applications yield large-scale systems of linear equations, and prove analytical separable representations of the involved functions and operators. We propose a new combined tensor format (QTT-Tucker), which descends from the TT format (hence TT algorithms may be generalized smoothly), but provides complexity reduction by an order of magnitude. We develop a robust iterative solution algorithm, constituting most advantageous properties of the classical iterative methods from numerical analysis and alternating density matrix renormalization group (DMRG) techniques from quantum physics. Numerical experiments confirm that the new method is preferable to DMRG algorithms. It is as fast as the simplest alternating schemes, but as reliable and accurate as the Krylov methods in linear algebra.

•Sep 8, 2014•12 citations

Tensor Numerical Methods in Quantum Chemistry

Venera Khoromskaia, Boris N. Khoromskij

The conventional numerical methods when applied to multidimensional problems suffer from the so-called "curse of dimensionality", that cannot be eliminated by using parallel architectures and high performance computing. The novel tensor numerical methods are based on a "smart" rank-structured tensor representation of the multivariate functions and operators discretized on Cartesian grids thus reducing solution of the multidimensional integral-differential equations to 1D calculations. We explain basic tensor formats and algorithms and show how the orthogonal Tucker tensor decomposition originating from chemometrics made a revolution in numerical analysis, relying on rigorous results from approximation theory. Benefits of tensor approach are demonstrated in ab-initio electronic structure calculations. Computation of the 3D convolution integrals for functions with multiple singularities is replaced by a sequence of 1D operations, thus enabling accurate MATLAB calculations on a laptop using 3D uniform tensor grids of the size up to 10 15 . Fast tensor-based Hartree-Fock solver, incorporating the grid-based low-rank factorization of the two-electron integrals, serves as a prerequisite for economical calculation of the excitation energies of molecules. Tensor approach suggests efficient grid-based numerical treatment of the long-range electrostatic potentials on large 3D finite lattices with defects.The novel range-separated tensor format applies to interaction potentials of multi-particle systems of general type opening the new prospects for tensor methods in scientific computing. This research monograph presenting the modern tensor techniques applied to problems in quantum chemistry may be interesting for a wide audience of students and scientists working in computational chemistry, material science and scientific computing.

De Gruyter eBooks•Jun 8, 2018•50 citations

Tensor numerical methods for multidimensional PDES: theoretical analysis and initial applications

Boris N. Khoromskij

We present a brief survey on the modern tensor numerical methods for multidimensional stationary and time-dependent partial differential equations (PDEs). The guiding principle of the tensor approach is the rank-structured separable approximation of multivariate functions and operators represented on a grid. Recently, the traditional Tucker, canonical, and matrix product states (tensor train) tensor models have been applied to the grid-based electronic structure calculations, to parametric PDEs, and to dynamical equations arising in scientific computing. The essential progress is based on the quantics tensor approximation method proved to be capable to represent (approximate) function related d-dimensional data arrays of size Nd with log-volume complexity, O(dlog N). Combined with the traditional numerical schemes, these novel tools establish a new promising approach for solving multidimensional integral and differential equations using low-parametric rank-structured tensor formats. As the main example, we describe the grid-based tensor numerical approach for solving the 3D nonlinear Hartree-Fock eigenvalue problem, that was the starting point for the developments of tensor-structured numerical methods for large-scale computations in solving real-life multidimensional problems. We also discuss a new method for the fast 3D lattice summation of electrostatic potentials by assembled low-rank tensor approximation capable to treat the potential sum over millions of atoms in few seconds. We address new results on tensor approximation of the dynamical Fokker-Planck and master equations in many dimensions up to d = 20. Numerical tests demonstrate the benefits of the rank-structured tensor approximation on the aforementioned examples of multidimensional PDEs. In particular, the use of grid-based tensor representations in the reduced basis of atomics orbitals yields an accurate solution of the Hartree-Fock equation on large N × N × N grids with a grid size of up to N = 105.

arXiv:1408.4053•ESAIM Proceedings and Surveys•Jan 1, 2015•89 citations

Tensor numerical methods in quantum chemistry: from Hartree–Fock to excitation energies

Venera Khoromskaia, Boris N. Khoromskij

We resume the recent successes of the grid-based tensor numerical methods and discuss their prospects in real-space electronic structure calculations. These methods, based on the low-rank representation of the multidimensional functions and integral operators, first appeared as an accurate tensor calculus for the 3D Hartree potential using 1D complexity operations, and have evolved to entirely grid-based tensor-structured 3D Hartree-Fock eigenvalue solver. It benefits from tensor calculation of the core Hamiltonian and two-electron integrals (TEI) in O(n log n) complexity using the rank-structured approximation of basis functions, electron densities and convolution integral operators all represented on 3D n × n × n Cartesian grids. The algorithm for calculating TEI tensor in a form of the Cholesky decomposition is based on multiple factorizations using algebraic 1D "density fitting" scheme, which yield an almost irreducible number of product basis functions involved in the 3D convolution integrals, depending on a threshold ε > 0. The basis functions are not restricted to separable Gaussians, since the analytical integration is substituted by high-precision tensor-structured numerical quadratures. The tensor approaches to post-Hartree-Fock calculations for the MP2 energy correction and for the Bethe-Salpeter excitation energies, based on using low-rank factorizations and the reduced basis method, were recently introduced. Another direction is towards the tensor-based Hartree-Fock numerical scheme for finite lattices, where one of the numerical challenges is the summation of electrostatic potentials of a large number of nuclei. The 3D grid-based tensor method for calculation of a potential sum on a L × L × L lattice manifests the linear in L computational work, O(L), instead of the usual O(L(3) log L) scaling by the Ewald-type approaches.

arXiv:1504.06289•Physical Chemistry Chemical Physics•Jan 1, 2015•71 citations

Tensor representation techniques in post-Hartree–Fock methods: matrix product state tensor format

Udo Benedikt, Henry Auer, Mike Espig +2 more

In this proof-of-principle study, we discuss the application of various tensor representation formats and their implications on memory requirements and computational effort for tensor manipulations as they occur in typical post-Hartree–Fock (post-HF) methods. A successive tensor decomposition/rank reduction scheme in the matrix product state (MPS) format for the two-electron integrals in the AO and MO bases and an estimate of the t 2 amplitudes as obtained from second-order many-body perturbation theory (MP2) are described. Furthermore, the AO–MO integral transformation, the calculation of the MP2 energy and the potential usage of tensors in low-rank MPS representation for the tensor contractions in coupled cluster theory are discussed in detail. We are able to show that the overall scaling of the memory requirements is reduced from the conventional N 4 scaling to approximately N 3 and the scaling of computational effort for tensor contractions in post-HF methods can be reduced to roughly N 4 while the decomposition itself scales as N 5. While efficient algorithms with low prefactor for the tensor decomposition have yet to be devised, this ansatz offers the possibility to find a robust approximation with low-scaling behaviour with system and basis-set size for post-HF ab initio methods.

Molecular Physics•Apr 29, 2013•24 citations
We present concepts of data-sparse tensor approximations to the functions and operators arising in many-particle models of quantum chemistry. Our approach is based on the systematic use of structured tensor-product representations where the low-dimensional components are represented in hierarchical or wavelet based matrix formats. The modern methods of tensor-product approximation in higher dimensions are discussed with the focus on analytically based approaches. We give numerical illustrations which confirm the efficiency of tensor decomposition techniques in electronic structure calculations.
Tensor product decompositions with optimal separation rank provide an interesting alternative to traditional Gaussian-type basis functions in electronic structure calculations. We discuss various applications for a new compression algorithm, based on the Newton method, which provides for a given tensor the optimal tensor product or so-called best separable approximation for fixed Kronecker rank. In combination with a stable quadrature scheme for the Coulomb interaction, tensor product formats enable an efficient evaluation of Coulomb integrals. This is demonstrated by means of best separable approximations for the electron density and Hartree potential of small molecules, where individual components of the tensor product can be efficiently represented in a wavelet basis. We present a fairly detailed numerical analysis, which provides the basis for further improvements of this novel approach. Our results suggest a broad range of applications within density fitting schemes, which have been recently successfully applied in quantum chemistry.
Quantification of stochastic or quantum systems by a joint probability density or wave function is a notoriously difficult computational problem, since the solution depends on all possible states (or realizations) of the system. Due to this combinatorial flavor, even a system containing as few as ten particles may yield as many as 101010^{10}1010 discretized states. None of even modern supercomputers are capable to cope with this curse of dimensionality straightforwardly, when the amount of quantum particles, for example, grows up to more or less interesting order of hundreds. A traditional approach for a long time was to avoid models formulated in terms of probabilistic functions, and simulate particular system realizations in a randomized process. Since different times in different communities, data-sparse methods came into play. Generally, they aim to define all data points indirectly, by a map from a low amount of representers, and recast all operations (e.g. linear system solution) from the initial data to the effective parameters. The most advanced techniques can be applied (at least, tried) to any given array, and do not rely explicitly on its origin. The current work contributes further progress to this area in the particular direction: tensor product methods for separation of variables. The separation of variables has a long history, and is based on the following elementary concept: a function of many variables may be expanded as a product of univariate functions. On the discrete level, a function is encoded by an array of its values, or a tensor. Therefore, instead of a huge initial array, the separation of variables allows to work with univariate factors with much less efforts. The dissertation contains a short overview of existing tensor representations: canonical PARAFAC, Hierarchical Tucker, Tensor Train (TT) formats, as well as the artificial tensorisation, resulting in the Quantized Tensor Train (QTT) approximation method. The contribution of the dissertation consists in both theoretical constructions and practical numerical algorithms for high-dimensional models, illustrated on the examples of the Fokker-Planck and the chemical master equations. Both arise from stochastic dynamical processes in multiconfigurational systems, and govern the evolution of the probability function in time. A special focus is put on time propagation schemes and their properties related to tensor product methods. We show that these applications yield large-scale systems of linear equations, and prove analytical separable representations of the involved functions and operators. We propose a new combined tensor format (QTT-Tucker), which descends from the TT format (hence TT algorithms may be generalized smoothly), but provides complexity reduction by an order of magnitude. We develop a robust iterative solution algorithm, constituting most advantageous properties of the classical iterative methods from numerical analysis and alternating density matrix renormalization group (DMRG) techniques from quantum physics. Numerical experiments confirm that the new method is preferable to DMRG algorithms. It is as fast as the simplest alternating schemes, but as reliable and accurate as the Krylov methods in linear algebra.
The conventional numerical methods when applied to multidimensional problems suffer from the so-called "curse of dimensionality", that cannot be eliminated by using parallel architectures and high performance computing. The novel tensor numerical methods are based on a "smart" rank-structured tensor representation of the multivariate functions and operators discretized on Cartesian grids thus reducing solution of the multidimensional integral-differential equations to 1D calculations. We explain basic tensor formats and algorithms and show how the orthogonal Tucker tensor decomposition originating from chemometrics made a revolution in numerical analysis, relying on rigorous results from approximation theory. Benefits of tensor approach are demonstrated in ab-initio electronic structure calculations. Computation of the 3D convolution integrals for functions with multiple singularities is replaced by a sequence of 1D operations, thus enabling accurate MATLAB calculations on a laptop using 3D uniform tensor grids of the size up to 10 15 . Fast tensor-based Hartree-Fock solver, incorporating the grid-based low-rank factorization of the two-electron integrals, serves as a prerequisite for economical calculation of the excitation energies of molecules. Tensor approach suggests efficient grid-based numerical treatment of the long-range electrostatic potentials on large 3D finite lattices with defects.The novel range-separated tensor format applies to interaction potentials of multi-particle systems of general type opening the new prospects for tensor methods in scientific computing. This research monograph presenting the modern tensor techniques applied to problems in quantum chemistry may be interesting for a wide audience of students and scientists working in computational chemistry, material science and scientific computing.
We present a brief survey on the modern tensor numerical methods for multidimensional stationary and time-dependent partial differential equations (PDEs). The guiding principle of the tensor approach is the rank-structured separable approximation of multivariate functions and operators represented on a grid. Recently, the traditional Tucker, canonical, and matrix product states (tensor train) tensor models have been applied to the grid-based electronic structure calculations, to parametric PDEs, and to dynamical equations arising in scientific computing. The essential progress is based on the quantics tensor approximation method proved to be capable to represent (approximate) function related d-dimensional data arrays of size Nd with log-volume complexity, O(dlog N). Combined with the traditional numerical schemes, these novel tools establish a new promising approach for solving multidimensional integral and differential equations using low-parametric rank-structured tensor formats. As the main example, we describe the grid-based tensor numerical approach for solving the 3D nonlinear Hartree-Fock eigenvalue problem, that was the starting point for the developments of tensor-structured numerical methods for large-scale computations in solving real-life multidimensional problems. We also discuss a new method for the fast 3D lattice summation of electrostatic potentials by assembled low-rank tensor approximation capable to treat the potential sum over millions of atoms in few seconds. We address new results on tensor approximation of the dynamical Fokker-Planck and master equations in many dimensions up to d = 20. Numerical tests demonstrate the benefits of the rank-structured tensor approximation on the aforementioned examples of multidimensional PDEs. In particular, the use of grid-based tensor representations in the reduced basis of atomics orbitals yields an accurate solution of the Hartree-Fock equation on large N × N × N grids with a grid size of up to N = 105.
We resume the recent successes of the grid-based tensor numerical methods and discuss their prospects in real-space electronic structure calculations. These methods, based on the low-rank representation of the multidimensional functions and integral operators, first appeared as an accurate tensor calculus for the 3D Hartree potential using 1D complexity operations, and have evolved to entirely grid-based tensor-structured 3D Hartree-Fock eigenvalue solver. It benefits from tensor calculation of the core Hamiltonian and two-electron integrals (TEI) in O(n log n) complexity using the rank-structured approximation of basis functions, electron densities and convolution integral operators all represented on 3D n × n × n Cartesian grids. The algorithm for calculating TEI tensor in a form of the Cholesky decomposition is based on multiple factorizations using algebraic 1D "density fitting" scheme, which yield an almost irreducible number of product basis functions involved in the 3D convolution integrals, depending on a threshold ε > 0. The basis functions are not restricted to separable Gaussians, since the analytical integration is substituted by high-precision tensor-structured numerical quadratures. The tensor approaches to post-Hartree-Fock calculations for the MP2 energy correction and for the Bethe-Salpeter excitation energies, based on using low-rank factorizations and the reduced basis method, were recently introduced. Another direction is towards the tensor-based Hartree-Fock numerical scheme for finite lattices, where one of the numerical challenges is the summation of electrostatic potentials of a large number of nuclei. The 3D grid-based tensor method for calculation of a potential sum on a L × L × L lattice manifests the linear in L computational work, O(L), instead of the usual O(L(3) log L) scaling by the Ewald-type approaches.
In this proof-of-principle study, we discuss the application of various tensor representation formats and their implications on memory requirements and computational effort for tensor manipulations as they occur in typical post-Hartree–Fock (post-HF) methods. A successive tensor decomposition/rank reduction scheme in the matrix product state (MPS) format for the two-electron integrals in the AO and MO bases and an estimate of the t 2 amplitudes as obtained from second-order many-body perturbation theory (MP2) are described. Furthermore, the AO–MO integral transformation, the calculation of the MP2 energy and the potential usage of tensors in low-rank MPS representation for the tensor contractions in coupled cluster theory are discussed in detail. We are able to show that the overall scaling of the memory requirements is reduced from the conventional N 4 scaling to approximately N 3 and the scaling of computational effort for tensor contractions in post-HF methods can be reduced to roughly N 4 while the decomposition itself scales as N 5. While efficient algorithms with low prefactor for the tensor decomposition have yet to be devised, this ansatz offers the possibility to find a robust approximation with low-scaling behaviour with system and basis-set size for post-HF ab initio methods.