Pages that link to "Item:Q3377002"

The following pages link to Fast algorithms for component-by-component construction of rank-1 lattice rules in shift-invariant reproducing kernel Hilbert spaces (Q3377002):

Displaying 50 items.

• Very low truncation dimension for high dimensional integration under modest error demand (Q290796) (← links)
• Tent-transformed lattice rules for integration and approximation of multivariate non-periodic functions (Q306699) (← links)
• On combined component-by-component constructions of lattice point sets (Q346293) (← links)
• Construction of scrambled polynomial lattice rules over \(\mathbb{F}_{2}\) with small mean square weighted \(\mathcal{L}_{2}\) discrepancy (Q398623) (← links)
• Variance bounds and existence results for randomly shifted lattice rules (Q421840) (← links)
• A reduced fast component-by-component construction of lattice points for integration in weighted spaces with fast decreasing weights (Q458162) (← links)
• Quasi-Monte Carlo finite element methods for elliptic PDEs with lognormal random coefficients (Q495544) (← links)
• Application of quasi-Monte Carlo methods to elliptic PDEs with random diffusion coefficients: a survey of analysis and implementation (Q506617) (← links)
• Quasi-Monte Carlo methods for elliptic PDEs with random coefficients and applications (Q544544) (← links)
• Existence and construction of shifted lattice rules with an arbitrary number of points and bounded weighted star discrepancy for general decreasing weights (Q555032) (← links)
• A construction of polynomial lattice rules with small gain coefficients (Q644778) (← links)
• Weighted compound integration rules with higher order convergence for all \(N\) (Q663491) (← links)
• Efficient calculation of the worst-case error and (fast) component-by-component construction of higher order polynomial lattice rules (Q664602) (← links)
• 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)
• Liberating the dimension (Q708310) (← links)
• Multidimensional pseudo-spectral methods on lattice grids (Q765263) (← links)
• Shifted lattice rules based on a general weighted discrepancy for integrals over Euclidean space (Q843126) (← links)
• Lattice algorithms for multivariate \(L_{\infty}\) approximation in the worst-case setting (Q843730) (← links)
• Randomly shifted lattice rules for unbounded integrands (Q855892) (← links)
• The construction of good extensible Korobov rules (Q873153) (← links)
• Construction of interlaced scrambled polynomial lattice rules of arbitrary high order (Q887154) (← links)
• On a projection-corrected component-by-component construction (Q895985) (← links)
• Numerical integration in log-Korobov and log-cosine spaces (Q907580) (← links)
• Quasi-Monte Carlo for highly structured generalised response models (Q931378) (← links)
• Intermediate rank lattice rules and applications to finance (Q960285) (← links)
• Quasi-Monte Carlo methods with applications in finance (Q964676) (← links)
• Randomly shifted lattice rules with the optimal rate of convergence for unbounded integrands (Q964919) (← links)
• QMC integration for lognormal-parametric, elliptic PDEs: local supports and product weights (Q1713395) (← links)
• Constructing lattice points for numerical integration by a reduced fast successive coordinate search algorithm (Q1715796) (← links)
• Monte Carlo finite volume element methods for the convection-diffusion equation with a random diffusion coefficient (Q1718841) (← links)
• Lattice rules in non-periodic subspaces of Sobolev spaces (Q1719561) (← links)
• Medium-term power planning in electricity markets with pool and bilateral contracts (Q1753453) (← links)
• Random weights, robust lattice rules and the geometry of the \(cbcrc\) algorithm (Q1938427) (← links)
• Digit-by-digit and component-by-component constructions of lattice rules for periodic functions with unknown smoothness (Q1979419) (← links)
• Support points (Q1991669) (← links)
• Efficient multivariate approximation on the cube (Q1996231) (← links)
• Hiding the weights -- CBC black box algorithms with a guaranteed error bound (Q1996952) (← links)
• Optimal randomized changing dimension algorithms for infinite-dimensional integration on function spaces with ANOVA-type decomposition (Q2016136) (← links)
• Weighted integration over a hyperrectangle based on digital nets and sequences (Q2020573) (← links)
• Constrained minimum energy designs (Q2066732) (← links)
• Model-free global likelihood subsampling for massive data (Q2104012) (← links)
• Random geometries for optimal control PDE problems based on fictitious domain FEMs and cut elements (Q2141588) (← links)
• A note on concatenation of quasi-Monte Carlo and plain Monte Carlo rules in high dimensions (Q2145075) (← links)
• Component-by-component digit-by-digit construction of good polynomial lattice rules in weighted Walsh spaces (Q2165575) (← links)
• Stability of lattice rules and polynomial lattice rules constructed by the component-by-component algorithm (Q2196026) (← links)
• Collider physics at the precision frontier (Q2231921) (← links)
• Quasi-Monte Carlo methods for two-stage stochastic mixed-integer programs (Q2235151) (← links)
• 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 (Q2251914) (← links)
• Constructing good higher order polynomial lattice rules with modulus of reduced degree (Q2254684) (← links)