Incremental Greedy Algorithm and Its Applications in Numerical Integration

DOI10.1007/978-3-319-33507-0_30zbMath1356.65088OpenAlexW2494790827MaRDI QIDQ2957058

Vladimir N. Temlyakov

Publication date: 20 January 2017

Published in: Springer Proceedings in Mathematics & Statistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-33507-0_30

zbMATH Keywords

greedy algorithmdiscrepancycubature formulasincremental algorithm

Mathematics Subject Classification ID

Multidimensional problems (41A63) Approximate quadratures (41A55) Numerical quadrature and cubature formulas (65D32)

Related Items

Numerical integration and discrepancy under smoothness assumption and without it, The Marcinkiewicz-type discretization theorems, Connections between numerical integration, discrepancy, dispersion, and universal discretization

Cites Work

• Unnamed Item
• Trigonometric diameters of the Sobolev classes \(W^ r_ p\) in the space \(L_ q\)
• Rates of convex approximation in non-Hilbert spaces
• Nonlinear approximation by trigonometric sums
• Cubature formulas, discrepancy, and nonlinear approximation
• Greedy-type approximation in Banach spaces and applications
• Convergence of some greedy algorithms in Banach spaces
• Weak greedy algorithms
• Greedy Approximation
• EXTREMAL PROPERTIES OF ORTHOGONAL PARALLELEPIPEDS AND THEIR APPLICATIONS TO THE GEOMETRY OF BANACH SPACES
• Greedy algorithms in Banach spaces