L₂-approximation using randomized lattice algorithms
From MaRDI portal
\(L 2\)-approximation using randomized lattice algorithms
Cites work
- A Monte Carlo method for integration of multivariate smooth functions
- A randomised lattice rule algorithm with pre-determined generating vector and random number of points for Korobov spaces with \(0 < \alpha \le 1/2\)
- A randomized lattice rule without component-by-component construction
- Approximate formulas for some functions of prime numbers
- Approximation of multivariate periodic functions based on sampling along multiple rank-1 lattices
- Approximation of multivariate periodic functions by trigonometric polynomials based on rank-1 lattice sampling
- Component-by-component construction of randomized rank-1 lattice rules achieving almost the optimal randomized error rate
- Constructing embedded lattice-based algorithms for multivariate function approximation with a composite number of points
- Construction of interlaced scrambled polynomial lattice rules of arbitrary high order
- Deterministic and stochastic error bounds in numerical analysis
- Fast algorithms for component-by-component construction of rank-1 lattice rules in shift-invariant reproducing kernel Hilbert spaces
- Fast approximation by periodic kernel-based lattice-point interpolation with application in uncertainty quantification
- Fast component-by-component construction of lattice algorithms for multivariate approximation with POD and SPOD weights
- Function integration, reconstruction and approximation using rank-\(1\) lattices
- Function values are enough for \(L_2\)-approximation
- Higher order scrambled digital nets achieve the optimal rate of the root mean square error for smooth integrands
- scientific article; zbMATH DE number 5049869 (Why is no real title available?)
- Lattice algorithms for multivariate approximation in periodic spaces with general weight parameters
- Lattice Rules
- Lattice rules for multivariate approximation in the worst case setting
- Lattice rules with random \(n\) achieve nearly the optimal \(\mathcal{O}(n^{-\alpha-1/2})\) error independently of the dimension
- Lattice-Nyström method for Fredholm integral equations of the second kind with convolution type kernels
- Optimal linear randomized methods for linear operators in Hilbert spaces
- Random-prime-fixed-vector randomised lattice-based algorithm for high-dimensional integration
- Randomizing the trapezoidal rule gives the optimal RMSE rate in Gaussian Sobolev spaces
- Sampling on energy-norm based sparse grids for the optimal recovery of Sobolev type functions in H^
- Scrambled net variance for integrals of smooth functions
- Spline methods using integration lattices and digital nets
- Tight error bounds for rank-1 lattice sampling in spaces of hybrid mixed smoothness
- Tractability of multivariate problems. Volume I: Linear information
- Tractability of multivariate problems. Volume II: Standard information for functionals.
- When are quasi-Monte Carlo algorithms efficient for high dimensional integrals?
This page was built for publication: \(L_2\)-approximation using randomized lattice algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7288059)
