Constructing lattice points for numerical integration by a reduced fast successive coordinate search algorithm

DOI10.1016/j.cam.2018.10.046OpenAlexW2795456036WikidataQ128991469 ScholiaQ128991469MaRDI QIDQ1715796

Peter Kritzer, Adrian Ebert

Publication date: 29 January 2019

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

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

zbMATH Keywords

numerical integrationlattice pointsweighted function spacesquasi-Monte Carlo methodscomponent-by-component constructionpolynomial lattice points

Mathematics Subject Classification ID

Multidimensional problems (41A63) Approximate quadratures (41A55) Numerical quadrature and cubature formulas (65D32) Numerical integration (65D30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tent-transformed lattice rules for integration and approximation of multivariate non-periodic functions
• A reduced fast component-by-component construction of lattice points for integration in weighted spaces with fast decreasing weights
• Tractability of multivariate problems. Volume III: Standard information for operators
• On the convergence rate of the component-by-component construction of good lattice rules
• 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?
• Tractability of multivariate integration for weighted Korobov classes
• Component-by-component constructions achieve the optimal rate of convergence for multivariate integration in weighted Korobov and Sobolev spaces
• Successive coordinate search and component-by-component construction of rank-1 lattice rules
• Multivariate integration in weighted Hilbert spaces based on Walsh functions and weighted Sobolev spaces
• Component-by-component construction of good lattice rules with a composite number of points
• Integration and approximation in arbitrary dimensions
• Lattice rules for nonperiodic smooth integrands
• Fast component-by-component construction of rank-1 lattice rules with a non-prime number of points
• Good lattice rules in weighted Korobov spaces with general weights
• Monte Carlo and quasi-Monte Carlo sampling
• Fast algorithms for component-by-component construction of rank-1 lattice rules in shift-invariant reproducing kernel Hilbert spaces
• Low-discrepancy point sets obtained by digital constructions over finite fields
• A generalized discrepancy and quadrature error bound
• Quasi-Monte Carlo Finite Element Methods for a Class of Elliptic Partial Differential Equations with Random Coefficients
• Higher Order QMC Petrov--Galerkin Discretization for Affine Parametric Operator Equations with Random Field Inputs
• Construction algorithms for polynomial lattice rules for multivariate integration
• Introduction to Quasi-Monte Carlo Integration and Applications
• High-dimensional integration: The quasi-Monte Carlo way
• Constructing Embedded Lattice Rules for Multivariate Integration
• Theory of Reproducing Kernels

This page was built for publication: Constructing lattice points for numerical integration by a reduced fast successive coordinate search algorithm