Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 43 min ago
Peer-reviewedCC BYLinear Algebra and its Applications

Approximation and composition of functions in quantized tensor trains via orthogonal polynomial expansions

  1. 1Institute of Fundamental Physics IFF-CSIC, Calle Serrano 113b, Madrid, 28006, Madrid, Spain

Abstract

This work explores the representation of univariate and multivariate functions as quantized tensor trains (QTT). It develops a constructive algorithm that employs expansions in orthogonal polynomial bases and Clenshaw evaluations to represent analytic and highly differentiable functions as QTT approximants. This approach provides a general framework for function composition in QTT form that generalizes efficiently to multidimensional settings. Without loss of generality, the presentation focuses on the Chebyshev basis, where the method demonstrates rapid convergence for highly differentiable functions, in agreement with classical theoretical predictions, and remains numerically stable at high polynomial orders. The performance of the algorithm is compared with that of tensor cross-interpolation (TCI) and multiscale interpolative constructions, demonstrating competitive performance and favorable scaling behavior in certain scenarios.

Related

  1. Backward log orthogonal functions and their approximation theory
    Mahmoud A. Zaky
    arXivPreprintarXiv licenceFull textNumerical analysis & scientific computingarXiv
  2. Approximation by interpolation operators with piecewise polynomial basis functions
    Mei Ying, Yu Dansheng
    Demonstratio MathematicaPeer-reviewedCC BYFull textStatisticsDOAJ
  3. Littlewood-Paley theory for orthogonal expansions associated with root systems
    Lukas Langen, Margit Rösler
    arXivPreprintarXiv licenceFull textAlgebra & number theoryAnalysis & PDEsarXiv
  4. Exact approximation order of real numbers in Cantor series expansions
    Wanjin Cheng, Xinyun Zhang
    arXivPreprintarXiv licenceFull textAlgebra & number theoryarXiv
  5. Riordan array representation of recursive polynomial sequences, orthogonal polynomial sequences, and d-orthogonal polynomial sequences
    Tian-Xiao He
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
BibTeX
@article{rodriguezaldavero2026approximation,
  title = {{Approximation and composition of functions in quantized tensor trains via orthogonal polynomial expansions}},
  author = {Juan José Rodríguez-Aldavero and Paula García-Molina and Luca Tagliacozzo and Juan José García‐Ripoll},
  journal = {Linear Algebra and its Applications},
  year = {2026},
  month = aug,
  doi = {10.1016/j.laa.2026.08.022},
  url = {https://doi.org/10.1016/j.laa.2026.08.022},
  note = {CC BY},
}
RIS
TY  - JOUR
TI  - Approximation and composition of functions in quantized tensor trains via orthogonal polynomial expansions
AU  - Juan José Rodríguez-Aldavero
AU  - Paula García-Molina
AU  - Luca Tagliacozzo
AU  - Juan José García‐Ripoll
PY  - 2026
DA  - 2026/08/19
JO  - Linear Algebra and its Applications
DO  - 10.1016/j.laa.2026.08.022
UR  - https://doi.org/10.1016/j.laa.2026.08.022
AB  - This work explores the representation of univariate and multivariate functions as quantized tensor trains (QTT). It develops a constructive algorithm that employs expansions in orthogonal polynomial bases and Clenshaw evaluations to represent analytic and highly differentiable functions as QTT approximants. This approach provides a general framework for function composition in QTT form that generalizes efficiently to multidimensional settings. Without loss of generality, the presentation focuses on the Chebyshev basis, where the method demonstrates rapid convergence for highly differentiable functions, in agreement with classical theoretical predictions, and remains numerically stable at high polynomial orders. The performance of the algorithm is compared with that of tensor cross-interpolation (TCI) and multiscale interpolative constructions, demonstrating competitive performance and favorable scaling behavior in certain scenarios.
SN  - 0024-3795
SN  - 1873-1856
ER  -