English
Related papers

Related papers: Error bounds for quasi-Monte Carlo integration for…

200 papers

Quasi-Monte Carlo methods have become the industry standard in computer graphics. For that purpose, efficient algorithms for low discrepancy sequences are discussed. In addition, numerical pitfalls encountered in practice are revealed. We…

Graphics · Computer Science 2023-07-31 Alexander Keller , Carsten Wächter , Nikolaus Binder

There has been a surge of interest in uncertainty quantification for parametric partial differential equations (PDEs) with Gevrey regular inputs. The Gevrey class contains functions that are infinitely smooth with a growth condition on the…

Numerical Analysis · Mathematics 2025-09-18 Philipp A. Guth , Vesa Kaarnioja

Monte Carlo and Quasi-Monte Carlo methods present a convenient approach for approximating the expected value of a random variable. Algorithms exist to adaptively sample the random variable until a user defined absolute error tolerance is…

Numerical Analysis · Mathematics 2023-11-14 Aleksei G. Sorokin , Jagadeeswaran Rathinavel

Given a real symmetric positive semi-definite matrix E, and an approximation S that is a sum of n independent matrix-valued random variables, we present bounds on the relative error in S due to randomization. The bounds do not depend on the…

Numerical Analysis · Mathematics 2018-01-03 John T. Holodnak , Ilse C. F. Ipsen , Ralph C. Smith

We study the complexity of approximating integrals of smooth functions at absolute precision $\varepsilon > 0$ with confidence level $1 - \delta \in (0,1)$. The optimal error rate for multivariate functions from classical isotropic Sobolev…

Numerical Analysis · Mathematics 2018-09-27 Robert J. Kunsch , Daniel Rudolf

We consider the problem of evaluating $I(\varphi):=\int_{[0,1)^s}\varphi(x) dx$ for a function $\varphi \in L^2[0,1)^{s}$. In situations where $I(\varphi)$ can be approximated by an estimate of the form $N^{-1}\sum_{n=0}^{N-1}\varphi(x^n)$,…

Computation · Statistics 2015-06-09 Mathieu Gerber

Importance sampling Monte-Carlo methods are widely used for the approximation of expectations with respect to partially known probability measures. In this paper we study a deterministic version of such an estimator based on quasi-Monte…

Computation · Statistics 2024-12-20 Josef Dick , Daniel Rudolf , Houying Zhu

We study correlation bounds under pairwise independent distributions for functions with no large Fourier coefficients. Functions in which all Fourier coefficients are bounded by $\delta$ are called $\delta$-{\em uniform}. The search for…

Probability · Mathematics 2010-11-09 Per Austrin , Elchanan Mossel

Quantiles and expected shortfalls are usually used to measure risks of stochastic systems, which are often estimated by Monte Carlo methods. This paper focuses on the use of quasi-Monte Carlo (QMC) method, whose convergence rate is…

Numerical Analysis · Mathematics 2020-05-07 Zhijian He , Xiaoqun Wang

We consider the problem of estimating an expectation $ \mathbb{E}\left[ h(W)\right]$ by quasi-Monte Carlo (QMC) methods, where $ h $ is an unbounded smooth function on $ \mathbb{R}^d $ and $ W$ is a standard normal distributed random…

Numerical Analysis · Mathematics 2024-11-08 Du Ouyang , Xiaoqun Wang , Zhijian He

This is basically a review of the field of Quasi-Monte Carlo intended for computational physicists and other potential users of quasi-random numbers. As such, much of the material is not new, but is presented here in a style hopefully more…

High Energy Physics - Phenomenology · Physics 2010-11-11 Fred James , Jiri Hoogland , Ronald Kleiss

Quasi-Monte Carlo rules are equal weight quadrature rules defined over the domain $[0,1]^s$. Here we introduce quasi-Monte Carlo type rules for numerical integration of functions defined on $\mathbb{R}^s$. These rules are obtained by way of…

Numerical Analysis · Mathematics 2010-11-12 Josef Dick

We study numerical integration on the unit sphere $\mathbb{S}^2 \subset \mathbb{R}^3$ using equal weight quadrature rules, where the weights are such that constant functions are integrated exactly. The quadrature points are constructed by…

Numerical Analysis · Mathematics 2014-02-17 Johann S. Brauchart , Josef Dick

Monte Carlo (MC) and Quasi-Monte Carlo (QMC) methods are classical approaches for the numerical integration of functions $f$ over $[0,1]^d$. While QMC methods can achieve faster convergence rates than MC in moderate dimensions, their…

Numerical Analysis · Mathematics 2025-08-27 Jiaheng Chen , Haotian Jiang , Nathan Kirk

We continue the study of restricted Monte Carlo algorithms in a general setting. Here we show a lower bound for minimal errors in the setting with finite restriction in terms of deterministic minimal errors. This generalizes a result of…

Numerical Analysis · Mathematics 2020-12-24 Stefan Heinrich

Quasi-Monte Carlo methods are designed for integrands of bounded variation, and this excludes singular integrands. Several methods are known for integrands that become singular on the boundary of the unit cube $[0,1]^d$ or at isolated…

Numerical Analysis · Mathematics 2017-04-13 Kinjal Basu , Art B. Owen

CIPM published the Supplement I for GUM in 2008 as not only an alternative approach to estimate the uncertainty for a given calibration measurement but also as a proper uncertainty estimation one, whenever any of the conditions imposed in…

Data Analysis, Statistics and Probability · Physics 2010-12-15 Thang H. L. , Nguyen D. D. , Dung D. N.

We study an optimal control problem under uncertainty, where the target function is the solution of an elliptic partial differential equation with random coefficients, steered by a control function. The robust formulation of the…

Numerical Analysis · Mathematics 2019-10-23 Philipp A. Guth , Vesa Kaarnioja , Frances Y. Kuo , Claudia Schillings , Ian H. Sloan

This paper studies the rate of convergence for conditional quasi-Monte Carlo (QMC), which is a counterpart of conditional Monte Carlo. We focus on discontinuous integrands defined on the whole of $R^d$, which can be unbounded. Under…

Numerical Analysis · Mathematics 2018-06-07 Zhijian He

Spectral clustering is a popular unsupervised learning technique which is able to partition unlabelled data into disjoint clusters of distinct shapes. However, the data under consideration are often experimental data, implying that the data…

Machine Learning · Statistics 2025-05-26 Jürgen Dölz , Jolanda Weygandt