A mesh-free hybrid Chebyshev-Tucker tensor format with applications to multi-particle modelling
By: Peter Benner , Boris N. Khoromskij , Venera Khoromskaia and more
Potential Business Impact:
Makes computer calculations for big groups faster.
In this paper, we introduce a mesh-free two-level hybrid Tucker tensor format for approximation of multivariate functions, which combines the product Chebyshev interpolation with the ALS-based Tucker decomposition of the tensor of Chebyshev coefficients. It allows to avoid the expenses of the rank-structured approximation of function-related tensors defined on large spacial grids, while benefiting from the Tucker decomposition of the rather small core tensor of Chebyshev coefficients. This leads to nearly optimal Tucker rank parameters which are close to the results for well established Tucker-ALS algorithm applied to the large grid-based tensors. These rank parameters inherited from the Tucker-ALS decomposition of the coefficient tensor can be much less than the polynomial degrees of the initial Chebyshev interpolant via function independent basis set. Furthermore, the tensor product Chebyshev polynomials discretized on a tensor grid leads to a low-rank two-level orthogonal algebraic Tucker tensor that approximates the initial function with controllable accuracy. It is shown that our techniques could be gainfully applied to the long-range part of the electrostatic potential of multi-particle systems approximated in the range-separated tensor format. Error and complexity estimates of the proposed methods are presented. We demonstrate the efficiency of the suggested method numerically on examples of the long-range components of multi-particle interaction potentials generated by 3D Newton kernel for large bio-molecule systems and lattice-type compounds.
Similar Papers
A new cross approximation for Tucker tensors and its application in Tucker-Anderson Acceleration
Numerical Analysis
Makes computer math faster for complex problems.
A Low-Rank QTT-based Finite Element Method for Elasticity Problems
Numerical Analysis
Solves tricky shape problems with less computer memory.
Kernel Interpolation on Sparse Grids
Numerical Analysis
Makes computer predictions faster for huge amounts of data.