Recovery algorithms for high-dimensional rank one tensors

DOI10.1016/j.jat.2018.08.002zbMath1405.41023arXiv1711.03986OpenAlexW2963175767WikidataQ114164926 ScholiaQ114164926MaRDI QIDQ1801175

David Krieg, Daniel Rudolf

Publication date: 26 October 2018

Published in: Journal of Approximation Theory (Search for Journal in Brave)

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

zbMATH Keywords

dispersioncurse of dimensionalitytractabilityrank one tensorsworst case errorhigh dimensional approximation

Mathematics Subject Classification ID

Multidimensional problems (41A63)

Related Items (4)

On optimal approximation in periodic Besov spaces ⋮ Minimal dispersion of large volume boxes in the cube ⋮ Deterministic constructions of high-dimensional sets with small dispersion ⋮ Expected dispersion of uniformly distributed points

Cites Work

• Unnamed Item
• Approximation of high-dimensional rank one tensors
• Tractability of multivariate problems. Volume I: Linear information
• Deterministic and stochastic error bounds in numerical analysis
• A note on minimal dispersion of point sets in the unit cube
• On the dispersion of sparse grids
• An upper bound on the minimal dispersion
• On the size of the largest empty box amidst a point set
• On the power of adaption
• An Upper Bound of the Minimal Dispersion via Delta Covers
• Tractability of the approximation of high-dimensional rank one tensors

This page was built for publication: Recovery algorithms for high-dimensional rank one tensors