1 January 2014 in SIAM Journal on Numerical Analysis
We construct quasi--Monte Carlo methods to approximate the expected values of linear functionals of Petrov--Galerkin discretizations of parametric operator equations which depend on a possibly infinite sequence of parameters. Such problems arise in the numerical solution of differential and integral equations with random field inputs. We analyze the regularity of the solutions with respect to the parameters in terms of the rate of decay of the fluctuations of the input field. If $p\in (0,1]$ denotes the “summability exponent” corresponding to the fluctuations in affine-parametric families of operators, then we prove that deterministic “interlaced polynomial lattice rules” of order $\alpha = \lfloor 1/p \rfloor+1$ in $s$ dimensions with $N$ points can be constructed using a fast component-by-component algorithm, in $\mathcal{O}(\alpha\,s\, N\log N + \alpha^2\,s^2 N)$ operations, to achieve a convergence rate of $\mathcal{O}(N^{-1/p})$, with the implied constant independent of $s$. This dimension-independen...
1 January 2010 in SIAM Journal on Numerical Analysis
We consider a multiscale approximation scheme at scattered sites for functions in Sobolev spaces on the unit sphere $\mathbb{S}^n$. The approximation is constructed using a sequence of scaled, compactly supported radial basis functions restricted to $\mathbb{S}^n$. A convergence theorem for the scheme is proved, and the condition number of the linear system is shown to stay bounded by a constant from level to level, thereby establishing for the first time a mathematical theory for multiscale approximation with scaled versions of a single compactly supported radial basis function at scattered data points.
1 January 2016 in SIAM/ASA Journal on Uncertainty Quantification
We analyze the convergence of higher order quasi--Monte Carlo (QMC) quadratures of solution functionals to countably parametric, nonlinear operator equations with distributed uncertain parameters taking values in a separable Banach space $X$ admitting an unconditional Schauder basis. Such equations arise in numerical uncertainty quantification with random field inputs. Unconditional bases of $X$ render the random inputs and the solutions of the forward problem countably parametric, deterministic. We show that these parametric solutions belong to a class of weighted Bochner spaces of functions of countably many variables, with a particular structure of the QMC quadrature weights: up to a (problem-dependent, and possibly large) finite dimension, product weights can be used, and beyond this dimension, weighted spaces with so-called smoothness-driven product-and-order dependent (SPOD) weights recently introduced in [F. Y. Kuo, Ch. Schwab, I. H. Sloan, SIAM J. Numer. Anal., 50 (2012), pp. 3351--3374] can be us...
1 January 2009 in SIAM Journal on Numerical Analysis
The purpose of this paper is to construct universal, auto-adaptive, localized, linear, polynomial (-valued) operators based on scattered data on the (hyper) sphere $\mathbb{S}^q$ ($q\ge2$). The approximation and localization properties of our operators are studied theoretically in deterministic as well as probabilistic settings. Numerical experiments are presented to demonstrate their superiority over traditional least squares and discrete Fourier projection polynomial approximations. An essential ingredient in our construction is the construction of quadrature formulas based on scattered data, exact for integrating spherical polynomials of (moderately) high degree. Our formulas are based on scattered sites; i.e., in contrast to such well-known formulas as Driscoll–Healy formulas, we need not choose the location of the sites in any particular manner. While the previous attempts to construct such formulas have yielded formulas exact for spherical polynomials of degree at most 18, we are able to construct formulas exact for spherical polynomials of degree 178.
1 January 2016 in SIAM Journal on Numerical Analysis
We develop a convergence analysis of a multilevel algorithm combining higher order quasi--Monte Carlo (QMC) quadratures with general Petrov--Galerkin discretizations of countably affine parametric ...
1 January 2019 in Computers & Mathematics with Applications