Nonlinear tensor product approximation of functions

DOI10.1016/J.JCO.2015.06.005zbMATH Open1332.41026arXiv1409.1403OpenAlexW2964100246MaRDI QIDQ890230FDOQ890230

V. N. Temlyakov, D. B. Bazarkhanov

Publication date: 9 November 2015

Published in: Journal of Complexity (Search for Journal in Brave)

Abstract: We are interested in approximation of a multivariate function $f(x_1,dots,x_d)$ by linear combinations of products $u^1(x_1)cdots{u}^d(x_d)$ of univariate functions $u^i(x_i)$, $i=1,dots,d$. In the case $d=2$ it is a classical problem of bilinear approximation. In the case of approximation in the $L_2$ space the bilinear approximation problem is closely related to the problem of singular value decomposition (also called Schmidt expansion) of the corresponding integral operator with the kernel $f(x_1,x_2)$. There are known results on the rate of decay of errors of best bilinear approximation in $L_p$ under different smoothness assumptions on $f$. The problem of multilinear approximation (nonlinear tensor product approximation) in the case $dge3$ is more difficult and much less studied than the bilinear approximation problem. We will present results on best multilinear approximation in $L_p$ under mixed smoothness assumption on $f$.

Full work available at URL: https://arxiv.org/abs/1409.1403

zbMATH Keywords

tensor producterror boundsgreedy algorithm

Mathematics Subject Classification ID

Multidimensional problems (41A63) Rate of convergence, degree of approximation (41A25) Approximation by arbitrary nonlinear expressions; widths and entropy (41A46)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• DIAMETERS OF SETS IN FUNCTION SPACES AND THE THEORY OF BEST APPROXIMATIONS
• Adaptive greedy approximations
• Nonlinear methods of approximation
• Tensor Spaces and Numerical Tensor Calculus
• Greedy approximation
• Trading Accuracy for Sparsity in Optimization Problems with Sparsity Constraints
• Sequential greedy approximation for certain convex optimization problems
• Greedy algorithms in Banach spaces
• Tensor-sparsity of solutions to high-dimensional elliptic partial differential equations
• Greedy algorithms with regard to multivariate systems with special structure
• On unconditional polynomial bases in \(L_ p\) and Bergman spaces
• Approximation rates for the hierarchical tensor format in periodic Sobolev spaces
• Estimates of best bilinear approximations of functions and approximation numbers of integral operators
• ESTIMATES OF THE BEST BILINEAR APPROXIMATIONS OF FUNCTIONS OF TWO VARIABLES AND SOME OF THEIR APPLICATIONS

Cited In (10)

• On estimates for orders of best \(M\)-term approximations of multivariate functions in anisotropic Lorentz-karamata spaces
• Title not available (Why is that?)
• Estimates of \(M\)-term approximations of functions of several variables in the Lorentz space by a constructive method
• On estimates of the order of the best M-term approximations of functions of several variables in the anisotropic Lorentz-Zygmund space
• Sparse Approximation by Greedy Algorithms
• Matrix and tensor rigidity and \(L_p\)-approximation
• On estimates of \(m\)-term approximations on classes of functions with bounded mixed derivative in the Lorentz space
• Some problems in the theory of ridge functions
• Fast least squares approximation using tensor products of functions and linear forms
• Tensor networks and hierarchical tensors for the solution of high-dimensional partial differential equations

This page was built for publication: Nonlinear tensor product approximation of functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q890230)