Functional Tucker approximation using Chebyshev interpolation

Multilinear algebra, tensor calculus (15A69) Approximation by polynomials (41A10) Multidimensional problems (41A63) Algorithms for approximation of functions (65D15) Numerical methods for low-rank matrix approximation; matrix compression (65F55)

arXiv classification

cs.NA math.NA

Abstract: This work is concerned with approximating a trivariate function defined on a tensor-product domain via function evaluations. Combining tensorized Chebyshev interpolation with a Tucker decomposition of low multilinear rank yields function approximations that can be computed and stored very efficiently. The existing Chebfun3 algorithm [Hashemi and Trefethen, SIAM J. Sci. Comput., 39 (2017)]uses a similar format but the construction of the approximation proceeds indirectly, via a so called slice-Tucker decomposition. As a consequence, Chebfun3 sometimes uses unnecessarily many function evaluations and does not fully benefit from the potential of the Tucker decomposition to reduce, sometimes dramatically, the computational cost. We propose a novel algorithm Chebfun3F that utilizes univariate fibers instead of bivariate slices to construct the Tucker decomposition. Chebfun3F reduces the cost for the approximation in terms of the number of function evaluations for nearly all functions considered, typically by 75%, and sometimes by over 98%.

Cited in

(1)

Intrinsic Low-Tucker-Rank Theory and Unified Tensor CUR Decomposition for High-Dimensional Hyperinterpolation

This page was built for publication: Functional Tucker approximation using Chebyshev interpolation

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