A Sharp Upper Bound for Sampling Numbers in $L_2$

Article Properties
Cite
Dolbeault, Matthieu, et al. “A Sharp Upper Bound for Sampling Numbers in $L_2$”. SSRN Electronic Journal, 2022, https://doi.org/10.2139/ssrn.4132094.
Dolbeault, M., Krieg, D., & Ullrich, M. (2022). A Sharp Upper Bound for Sampling Numbers in $L_2$. SSRN Electronic Journal. https://doi.org/10.2139/ssrn.4132094
Dolbeault, Matthieu, David Krieg, and Mario Ullrich. “A Sharp Upper Bound for Sampling Numbers in $L_2$”. SSRN Electronic Journal, 2022. https://doi.org/10.2139/ssrn.4132094.
Dolbeault M, Krieg D, Ullrich M. A Sharp Upper Bound for Sampling Numbers in $L_2$. SSRN Electronic Journal. 2022;.
Refrences
Title Journal Journal Categories Citations Publication Date
A New Upper Bound for Sampling Numbers

Foundations of Computational Mathematics
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
  • Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods
  • Science: Mathematics
18 2022
On the Power of Standard Information for Tractability for L<sub>2</sub>- Approximation in the Randomized Setting

Contemporary Mathematics
  • Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods
  • Science: Mathematics
3 2022
Random sections of ellipsoids and the power of random information

Transactions of the American Mathematical Society
  • Science: Mathematics
13 2021
Function Values Are Enough for $$L_2$$-Approximation

Foundations of Computational Mathematics
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
  • Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods
  • Science: Mathematics
28 2021
Constructing linear-sized spectral sparsification in almost-linear time 2018
Refrences Analysis
The category Science: Mathematics 26 is the most frequently represented among the references in this article. It primarily includes studies from Journal of Complexity The chart below illustrates the number of referenced publications per year.
Refrences used by this article by year
Citations
Title Journal Journal Categories Citations Publication Date
Recovery of Sobolev functions restricted to iid sampling

Mathematics of Computation
  • Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods
  • Science: Mathematics
2 2022
Citations Analysis
The category Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods 1 is the most commonly referenced area in studies that cite this article. The first research to cite this article was titled Recovery of Sobolev functions restricted to iid sampling and was published in 2022. The most recent citation comes from a 2022 study titled Recovery of Sobolev functions restricted to iid sampling. This article reached its peak citation in 2022, with 1 citations. It has been cited in 1 different journals. Among related journals, the Mathematics of Computation cited this research the most, with 1 citations. The chart below illustrates the annual citation trends for this article.
Citations used this article by year