Pages that link to "Item:Q2957059"
From MaRDI portal
The following pages link to On “Upper Error Bounds for Quadrature Formulas on Function Classes” by K.K. Frolov (Q2957059):
Displaying 17 items.
- Lattice rules with random \(n\) achieve nearly the optimal \(\mathcal{O}(n^{-\alpha-1/2})\) error independently of the dimension (Q666631) (← links)
- Lattice-based integration algorithms: Kronecker sequences and rank-1 lattices (Q681681) (← links)
- On the orthogonality of the Chebyshev-Frolov lattice and applications (Q1675297) (← links)
- A note on the dispersion of admissible lattices (Q1730266) (← links)
- Digital net properties of a polynomial analogue of Frolov's construction (Q1747931) (← links)
- Optimal order quadrature error bounds for infinite-dimensional higher-order digital sequences (Q1750388) (← links)
- Smooth fixed volume discrepancy, dispersion, and related problems (Q1801178) (← links)
- Numerical performance of optimized Frolov lattices in tensor product reproducing kernel Sobolev spaces (Q2040459) (← links)
- On generation and enumeration of orthogonal Chebyshev-Frolov lattices (Q2154566) (← links)
- Connections between numerical integration, discrepancy, dispersion, and universal discretization (Q2178666) (← links)
- Complexity of oscillatory integrals on the real line (Q2363514) (← links)
- Change of variable in spaces of mixed smoothness and numerical integration of multivariate functions on the unit cube (Q2402879) (← links)
- Consistency of randomized integration methods (Q2693691) (← links)
- An Explicit Construction of Optimal Order Quasi--Monte Carlo Rules for Smooth Integrands (Q2817786) (← links)
- Some Results on the Complexity of Numerical Integration (Q2957029) (← links)
- A Monte Carlo Method for Integration of Multivariate Smooth Functions (Q5347536) (← links)
- Lattice enumeration via linear programming (Q6191365) (← links)