SIAM Journal on Scientific Computing· 2026Q1
A Hybrid Chebyshev–Tucker Tensor Format for Approximation of Multivariate Functions
- 0citations
- Q1SCImago
- 2026year
Short summary
A new hybrid Chebyshev–Tucker tensor representation approximates multivariate functions without discretizing on large grids, using values at Chebyshev nodes and Tucker decomposition of Chebyshev coefficients.
AI-generated from the title and abstract; the full text is not read.
Key points
- Introduces a hybrid Chebyshev–Tucker tensor representation for multivariate function approximation.
- Avoids discretizing functions on large spatial grids by using values at Chebyshev nodes.
- Leverages Tucker decomposition of Chebyshev coefficients for efficient representation.
- Enables nearly optimal Tucker decomposition with controllable accuracy without full grid discretization.
AI-generated from the title and abstract; the full text is not read.
Abstract
Abstract. We introduce and analyze a mesh-free two-level hybrid Chebyshev–Tucker tensor representation for approximating multivariate functions, which combines tensor-product Chebyshev interpolation with the low-rank Tucker decomposition of the tensor of Chebyshev coefficients. This construction allows us to avoid the expensive rank-structured grid-based approximation of function-related tensors on large spatial grids, while benefiting from the Tucker decomposition of the moderate-sized core tensor of Chebyshev coefficients. Thus, we can compute the nearly optimal Tucker decomposition of the 3D function with controllable accuracy [Formula: see text] without discretizing the function on a full fine grid in the domain, but only using its values at a small set of Chebyshev nodes computed either from the explicit analytic expression of the target function or from its data-sparse representation in a rank-structured tensor format with moderate rank parameter. Finally, we can represent the function in the algebraic Tucker format with optimal [Formula: see text]-rank on an arbitrarily large 3D tensor grid in the computational domain by discretizing the Chebyshev polynomials on that grid. The rank parameters of the nonlinear Tucker-ALS decomposition of the coefficient tensor can be much smaller than the polynomial degrees of the initial Chebyshev linear interpolation in the function independent polynomial basis set. It is shown that our techniques can be gainfully applied to the long-range part of the singular electrostatic potential of multiparticle systems represented on a fine grid in the range-separated tensor format. The resulting low-rank tensor can be used in applications to numerical PDE, in computational quantum chemistry, and for calculation of various physical quantities of multiparticle systems. We provide error and complexity estimates and demonstrate the computational efficiency of the proposed techniques on challenging examples, including the collective electrostatic potential for large biomolecular systems and lattice-type compounds. Reproducibility of computational results. This paper has been awarded the “SIAM Reproducibility Badge: Code and data available” as a recognition that the authors have followed reproducibility principles valued by SISC and the scientific computing community. Code and data that allow readers to reproduce the results in this paper are available at https://github.com/bonans/ChebTuck and in the supplementary materials ( ChebTuck-main.zip [113MB]). [Formula: see text]
The authors' abstract, as published at the source. SIAM Journal on Scientific Computing, 2026 · DOI ↗
Continue with a free account
Ask the paper: 3 free questions a day about this paper; save it, get its citation, new summaries every day for your field. Takeaways are Premium.
Continue free on the webSign in with Google or Apple; no card needed. You come back to this paper.
On your phone:
Field: Computational Mathematics
Computational MathematicsMathematics