Approximation in the extended functional tensor train format
arXiv:2211.11338 · doi:10.1007/s10444-024-10140-9
Abstract
This work proposes the extended functional tensor train (EFTT) format for compressing and working with multivariate functions on tensor product domains. Our compression algorithm combines tensorized Chebyshev interpolation with a low-rank approximation algorithm that is entirely based on function evaluations. Compared to existing methods based on the functional tensor train format, the adaptivity of our approach often results in reducing the required storage, sometimes considerably, while achieving the same accuracy. In particular, we reduce the number of function evaluations required to achieve a prescribed accuracy by up to over 96% compared to the algorithm from [Gorodetsky, Karaman and Marzouk, Comput. Methods Appl. Mech. Eng., 347 (2019)].
References in corpus (12)
- A Practical Introduction to Tensor Networks: Matrix Product States and Projected Entangled Pair States
- Sketching as a Tool for Numerical Linear Algebra
- Polynomial meta-models with canonical low-rank approximations: numerical insights and comparison to sparse polynomial chaos expansions
- Spectral tensor-train decomposition
- Quasioptimality of maximum-volume cross interpolation of tensors
- The automatic solution of partial differential equations using a global spectral method
- Functional Tensor-Train Chebyshev Method for Multidimensional Quantum Dynamics Simulations
- Dynamically orthogonal tensor methods for high-dimensional nonlinear PDEs
- Functional Tucker approximation using Chebyshev interpolation
- Learning with tree tensor networks: complexity estimates and model selection
- Tensor rank reduction via coordinate flows
- Fast global spectral methods for three-dimensional partial differential equations