Fast algorithms for component-by-component construction of rank-1 lattice rules in shift-invariant reproducing kernel Hilbert spaces
From MaRDI portal
Publication:3377002
Recommendations
- Fast component-by-component construction, a reprise for different kernels
- Fast component-by-component construction of rank-1 lattice rules with a non-prime number of points
- Component-by-component construction of good lattice rules with a composite number of points
- Reducing the construction cost of the component-by-component construction of good lattice rules
- A reduced fast component-by-component construction of lattice points for integration in weighted spaces with fast decreasing weights
Cites work
- scientific article; zbMATH DE number 53687 (Why is no real title available?)
- scientific article; zbMATH DE number 1246220 (Why is no real title available?)
- scientific article; zbMATH DE number 2051215 (Why is no real title available?)
- scientific article; zbMATH DE number 3273551 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- Component-by-component construction of good lattice rules
- Component-by-component constructions achieve the optimal rate of convergence for multivariate integration in weighted Korobov and Sobolev spaces
- Constructing Randomly Shifted Lattice Rules in Weighted Sobolev Spaces
- Fast component-by-component construction of rank-1 lattice rules with a non-prime number of points
- Liberating the weights
- Reducing the construction cost of the component-by-component construction of good lattice rules
Cited in
(only showing first 100 items - show all)- A note on the CBC-DBD construction of lattice rules with general positive weights
- Randomly shifted lattice rules with the optimal rate of convergence for unbounded integrands
- On a reduced component-by-component digit-by-digit construction of lattice point sets
- Quasi-Monte Carlo methods with applications in finance
- Good lattice rules based on the general weighted star discrepancy
- Weighted compound integration rules with higher order convergence for all N
- Quasi-Monte Carlo methods for linear two-stage stochastic programming problems
- Lattice rules with random \(n\) achieve nearly the optimal \(\mathcal{O}(n^{-\alpha-1/2})\) error independently of the dimension
- Some results on the complexity of numerical integration
- Constrained minimum energy designs
- QMC integration for lognormal-parametric, elliptic PDEs: local supports and product weights
- Comparison of Point Sets and Sequences for Quasi-Monte Carlo and for Random Number Generation
- Construction of interlaced scrambled polynomial lattice rules of arbitrary high order
- Digit-by-digit and component-by-component constructions of lattice rules for periodic functions with unknown smoothness
- Component-By-Component Construction of Good Intermediate-Rank Lattice Rules
- Multilevel Quasi-Monte Carlo Uncertainty Quantification for Advection-Diffusion-Reaction
- Lattice-based integration algorithms: Kronecker sequences and rank-1 lattices
- Constructing lattice rules based on weighted degree of exactness and worst case error
- Constructing lattice points for numerical integration by a reduced fast successive coordinate search algorithm
- Lattice rules in non-periodic subspaces of Sobolev spaces
- Successive coordinate search and component-by-component construction of rank-1 lattice rules
- A multi-index quasi-Monte Carlo algorithm for lognormal diffusion problems
- Multilevel QMC with product weights for affine-parametric, elliptic PDEs
- Optimal randomized changing dimension algorithms for infinite-dimensional integration on function spaces with ANOVA-type decomposition
- Collider physics at the precision frontier
- Stability of lattice rules and polynomial lattice rules constructed by the component-by-component algorithm
- Error Estimate of a Quasi-Monte Carlo Time-Splitting Pseudospectral Method for Nonlinear Schrödinger Equation with Random Potentials
- Construction of scrambled polynomial lattice rules over \(\mathbb{F}_{2}\) with small mean square weighted \(\mathcal{L}_{2}\) discrepancy
- A component-by-component construction for the trigonometric degree
- QMC computation of confidence intervals for a sleep performance model
- Model-free global likelihood subsampling for massive data
- Support points
- Ian Sloan and Lattice Rules
- A construction of polynomial lattice rules with small gain coefficients
- Effective dimension of some weighted pre-Sobolev spaces with dominating mixed partial derivatives
- Computation of the distribution of the maximum of stationary Gaussian processes
- Hiding the weights -- CBC black box algorithms with a guaranteed error bound
- Fast CBC construction of randomly shifted lattice rules achieving \(\mathcal{O}(n^{- 1 + \delta})\) convergence for unbounded integrands over \(\mathbb{R}^s\) in weighted spaces with POD weights
- Fast QMC matrix-vector multiplication
- Constructions of general polynomial lattice rules based on the weighted star discrepancy
- Multi-level quasi-Monte Carlo finite element methods for a class of elliptic PDEs with random coefficients
- Numerical scattering amplitudes with pySecDec
- Higher-order quasi-Monte Carlo for Bayesian shape inversion
- Transformed rank-1 lattices for high-dimensional approximation
- Variance bounds and existence results for randomly shifted lattice rules
- Quasi-Monte Carlo methods for two-stage stochastic mixed-integer programs
- Quasi-Monte Carlo methods for high-dimensional integration: the standard (weighted Hilbert space) setting and beyond
- Construction schemes for weighted lattice rules
- Fast construction of higher order digital nets for numerical integration in weighted Sobolev spaces
- A Tool for Custom Construction of QMC and RQMC Point Sets
- Embeddings of weighted Hilbert spaces and applications to multivariate and infinite-dimensional integration
- Numerical computation of multivariate normal probabilities using bivariate conditioning
- Quasi-Monte Carlo for highly structured generalised response models
- Existence and construction of shifted lattice rules with an arbitrary number of points and bounded weighted star discrepancy for general decreasing weights
- Shifted lattice rules based on a general weighted discrepancy for integrals over Euclidean space
- Quasi-Monte Carlo methods for elliptic PDEs with random coefficients and applications
- Analysis of quasi-Monte Carlo methods for elliptic eigenvalue problems with stochastic coefficients
- Richardson extrapolation of polynomial lattice rules
- Very low truncation dimension for high dimensional integration under modest error demand
- Good interlaced polynomial lattice rules for numerical integration in weighted Walsh spaces
- Medium-term power planning in electricity markets with pool and bilateral contracts
- Monte Carlo finite volume element methods for the convection-diffusion equation with a random diffusion coefficient
- Intermediate rank lattice rules and applications to finance
- The construction of good extensible rank-1 lattices
- Lattice algorithms for multivariate approximation in periodic spaces with general weight parameters
- Multidimensional pseudo-spectral methods on lattice grids
- Lattice-Nyström method for Fredholm integral equations of the second kind with convolution type kernels
- A reduced fast component-by-component construction of lattice points for integration in weighted spaces with fast decreasing weights
- Are quasi-Monte Carlo algorithms efficient for two-stage stochastic programs?
- Weighted integration over a hyperrectangle based on digital nets and sequences
- Fast component-by-component construction of lattice algorithms for multivariate approximation with POD and SPOD weights
- Fast component-by-component construction, a reprise for different kernels
- Constructing good higher order polynomial lattice rules with modulus of reduced degree
- Uncertainty Quantification Using Periodic Random Variables
- Tent-transformed lattice rules for integration and approximation of multivariate non-periodic functions
- Random geometries for optimal control PDE problems based on fictitious domain FEMs and cut elements
- Extrapolated polynomial lattice rule integration in computational uncertainty quantification
- Sensitivity analysis of an air pollution model with using innovative Monte Carlo methods in calculating multidimensional integrals
- Random-prime-fixed-vector randomised lattice-based algorithm for high-dimensional integration
- A GPU compatible quasi-Monte Carlo integrator interfaced to pySecDec
- The construction of good extensible Korobov rules
- Design and monitoring of multi-arm multi-stage clinical trials
- A note on concatenation of quasi-Monte Carlo and plain Monte Carlo rules in high dimensions
- QMC Galerkin discretization of parametric operator equations
- Periodization strategy may fail in high dimensions
- Computational higher order quasi-Monte Carlo integration
- Lattice algorithms for multivariate \(L_{\infty}\) approximation in the worst-case setting
- Construction-free median quasi-Monte Carlo rules for function spaces with unspecified smoothness and general weights
- Quasi--Monte Carlo Integration for Affine-Parametric, Elliptic PDEs: Local Supports and Product Weights
- Automatic evaluations of cross-derivatives
- Multilevel quasi-Monte Carlo integration with product weights for elliptic PDEs with lognormal coefficients
- A Universal Median Quasi-Monte Carlo Integration
- Good low degree rank-1 lattice rules of high dimension
- The analysis of vertex modified lattice rules in a non-periodic Sobolev space
- Randomly shifted lattice rules on the unit cube for unbounded integrands in high dimensions
- Modern Monte Carlo variants for uncertainty quantification in neutron transport
- On the choice of weights in a function space for quasi-Monte Carlo methods for a class of generalised response models in statistics
- Component-by-component digit-by-digit construction of good polynomial lattice rules in weighted Walsh spaces
- Lattice rules for nonperiodic smooth integrands
- Application of quasi-Monte Carlo methods to elliptic PDEs with random diffusion coefficients: a survey of analysis and implementation
This page was built for publication: Fast algorithms for component-by-component construction of rank-1 lattice rules in shift-invariant reproducing kernel Hilbert spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3377002)
