Good interlaced polynomial lattice rules for numerical integration in weighted Walsh spaces

DOI10.1016/j.cam.2015.02.041zbMath1325.65038arXiv1306.4573OpenAlexW2014853427MaRDI QIDQ2345667

Takashi Goda

Publication date: 22 May 2015

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1306.4573

zbMATH Keywords

numerical integrationquasi-Monte Carlohigher order digital netsinterlaced polynomial lattice rules

Mathematics Subject Classification ID

Monte Carlo methods (65C05) Numerical integration (65D30)

Related Items (15)

MDFEM: Multivariate decomposition finite element method for elliptic PDEs with lognormal diffusion coefficients using higher-order QMC and FEM ⋮ Embeddings of weighted Hilbert spaces and applications to multivariate and infinite-dimensional integration ⋮ Construction of interlaced polynomial lattice rules for infinitely differentiable functions ⋮ Construction-Free Median Quasi-Monte Carlo Rules for Function Spaces with Unspecified Smoothness and General Weights ⋮ On a projection-corrected component-by-component construction ⋮ Computational Higher Order Quasi-Monte Carlo Integration ⋮ A Tool for Custom Construction of QMC and RQMC Point Sets ⋮ A Universal Median Quasi-Monte Carlo Integration ⋮ Higher order quasi-Monte Carlo integration for Bayesian PDE inversion ⋮ Application of quasi-Monte Carlo methods to elliptic PDEs with random diffusion coefficients: a survey of analysis and implementation ⋮ Richardson Extrapolation of Polynomial Lattice Rules ⋮ Constructing good higher order polynomial lattice rules with modulus of reduced degree ⋮ Digital nets with infinite digit expansions and construction of folded digital nets for quasi-Monte Carlo integration ⋮ Multilevel Higher Order QMC Petrov--Galerkin Discretization for Affine Parametric Operator Equations ⋮ Fast construction of higher order digital nets for numerical integration in weighted Sobolev spaces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Construction algorithms for higher order polynomial lattice rules
• Efficient calculation of the worst-case error and (fast) component-by-component construction of higher order polynomial lattice rules
• Construction of interlaced scrambled polynomial lattice rules of arbitrary high order
• When are quasi-Monte Carlo algorithms efficient for high dimensional integrals?
• Multivariate integration in weighted Hilbert spaces based on Walsh functions and weighted Sobolev spaces
• Fast construction of higher order digital nets for numerical integration in weighted Sobolev spaces
• Strong tractability of multivariate integration of arbitrary high order using digitally shifted polynomial lattice rules
• A class of generalized Walsh functions
• Fast algorithms for component-by-component construction of rank-1 lattice rules in shift-invariant reproducing kernel Hilbert spaces
• On Quasi-Monte Carlo Rules Achieving Higher Order Convergence
• Explicit Constructions of Quasi-Monte Carlo Rules for the Numerical Integration of High-Dimensional Periodic Functions
• Walsh Spaces Containing Smooth Functions and Quasi–Monte Carlo Rules of Arbitrary High Order
• Low-discrepancy point sets obtained by digital constructions over finite fields
• Quasi-Monte Carlo Finite Element Methods for a Class of Elliptic Partial Differential Equations with Random Coefficients
• Construction algorithms for polynomial lattice rules for multivariate integration
• Polynomial Lattice Point Sets
• A lower estimate for the error of quadrature formulae for certain classes of functions

This page was built for publication: Good interlaced polynomial lattice rules for numerical integration in weighted Walsh spaces