Ian H. Sloan

Ian H. Sloan

Auto-generated profile, based on publicly available information

Ian H. Sloan

School of Mathematics and Statistics, UNSW Sydney, Sydney, Australia

Research Focus & Metrics

Academic Career Length

63Years (1964-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
2 April 2013 in Acta Numerica
Verified
Journal Article
Closed access
PDF file
JDJosef Dick
Josef Dick
FKFrances Y. Kuo
Frances Y. Kuo
ISIan H. Sloan
Ian H. Sloan
This paper is a contemporary review of QMC (‘quasi-Monte Carlo’) methods, that is, equal-weight rules for the approximate evaluation of high-dimensional integrals over the unit cube [0,1]s, wheresmay be large, or even infinite. After a general introduction, the paper surveys recent developments in lattice methods, digital nets, and related themes. Among those recent developments are methods of construction of both lattices and digital nets, to yield QMC rules that have a prescribed rate of convergence for sufficiently smooth functions, and ideally also guaranteed slow growth (or no growth) of the worst-case error as s increases. A crucial role is played by parameters called ‘weights’, since a careful use of the weight parameters is needed to ensure that the worst-case errors in an appropriately weighted function space are bounded, or grow only slowly, as the dimension s increases. Important tools for the analysis are weighted function spaces, reproducing kernel Hilbert spaces, and discrepancy, all of which are discussed with an appropriate level of detail.

1 March 1998 in Journal of Complexity
Verified
Journal Article
Open access
ISIan H Sloan
Ian H Sloan
HWHenryk Woźniakowski
Henryk Woźniakowski
Recently, quasi-Monte Carlo algorithms have been successfully used for multivariate integration of high dimensiond, and were significantly more efficient than Monte Carlo algorithms. The existing theory of the worst case error bounds of quasi-Monte Carlo algorithms does not explain this phenomenon. This paper presents a partial answer to why quasi-Monte Carlo algorithms can work well for arbitrarily larged. It is done by identifying classes of functions for which the effect of the dimensiondis negligible. These areweightedclasses in which the behavior in the successive dimensions is moderated by a sequence of weights. We prove that the minimalworst caseerror of quasi-Monte Carlo algorithms does not depend on the dimensiondiff the sum of the weights is finite. We also prove that the minimal number of function values in the worst case setting needed to reduce the initial error by ε is bounded byCε−p, where the exponentp∈ [1, 2], andCdepends exponentially on the sum of weights. Hence, the relatively small sum of the weights makes some quasi-Monte Carlo algorithms strongly tractable. We show in a nonconstructive way that many quasi-Monte Carlo algorithms are strongly tractable. Even random selection of sample points (done once for the whole weighted class of functions and then the worst case error is established for that particular selection, in contrast to Monte Carlo where random selection of sample points is carried out for a fixed function) leads to strong tractable quasi-Monte Carlo algorithms. In this case the minimal number of function values in theworst casesetting is of order ε−pwith the exponentp= 2. The deterministic construction of strongly tractable quasi-Monte Carlo algorithms as well as the minimal exponentpis open

1 January 2012 in SIAM Journal on Numerical Analysis
Verified
Journal Article
Closed access
FKFrances Y. Kuo
Frances Y. Kuo
CSChristoph Schwab
Christoph Schwab
ISIan H. Sloan
Ian H. Sloan
In this paper quasi-Monte Carlo (QMC) methods are applied to a class of elliptic partial differential equations (PDEs) with random coefficients, where the random coefficient is parametrized by a countably infinite number of terms in a Karhunen--Loève expansion. Models of this kind appear frequently in numerical models of physical systems, and in uncertainty quantification. The method uses a QMC method to estimate expected values of linear functionals of the exact or approximate solution of the PDE, with the expected value considered as an infinite dimensional integral in the parameter space corresponding to the randomness induced by the random coefficient. The error analysis, arguably the first rigorous application of the modern theory of QMC in weighted spaces, exploits the regularity with respect to both the physical variables (the variables in the physical domain) and the parametric variables (the parameters corresponding to randomness). In the weighted-space theory of QMC methods, “weights,” describing the varying difficulty of different subsets of the variables, are introduced in order to make sure that the high-dimensional integration problem is tractable. It turns out that the weights arising from the present analysis are of a nonstandard kind, being of neither product nor order dependent form, but instead a hybrid of the two---we refer to these as “product and order dependent weights,” or “POD weights” for short. These POD weights are of a simple enough form to permit a component-by-component construction of a randomly shifted lattice rule that has optimal convergence properties for the given weighted space setting. If the terms in the expansion for the random coefficient have an appropriate decay property, and if we choose POD weights that minimize a certain upper bound on the error, then the solution of the PDE belongs to the joint function space needed for the analysis, and the QMC error (in the sense of a root-mean-square error averaged over shifts) is of order $\mathcal{O}(N^{-1+\delta})$ for arbitrary $\delta>0$, where $N$ denotes the number of sampling points in the parameter space. Moreover, this convergence rate and slower convergence rates under more relaxed conditions are achieved under conditions similar to those found recently by Cohen, De Vore, and Schwab [Found. Comput. Math., 10 (2010), pp. 615--646] for the same model by best $N$-term approximation. We analyze the impact of a finite element (FE) discretization on the overall efficiency of the scheme, in terms of accuracy versus overall cost, with results that are comparable to those of the best $N$-term approximation.

1 January 1996 in Mathematics of Computation
Verified
Journal Article
Open access
PDF file
CLCh. Lubich
Ch. Lubich
ISI. Sloan
I. Sloan
VTV. Thomée
V. Thomée
We study the numerical approximation of an integro-differential equation which is intermediate between the heat and wave equations. The proposed discretization uses convolution quadrature based on the first- and second-order backward difference methods in time, and piecewise linear finite elements in space. Optimal-order error bounds in terms of the initial data and the inhomogeneity are shown for positive times, without assumptions of spatial regularity of the data.

2 December 2014 in Numerische Mathematik
Verified
Journal Article
Closed access
PDF file
IGI. G. Graham
I. G. Graham
FKF. Y. Kuo
F. Y. Kuo
JNJ. A. Nichols
J. A. Nichols
RSR. Scheichl
R. Scheichl
CSCh. Schwab
Ch. Schwab
ISI. H. Sloan
I. H. Sloan

1 July 2004 in Advances in Computational Mathematics
Verified
Journal Article
Closed access
PDF file
ISIan H. Sloan
Ian H. Sloan
RWRobert S. Womersley
Robert S. Womersley