22 citations to https://www.mathnet.ru/eng/jcomp9
-
Galiya Taugynbayeva, Shapen Azhgaliyev, Aksaule Zhubanysheva, Nurlan Temirgaliyev, “Full C(N)D-study of computational capabilities of Lagrange polynomials”, Mathematics and Computers in Simulation, 227 (2025), 189
-
Egor Kosov, Vladimir Temlyakov, “Sampling discretization of the uniform norm and applications”, Journal of Mathematical Analysis and Applications, 538:2 (2024), 128431
-
Alexandros Eskenazis, “$\varepsilon $-Isometric Dimension Reduction for Incompressible Subsets of $\ell _p$”, Discrete Comput Geom, 71:1 (2024), 160
-
F. Dai, V. Temlyakov, “Random points are good for universal discretization”, J. Math. Anal. Appl., 529:1 (2024), 127570–28
-
Ben Adcock, Simone Brugiapaglia, Nick Dexter, Sebastian Moraga, Handbook of Numerical Analysis, 25, Numerical Analysis Meets Machine Learning, 2024, 1
-
I. V. Limonova, Yu. V. Malykhin, V. N. Temlyakov, “One-sided discretization inequalities and recovery from samples”, Uspekhi Mat. Nauk, 79:3 (2024), 149–180
-
V. N. Temlyakov, “Sparse sampling recovery in integral norms on some function classes”, Mat. Sb., 215:10 (2024), 146–166
-
I. V. Limonova, Yu. V. Malykhin, V. N. Temlyakov, “One-sided discretization inequalities and sampling recovery”, Russian Math. Surveys, 79:3 (2024), 515–545
-
Matthieu Dolbeault, David Krieg, Mario Ullrich, “A sharp upper bound for sampling numbers in L2”, Applied and Computational Harmonic Analysis, 63 (2023), 113
-
D. Freeman, T. Oikhberg, B. Pineau, M. A. Taylor, “Stable phase retrieval in function spaces”, Math. Ann., 2023