\(L^{\infty}\) estimation of tensor truncations (Q380326): Difference between revisions

Tensor truncation techniques are based on singular value decompositions. They are often advisable to approximate multivariate (grid) functions by appropriate tensor formats in order to perform inexpensive point-wise evaluations that require error estimates. Due to the huge dimensions of the tensor spaces, a direct estimate is difficult. In this paper, the author proves that, in cases where the function to be approximated is smooth, reasonable error estimates can be derived from the Gagliardo-Nirenberg inequality because of the special nature of the singular value decomposition truncation.