Function Values Are Enough for $$L_2$$-Approximation
Article Properties
-
LanguageEnglish
-
DOI (url)
-
Publication Date2020/12/07
-
Indian UGC (journal)
-
Refrences23
-
Citations28
-
David Krieg
-
Mario Ullrich
Abstract
Cite
Krieg, David, and Mario Ullrich. “Function Values Are Enough for $$L_2$$-Approximation”. Foundations of Computational Mathematics, vol. 21, no. 4, 2020, pp. 1141-5, https://doi.org/10.1007/s10208-020-09481-w.
Krieg, D., & Ullrich, M. (2020). Function Values Are Enough for $$L_2$$-Approximation. Foundations of Computational Mathematics, 21(4), 1141-1151. https://doi.org/10.1007/s10208-020-09481-w
Krieg, David, and Mario Ullrich. “Function Values Are Enough for $$L_2$$-Approximation”. Foundations of Computational Mathematics 21, no. 4 (2020): 1141-51. https://doi.org/10.1007/s10208-020-09481-w.
Krieg D, Ullrich M. Function Values Are Enough for $$L_2$$-Approximation. Foundations of Computational Mathematics. 2020;21(4):1141-5.
Journal Categories
Science
Mathematics
Science
Mathematics
Instruments and machines
Electronic computers
Computer science
Technology
Technology (General)
Industrial engineering
Management engineering
Applied mathematics
Quantitative methods
You May Also Like
- A splitting algorithm for dual monotone inclusions involving cocoercive operators
- A B-spline approach for empirical mode decompositions
- A weak Galerkin finite element method for the stokes equations
- Table of Integrals, Series, and Products
- An Algorithm for the Machine Calculation of Complex Fourier Series
Refrences
| Title | Journal | Journal Categories | Citations | Publication Date |
|---|---|---|---|---|
| On singular values of matrices with independent rows | Bernoulli |
| 24 | 2006 |
| Optimal Monte Carlo Methods for $$L^2$$ L 2 -Approximation | Constructive Approximation |
| 9 | 2019 |
| Optimal weighted least-squares methods | The SMAI Journal of computational mathematics |
| 97 | 2017 |
| Tractability of multivariate problems for standard and linear information in the worst case setting: Part I | Journal of Approximation Theory |
| 12 | 2016 |
| On the power of standard information for multivariate approximation in the worst case setting | Journal of Approximation Theory |
| 28 | 2009 |
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 | |
| Optimal learning | Calcolo |
| 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 | |
New Lower Bounds for the Integration of Periodic Functions | Journal of Fourier Analysis and Applications |
| 1 | 2023 |
Citations Analysis
The category
Science: Mathematics 27
is the most commonly referenced area in studies that cite this article. The first research to cite this article was titled Weighted random sampling and reconstruction in general multivariate trigonometric polynomial spaces and was published in 2021. 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 17 different journals, 11% of which are open access. Among related journals, the Journal of Complexity cited this research the most, with 8 citations. The chart below illustrates the annual citation trends for this article.