RUS  ENG
Full version
JOURNALS // Zhurnal Vychislitel'noi Matematiki i Matematicheskoi Fiziki // Archive

Zh. Vychisl. Mat. Mat. Fiz., 2021 Volume 61, Number 5, Pages 776–786 (Mi zvmmf11237)

This article is cited in 5 papers

General numerical methods

TT ranks of approximate tensorizations of some smooth functions

L. I. Vysotskyab

a Marchuk Institute of Numerical Mathematics, Russian Academy of Sciences, 19333, Moscow, Russia
b Faculty of Computational Mathematics and Cybernetics, Moscow State University, 119991, Moscow, Russia

Abstract: Tensorizations of functions are studied, that is, tensors with elements $A(i_1,\dots,i_d)=f(x(i_1,\dots,i_d))$, where $f(x)$ is some function defined on an interval and $\{x(i_1,\dots,i_d)\}$ is a grid on this interval. For tensors of this type, the problem of approximation by tensors admitting a tensor train (ТТ) decomposition with low ТТ ranks is posed. For the class of functions that are traces of analytic functions of a complex variable in some ellipses on the complex plane, upper and lower bounds for ТТ ranks of optimal approximations are deduced. These estimates are applied to tensorizations of polynomial functions. In particular, the well-known upper bound for ТТ ranks of approximations of such functions is improved to $O(\log n)$, where $n$ is the degree of the polynomial.

Key words: TT decomposition, tensor train, TT ranks, tensorization of functions, approximations.

UDC: 519.65

Received: 24.11.2020
Revised: 24.11.2020
Accepted: 14.01.2021

DOI: 10.31857/S0044466921050173


 English version:
Computational Mathematics and Mathematical Physics, 2021, 61:5, 750–760

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2026