Vladimir Temlyakov, “Incremental greedy algorithm and its applications in numerical integration”, Springer Proceedings in Mathematics & Statistics, 2016, Volume 163, Pages 557

Loading [MathJax]/jax/output/SVG/config.js

Springer Proceedings in Mathematics & Statistics

RUS ENG

JavaScript is disabled in your browser. Please switch it on to enable full functionality of the website

Springer Proceedings in Mathematics & Statistics, 2016, Volume 163, Pages 557–570
DOI: https://doi.org/10.1007/978-3-319-33507-0_30 (Mi spms1)

This article is cited in 4 scientific papers (total in 4 papers)

Incremental greedy algorithm and its applications in numerical integration

Vladimir Temlyakov^ab

^a University of South Carolina, Columbia, SC, USA
^b Steklov Institute of Mathematics, Moscow, Russia

Citations (4)

DOI: https://doi.org/10.1007/978-3-319-33507-0_30

Funding agency	Grant number
National Science Foundation	DMS-1160841

Bibliographic databases:

Document Type: Article

Language: English

Linking options:

https://www.mathnet.ru/eng/spms1

This publication is cited in the following 4 articles:

Zihui Luo, Xiaolong Zheng, Bo Wang, Qifeng Meng, Helei Cui, Xiaobing Guo, Liang Liu, 2022 IEEE 28th International Conference on Parallel and Distributed Systems (ICPADS), 2023, 57
V. N. Temlyakov, “Numerical integration and discrepancy under smoothness assumption and without it”, Constr. Approx., 55 (2022), 743–771
Vladimir Temlyakov, “Connections between numerical integration, discrepancy, dispersion, and universal discretization”, The SMAI journal of computational mathematics, S5 (2019), 185
V. N. Temlyakov, “The Marcinkiewicz–type discretization theorems”, Constr. Approx., 48:2 (2018), 337–369

Citing articles in Google Scholar: Russian citations, English citations
Related articles in Google Scholar: Russian articles, English articles

Statistics & downloads:
Abstract page:	82