Nonlinear tensor product approximation of functions

DOI10.1016/j.jco.2015.06.005zbMath1332.41026arXiv1409.1403OpenAlexW2964100246MaRDI QIDQ890230

Vladimir N. Temlyakov, D. B. Bazarkhanov

Publication date: 9 November 2015

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

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

zbMATH Keywords

error boundsgreedy algorithmtensor product

Mathematics Subject Classification ID

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

Related Items

Matrix and tensor rigidity and \(L_p\)-approximation, On estimates of the order of the best M-term approximations of functions of several variables in the anisotropic Lorentz-Zygmund space, On estimates of \(m\)-term approximations on classes of functions with bounded mixed derivative in the Lorentz space, Sparse Approximation by Greedy Algorithms, Tensor networks and hierarchical tensors for the solution of high-dimensional partial differential equations, Some problems in the theory of ridge functions

Cites Work

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