Cubature formulas, discrepancy, and nonlinear approximation
From MaRDI portal
Publication:1401998
DOI10.1016/S0885-064X(02)00025-0zbMath1031.41016MaRDI QIDQ1401998
Publication date: 19 August 2003
Published in: Journal of Complexity (Search for Journal in Brave)
Related Items
Lower bounds for the integration error for multivariate functions with mixed smoothness and optimal Fibonacci cubature for functions on the square, Discrepancy Theory and Quasi-Monte Carlo Integration, A Monte Carlo Method for Integration of Multivariate Smooth Functions, Numerical integration and discrepancy, a new approach, Optimal quasi-Monte Carlo rules on order 2 digital nets for the numerical integration of multivariate periodic functions, A characterization of Sobolev spaces on the sphere and an extension of Stolarsky's invariance principle to arbitrary smoothness, Infinite-dimensional integration in weighted Hilbert spaces: anchored decompositions, optimal deterministic algorithms, and higher-order convergence, Optimal cubature formulas for tensor products of certain classes of functions, Fibonacci sets and symmetrization in discrepancy theory, Lattice-based integration algorithms: Kronecker sequences and rank-1 lattices, On the small ball inequality in three dimensions, On the orthogonality of the Chebyshev-Frolov lattice and applications, Computational complexity of the integration problem for anisotropic classes, Weighted discrepancy and numerical integration in function spaces, Approximation of multivariate periodic functions by trigonometric polynomials based on sampling along rank-1 lattice with generating vector of Korobov form, Change of variable in spaces of mixed smoothness and numerical integration of multivariate functions on the unit cube, A universal algorithm for multivariate integration, Lattice rules for nonperiodic smooth integrands, The Role of Frolov's Cubature Formula for Functions with Bounded Mixed Derivative, General algorithm for the numerical integration of functions of several variables, Some Results on the Complexity of Numerical Integration, Incremental Greedy Algorithm and Its Applications in Numerical Integration, On “Upper Error Bounds for Quadrature Formulas on Function Classes” by K.K. Frolov, Harmonic analysis on totally disconnected groups and irregularities of point distributions
Cites Work
- Zur angenäherten Berechnung mehrfacher Integrale
- Reconstruction of periodic functions of several variables with respect to the values in the nodes of number-theoretic nets
- Lectures on irregularities of distribution. (Notes by T. N. Shorey)
- Deterministic and stochastic error bounds in numerical analysis
- Estimates of best bilinear approximations of functions and approximation numbers of integral operators
- Rates of convex approximation in non-Hilbert spaces
- Some remarks on greedy algorithms
- Weak greedy algorithms
- The extreme and \(L^2\) discrepancies of some plane sets
- On irregularities of distribution, III
- On irregularities of distribution, IV
- Applications of Number Theory to Numerical Analysis
- On irregularities of distribution
- CUBATURE FORMULAS FOR CLASSES OF FUNCTIONS WITH BOUNDED MIXED DIFFERENCE
- On irregularities of distribution, II
- ON A WAY OF OBTAINING LOWER ESTIMATES FOR THE ERRORS OF QUADRATURE FORMULAS
- Irregularities of distribution, VII
- On irregularities of distribution
- Note on irregularities of distribution
- Geometric discrepancy. An illustrated guide
- Greedy algorithms in Banach spaces
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item