A sharp upper bound for sampling numbers in L2
Article Properties
-
LanguageEnglish
-
DOI (url)
-
Publication Date2023/03/01
-
Indian UGC (journal)
-
Refrences61
-
Citations16
-
Matthieu Dolbeault
-
David Krieg
-
Mario Ullrich ORCID (unauthenticated)
Cite
Dolbeault, Matthieu, et al. “A Sharp Upper Bound for Sampling Numbers in L2”. Applied and Computational Harmonic Analysis, vol. 63, 2023, pp. 113-34, https://doi.org/10.1016/j.acha.2022.12.001.
Dolbeault, M., Krieg, D., & Ullrich, M. (2023). A sharp upper bound for sampling numbers in L2. Applied and Computational Harmonic Analysis, 63, 113-134. https://doi.org/10.1016/j.acha.2022.12.001
Dolbeault, Matthieu, David Krieg, and Mario Ullrich. “A Sharp Upper Bound for Sampling Numbers in L2”. Applied and Computational Harmonic Analysis 63 (2023): 113-34. https://doi.org/10.1016/j.acha.2022.12.001.
Dolbeault M, Krieg D, Ullrich M. A sharp upper bound for sampling numbers in L2. Applied and Computational Harmonic Analysis. 2023;63:113-34.
Journal Categories
Science
Mathematics
Technology
Engineering (General)
Civil engineering (General)
Technology
Technology (General)
Industrial engineering
Management engineering
Applied mathematics
Quantitative methods
Refrences
| Title | Journal | Journal Categories | Citations | Publication Date |
|---|---|---|---|---|
A New Upper Bound for Sampling Numbers | Foundations of Computational Mathematics |
| 18 | 2022 |
Random sections of ellipsoids and the power of random information | Transactions of the American Mathematical Society |
| 13 | 2021 |
Worst-case Recovery Guarantees for Least Squares Approximation Using Random Samples | Constructive Approximation |
| 18 | 2021 |
Function Values Are Enough for $$L_2$$-Approximation | Foundations of Computational Mathematics |
| 28 | 2021 |
$$L_2$$-norm sampling discretization and recovery of functions from RKHS with finite trace | Sampling Theory, Signal Processing, and Data Analysis |
| 11 | 2021 |
Refrences Analysis
The category
Science: Mathematics 16
is the most frequently represented among the references in this article. It primarily includes studies from Journal of Approximation Theory and Constructive Approximation. 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 |
|---|---|---|---|---|
| Constructing Embedded Lattice-Based Algorithms for Multivariate Function Approximation with a Composite Number of Points | Constructive Approximation |
| 2024 | |
| Sparse-grid Sampling Recovery and Numerical Integration of Functions Having Mixed Smoothness | Acta Mathematica Vietnamica |
| 2024 | |
| Infinite-dimensional integration and L2-approximation on Hermite spaces | Journal of Approximation Theory |
| 2024 | |
| On the power of standard information for tractability for L∞ approximation of periodic functions in the worst case setting | Journal of Complexity |
| 2024 | |
| Homogeneous algorithms and solvable problems on cones | Journal of Complexity |
| 2024 |
Citations Analysis
The category
Science: Mathematics 16
is the most commonly referenced area in studies that cite this article. The first research to cite this article was titled Random sampling of signals concentrated on compact set in localized reproducing kernel subspace of $$L^p(\mathbb R^n)$$ and was published in 2023. The most recent citation comes from a 2024 study titled Constructing Embedded Lattice-Based Algorithms for Multivariate Function Approximation with a Composite Number of Points. This article reached its peak citation in 2023, with 11 citations. It has been cited in 11 different journals, 18% of which are open access. Among related journals, the Journal of Complexity cited this research the most, with 4 citations. The chart below illustrates the annual citation trends for this article.