Part III. Quasi Monte Carlo methods 146/349
|
|
- Stella Sibyl Boone
- 6 years ago
- Views:
Transcription
1 Part III Quasi Monte Carlo methods 46/349
2 Outline Quasi Monte Carlo methods 47/349
3 Quasi Monte Carlo methods Let y = (y,...,y N ) be a vector of independent uniform random variables in Γ = [0,] N, u(y) : Γ V a given Hilbert-valued function and Q : V R a functional on V. We are interested in computing I N = Q(u(y))ρ(y)dy, Γ = [0,] N, ρ(y) = Γ A Monte Carlo approximation uses M points (ξ,...,ξ M ) sampled independently from the density ρ(y) and approximates I N as I N,M = M Q(u(ξ i )) (*) which can be seen as a quadrature formula with equal weights M. Question: while keeping the approximation form (*) with equal weights, is there a better distribution of points than the purely random one? Random points Sobol s points 48/349
4 Quasi Monte Carlo methods and Discrepancy Let P = {ξ,...ξ M } be a set of points ξ i [0,] N and f : [0,] N R a continuous function. A Quasi Monte Carlo method (QMC) to approximate I N (f) = [0,] N f(y)dy is an equal weight cubature formula of the form I N,M (f) = M f(ξ i ) The key concept in the analysis of QMC methods is the one of discrepancy. Let x [0,] N and [0,x] = [0,x ]... [0,x N ]. Local discrepancy: P (x) = # points in [0,x] M In formulae: P (x) = M Vol([0,x]) [0,x] (ξ i ) N x i x Star discrepancy : P,N = sup x [0,] N P (x) 49/349
5 Low discrepancy sequences Definition: a sequence (ξ,ξ 2,...), ξ i [0,] N is a low discrepancy sequence if the set of points P M = (ξ,...,ξ M ) satisfies P M,N C N (logm) N M. QMC methods use equal weight cubature formulae with low discrepancy sequences of points. Low order projections: let α {,...,N} a subset of indices, with #(α) = s; denote by ξ α the vector {ξ j, j α} and (ξ α,) the vector ξ with the components not included in α set to. The projected sequence P α M = (ξα,...,ξ α M) onto the α directions has discrepancy P α M,s P M,N Proof: P α M,s(x) = sup x α [0,] s ( M [0,x α ](ξ α i ) x i ) i α = sup y=(x α,) [0,] N ( M [0,y] (ξ i ) N y i ) P M,N 50/349
6 Implication: if P M,N (logm)n /M, the discrepancy of any projection on dimension s < N has to behave the same way or better! Exercice: How does the star discrepancy scale in M for: M random iid uniformly distributed points in [0,] N uniform grid of M points per edge /349
7 Low discrepancy sequences Several low discrepancy sequences exist, available also in Matlab (see e.g. [Niederreiter 92]): Halton, Hammersley, Sobol, Faure, Niederreiter,... The simplest example: Halton sequence. For integers i and b 2, we first define the radical inverse function φ b (i) as follows: if i = i n b n, i n {0,,...,b }, then φ b (i) = i n b n, n= so, in base b = 0, the radical inverse of i = 542 is φ 0 (i) = Then, if p,...,p N denote the first N prime numbers, the Halton sequence P = {ξ,ξ 2,...} is given by and its star-discrepancy satisfies ξ i = (φ p (i),φ p2 (i),...,φ pn (i)) N := sup x [0,] N P (x) = O ( (logm) N M ). n= Other (better) sequences such as Hammersley, Sobol, Faure,..., have ( ) (logm) a star-discrepancy N N = O. M 52/349
8 Having low discrepancy in high dimension is difficult from [Joe-Kuo, 2008]: two dimensional projections of 4096 Sobol points in dimension /349
9 Lattice rules Let M be the number of points we want to use and z N N be an integer vector whose components have no factor in common with M. { } iz rank-one lattice rule ξ i =, i = 0,...,M M where { } denotes the fractional part (of each component of the vector). The lattice rule quality depends heavily on the choice of the vector z. In 2D a good choice is M = fibonacci(k) and z = (,fibonacci(k )) z/m z/m M = 3, z = (,8) M = 55, z = (,34) 54/349
10 Lattice rules In higher dimension, there is no obvious generalization of the Fibonacci lattice. Let gcd(x,y) be the greatest common divisor of x and y. Each component z i of the vector z should be looked for in the set U M := {z Z : z M, gcd(z,m) = } so that each one-dimensional projection of the lattice has M distinct points. If M is prime, there are U M = M possible choices for each component z i. Component-by-Component (CBC) construction. Set z = for i = 2,...,N with z,...,z i held fixed, choose z i U M to minimize a desired error criterion in dimension i. end 55/349
11 A key formula for Error analysis D Let us consider first the N = dimensional case. The following error representation holds: M f(ξ i ) [0,] f(y)dy = P ()f() [0,] P (y)f (y)dy Proof: y [0,], and M f(y) = f() f(ξ i ) [0,] y f (t)dt = f() [0,] (y) 0 f (t) [0,t] (y)dt ( ) f(y)dy = f() [0,] (ξ i ) [0,] (y)dy M [0,] }{{} P ()=0 ( f ) (t) [0,t] (ξ i ) [0,t] (y)dy dt [0,] M [0,] }{{} P (t) 56/349
12 A key formula for Error analysis D Hence, the error in the QMC integration is bounded by f(ξ i ) f(y)dy M = P (y)f (y)dy P f L (0,) [0,] [0,] Remark : the norm f L can be replaced by V(f), the total variation of f in the sense of Hardy and Krause. Remark 2: One could use Holder with different exponents to obtain f(ξ i ) f(y)dy M P L p (0,) f L q (0,), with p + q =. [0,] 57/349
13 A key formula for error analysis The previous formula generalizes to arbitrary dimension in the following way: let [ : N] denotes the set of subsets of {,2,...,N}, including the empty set. For α [ : N], let y α denote the vector {y j, with j α} and (y α,) the vector y with the components not included in α set to. Then, letting #(α) be the cardinality of α, we have M f(ξ i ) [0,] N f(y)dy = α [:N] ( ) #(α) [0,] #(α) #(α) f y α (y α,) P (y α,)dy α (2) Define now the following space V,p = {f : [0,] N R, f,p < + }, with norm f,p = #(α) p p f (y α,) y α dy α α [:N] [0,] #(α) For p = 2, V,2 is a Hilbert space isomorphic to H mix ([0,]N ). It measures mixed first derivatives of the function f. 58/349
14 The Hmix k (Γ) space Space of functions with k mixed square integrable derivatives: let β = (β,...,β n ) N N and the seminorms The Hilbert space v 2 H k mix (Γ,V) = β =k Γ k v(y) y β yβ n n 2 ρ(y)dy. H k mix(γ,v) = {v L 2 ρ(γ,v) : k s=0 v 2 Hmix s (Γ,V) < + } is endowed with the norm k v 2 Hmix k (Γ,V) = s=0 v 2 H s mix (Γ,V). 59/349
15 Koksma-Hlawka inequality Let p <. Then, using Hölder s inequality in (2) we have f(y)dy [0,] M N f(ξ i ) P,q f,p, with p + q = In the case p = and q = this is known as Koksma-Hlawka inequality. The Quasi Monte Carlo error is bounded by the sum of the q-norm of the local discrepancies in all dimensions,...,n, provided the function has p-integrable mixed first derivatives. 60/349
16 Other equivalent norms (but the equivalence constant depends on N!) can be considered as well and analogous results obtained. See [Dick-Kuo-Sloan 3] for an extensive discussion. For example: Anchored Sobolev space: for c [0,] N f,2 = α [:N] [0,] #(α) #(α) f (y α,c) y α 2 dy α 2 Unanchored Sobolev space: f,2 = α [:N] [0,] #(α) ( [0,] N #(α) #(α) f y α (y α,y α )dy α ) 2 dy α 2 where y α denotes the vector {y j, j / α}. 6/349
17 Randomly shifted lattice rules To estimate the error in a Quasi Monte Carlo computation, the following stategy can be adopted. Let η U([0,] N ) be a uniformly distributed random vector (shift) and I N,M (f,η) = M f({ξ i +η}) the QMC formula with the random shift η. Observe that the shift preserves the lattice structure and E[f({ξ i +η})] = I N (f), for all i =...,M. Take s iid shifts η,...,η s U([0,] N ). Then Estimate of the integral I N,M (f) = s s j= I N,M (f,η s ) = sm s j= f({ξ i +η j }) Estimate of the MCS error based on the η sample standard deviation, (observe that there is no bias anymore!) i.e. e N,M (f) = c o s (s ) s ( IN,M (f,η j ) I N,M (f) ) 2 j= 62/349
18 Randomly shifted lattice rules Since we no longer have a bias error, we need to understand the resulting variance in the randomly shifted rules. The analysis goes through the reinterpretation of the induced Sobolev space as a Reproducing Kernel Hilbert Space (RKHS) and a representation of the worst mean square error in terms of the Kernel function. (See [Dick-Kuo-Sloan 3] for details) 63/349
19 Infinite dimensional approximation We have seen that the QMC error can be bounded by f(y)dy f(ξ [0,] M i ) P,q f,p (22) N Moreover, good low discrepancy sequences (Sobol, Faure, lattice rules,...) have a star-discrepancy P,N = P, = O(log(M) N /M). Is there hope for an infinite dimensional approximation N? Note: if all variables have the same importance in (22), we cannot take the limit N. However, infinite dimensional approximation can be achieved if the function f belongs to a weighted space. Let {γ α } α [:N] be a sequence of positive weights Anchored weighted Sobolev space f,2,γ = α [:N] γ α [0,] #(α) #(α) f (y α,c) y α Analogous definition for the unanchored version. 2 dy α 2 64/349
20 Infinite dimensional approximation Then, from the Zaremba identity we have f(y)dy f(ξ [0,] M i ) P,2, N γ f,2,γ The weights γ should be chosen such that f,2,γ < P,2, γ as small as possible 65/349
21 Infinite dimensional approximation in weighted space Product weights [Sloan-Woźniakowski] γ α = i αγ i, γ i < + Each variable is weighted differently. The intuition behind is that the variables y i for i become unimportant in the computation of the integral. Order dependent weights [Dick et al 06] γ α = β α, with β n n 0 Here we think that the terms involving many variables at the same time become unimportant in the computation of the integral as the number of involved variables increases. Product and Order Dependent (POD) weights [Kuo et al 2] n γ α = β α γ i, with β n 0 i α Efficient constructions of points by the CBC (Component-by-component) techniques corresponding to γ weights have been proposed in [Kuo-Joe, 03]. 66/349
22 A convergence result for Quasi Monte Carlo see [Dick-Kuo-Sloan 3, Theorem 5.0]: the error given by a shifted averaged lattice rule with CBC optimal construction of the generating vector z satisfies e N,M (f) = O ( loglogm M ) 2λ, λ ( 2, ] provided the function f belongs to the (anchored or unanchored) weighted space with weights γ α such that =α [:N] γ α λ ( ) #(α) 2ζ(2λ) (2π 2 ) λ +βλ < + where ζ( ) is the Riemann zeta function (observe that ζ(2λ) as λ 2 ) and β = 0 for the unanchored space and β = c2 c + 3 for the anchored space. This result shows that a limit rate M is possible even in infinite dimension if the integrand function belongs to a suitable weighted space, with sufficiently fast decaying weights. 67/349
23 Example elliptic PDE with random diffusivity coefficient We consider once again the model problem { div(a(x,y) u(x,y)) = f(x), x D, u(x,y) = 0, x D, y Γ := [ 3, 3] N with a(x,y) = ā+ N λi y i b i (x) (here N could be ), y i U( 3, 3) i.i.d., N 3λi b i δā for some 0 < δ <, so that u(y) L 2 (D) C u := C P Moreover, setting β i = ( δ)ā f L 2 (D). λi b i ( δ)ā, we assume that exists 0 < p s.t. N β p i C, p p, with C independent of N (23) Considering a linear funtional Q(u): will the random variable ψ(y) = Q(u(y)) belong to a certain weighted space W,2,γ for some suitable choice of weights γ α? ψ,2,γ = #(α) 2 γ α ψ(y α,0) y α (2 3) #(α)dy α α [:N] [ 3, 3] #(α) 2 < 68/349
24 Observe that #(α) ( ψ #(α) ) y α = Q u(y) y α Q V #(α) u(y) y α V so we have to check if u(y) belongs to the space W,2,γ (Γ;V), where V = H 0 (D) which we endow with the norm v V = v L 2 (D) We (formally) differentiate the equation with respect to y i at y = 0: first derivative yi. For all x D we have div(a(x,0) yi u(x,0)) = div( yi a(x,0) u(x,0)) = div( λ i b i (x) u(x,0)). Multiplying by yi u(x,0) and integrating by parts in x yields ( δ)ā yi u(,0) 2 L 2 (D) λ i b i u(,0) L 2 (D) y i u(,0) L 2 (D) so that yi u(,0) V β i C u second mixed derivative yi y j. For all x D we have div(a(x,0) y 2 i y j u(x,0)) = div( λ j b j (x) yi u(x,0))+div( λ i b i (x) yj u(x,0)). so that 2 y i y j u(,0) V β j yi u(,0) V +β i yj u(,0) V 2β i β j C u 69/349
25 Iterating the procedure, yields that for any α [ : N] we have #(α) y α u(,0) V C u #(α)! j αβ j Following [Kuo-Schwab-Sloan ], this in turn implies that u W,2,γ (Γ;V) with corresponding γ α = #(α)! j αβ j 2 p (*) with p as in (23). Indeed u 2 W,2,γ (Γ;V) C u 2 γ (#(α)!)2 α C 2 u C 2 u C 2 u α [:N] α [:N] α [:N] α N N (#(α)!) p j α #(α)! α! α! j j α β p α j j j α β p2 j β p j β 2 j = C 2 u j α p p α [:N] (#(α)!) p j α β p( p) j [use Hölder with p and p ] α [:N] j α α [:N] j α β p j β p j p p β p j = C 2 u ( j β p j )p j (+β p j ) p < + 70/349
26 Finally, for this choice of weights, the quantity ( 2ζ(2λ) γα λ (2π 2 ) λ +βλ =α [:N] ) #(α) is bounded for any λ = max{ p 2 p, 2 2δ }, δ > 0 (here β = /2 and with p as in (23)). Indeed, set σ(λ) = 2ζ(2λ) (2π 2 ) λ +2 λ. Then, since p (2 p)λ γα λ σ(λ)#(α) = (#(α)!) (2 p)λ α [:N] α [:N] σ(λ) j β (2 p)λ j j α σ(λ)β (2 p)λ j < since (2 p)λ p α [:N] #(α)! j α σ(λ)β (2 p)λ j Theorem [Kuo-Schwab-Sloan ] The Quasi Monte Carlo method with CBC construction of the lattice rule and weights (*) converges at rate O(M +δ ) for p < 2 3 2δ, O(M 2 p ) for 2 3 2δ < p with p as in (23) and for any δ > 0 (with a constant that blows up when δ 0). 7/349
27 Complexity analysis We now discretize the problem in space by finite elements and assume that y Γ, the discretization error Q(u(y)) Q(u h (y)) C h α The computational work to solve for each u h (ξ j ) is O(h dβ ). As in Monte Carlo, we can therefore choose M and h so as to { min h,m Mh dβ s.t. C h α +C 2 M γ TOL with γ = δ if p < 2 3 2δ and γ = p 2 if 2 3 2δ < p. which leads to a resulting complexity O(TOL γ dβ α ). Hence W TOL 2 δ dβ α, for p < 3 2δ W TOL 2p 2 2 p dβ α, for 3 2δ < p 72/349
28 Extensions of Quasi Monte Carlo Multilevel QMC [Kuo et al, 203] Higher order QMC, which aim to achieve a rate of convergence faster than linear, lattice rules that are extensible in number of points or dimension, more general pdfs and unbounded domains... 73/349
Tutorial on quasi-monte Carlo methods
Tutorial on quasi-monte Carlo methods Josef Dick School of Mathematics and Statistics, UNSW, Sydney, Australia josef.dick@unsw.edu.au Comparison: MCMC, MC, QMC Roughly speaking: Markov chain Monte Carlo
More informationQuasi-Monte Carlo integration over the Euclidean space and applications
Quasi-Monte Carlo integration over the Euclidean space and applications f.kuo@unsw.edu.au University of New South Wales, Sydney, Australia joint work with James Nichols (UNSW) Journal of Complexity 30
More informationApplication of QMC methods to PDEs with random coefficients
Application of QMC methods to PDEs with random coefficients a survey of analysis and implementation Frances Kuo f.kuo@unsw.edu.au University of New South Wales, Sydney, Australia joint work with Ivan Graham
More informationWhat s new in high-dimensional integration? designing for applications
What s new in high-dimensional integration? designing for applications Ian H. Sloan i.sloan@unsw.edu.au The University of New South Wales UNSW Australia ANZIAM NSW/ACT, November, 2015 The theme High dimensional
More informationAPPLIED MATHEMATICS REPORT AMR04/16 FINITE-ORDER WEIGHTS IMPLY TRACTABILITY OF MULTIVARIATE INTEGRATION. I.H. Sloan, X. Wang and H.
APPLIED MATHEMATICS REPORT AMR04/16 FINITE-ORDER WEIGHTS IMPLY TRACTABILITY OF MULTIVARIATE INTEGRATION I.H. Sloan, X. Wang and H. Wozniakowski Published in Journal of Complexity, Volume 20, Number 1,
More informationLow Discrepancy Sequences in High Dimensions: How Well Are Their Projections Distributed?
Low Discrepancy Sequences in High Dimensions: How Well Are Their Projections Distributed? Xiaoqun Wang 1,2 and Ian H. Sloan 2 1 Department of Mathematical Sciences, Tsinghua University, Beijing 100084,
More informationQuasi-Monte Carlo Methods for Applications in Statistics
Quasi-Monte Carlo Methods for Applications in Statistics Weights for QMC in Statistics Vasile Sinescu (UNSW) Weights for QMC in Statistics MCQMC February 2012 1 / 24 Quasi-Monte Carlo Methods for Applications
More informationProgress in high-dimensional numerical integration and its application to stochastic optimization
Progress in high-dimensional numerical integration and its application to stochastic optimization W. Römisch Humboldt-University Berlin Department of Mathematics www.math.hu-berlin.de/~romisch Short course,
More informationOn the Behavior of the Weighted Star Discrepancy Bounds for Shifted Lattice Rules
On the Behavior of the Weighted Star Discrepancy Bounds for Shifted Lattice Rules Vasile Sinescu and Pierre L Ecuyer Abstract We examine the question of constructing shifted lattice rules of rank one with
More informationIan Sloan and Lattice Rules
www.oeaw.ac.at Ian Sloan and Lattice Rules P. Kritzer, H. Niederreiter, F. Pillichshammer RICAM-Report 2016-34 www.ricam.oeaw.ac.at Ian Sloan and Lattice Rules Peter Kritzer, Harald Niederreiter, Friedrich
More informationOptimal Randomized Algorithms for Integration on Function Spaces with underlying ANOVA decomposition
Optimal Randomized on Function Spaces with underlying ANOVA decomposition Michael Gnewuch 1 University of Kaiserslautern, Germany October 16, 2013 Based on Joint Work with Jan Baldeaux (UTS Sydney) & Josef
More informationFast integration using quasi-random numbers. J.Bossert, M.Feindt, U.Kerzel University of Karlsruhe ACAT 05
Fast integration using quasi-random numbers J.Bossert, M.Feindt, U.Kerzel University of Karlsruhe ACAT 05 Outline Numerical integration Discrepancy The Koksma-Hlawka inequality Pseudo- and quasi-random
More informationImproved Discrepancy Bounds for Hybrid Sequences. Harald Niederreiter. RICAM Linz and University of Salzburg
Improved Discrepancy Bounds for Hybrid Sequences Harald Niederreiter RICAM Linz and University of Salzburg MC vs. QMC methods Hybrid sequences The basic sequences Deterministic discrepancy bounds The proof
More informationHot new directions for QMC research in step with applications
Hot new directions for QMC research in step with applications Frances Kuo f.kuo@unsw.edu.au University of New South Wales, Sydney, Australia Frances Kuo @ UNSW Australia p.1 Outline Motivating example
More informationDigital lattice rules
Digital lattice rules Multivariate integration and discrepancy estimates A thesis presented to The University of New South Wales in fulfilment of the thesis requirement for the degree of Doctor of Philosophy
More informationNew Multilevel Algorithms Based on Quasi-Monte Carlo Point Sets
New Multilevel Based on Quasi-Monte Carlo Point Sets Michael Gnewuch Institut für Informatik Christian-Albrechts-Universität Kiel 1 February 13, 2012 Based on Joint Work with Jan Baldeaux (UTS Sydney)
More informationFast evaluation of mixed derivatives and calculation of optimal weights for integration. Hernan Leovey
Fast evaluation of mixed derivatives and calculation of optimal weights for integration Humboldt Universität zu Berlin 02.14.2012 MCQMC2012 Tenth International Conference on Monte Carlo and Quasi Monte
More informationANOVA decomposition of convex piecewise linear functions
ANOVA decomposition of convex piecewise linear functions W. Römisch Abstract Piecewise linear convex functions arise as integrands in stochastic programs. They are Lipschitz continuous on their domain,
More informationSTRONG TRACTABILITY OF MULTIVARIATE INTEGRATION USING QUASI MONTE CARLO ALGORITHMS
MATHEMATICS OF COMPUTATION Volume 72, Number 242, Pages 823 838 S 0025-5718(02)01440-0 Article electronically published on June 25, 2002 STRONG TRACTABILITY OF MULTIVARIATE INTEGRATION USING QUASI MONTE
More informationLattice rules and sequences for non periodic smooth integrands
Lattice rules and sequences for non periodic smooth integrands dirk.nuyens@cs.kuleuven.be Department of Computer Science KU Leuven, Belgium Joint work with Josef Dick (UNSW) and Friedrich Pillichshammer
More informationQMC methods in quantitative finance. and perspectives
, tradition and perspectives Johannes Kepler University Linz (JKU) WU Research Seminar What is the content of the talk Valuation of financial derivatives in stochastic market models using (QMC-)simulation
More informationStochastic optimization, multivariate numerical integration and Quasi-Monte Carlo methods. W. Römisch
Stochastic optimization, multivariate numerical integration and Quasi-Monte Carlo methods W. Römisch Humboldt-University Berlin Institute of Mathematics www.math.hu-berlin.de/~romisch Chemnitzer Mathematisches
More informationQuasi- Monte Carlo Multiple Integration
Chapter 6 Quasi- Monte Carlo Multiple Integration Introduction In some sense, this chapter fits within Chapter 4 on variance reduction; in some sense it is stratification run wild. Quasi-Monte Carlo methods
More informationarxiv: v3 [math.na] 18 Sep 2016
Infinite-dimensional integration and the multivariate decomposition method F. Y. Kuo, D. Nuyens, L. Plaskota, I. H. Sloan, and G. W. Wasilkowski 9 September 2016 arxiv:1501.05445v3 [math.na] 18 Sep 2016
More informationMultilevel accelerated quadrature for elliptic PDEs with random diffusion. Helmut Harbrecht Mathematisches Institut Universität Basel Switzerland
Multilevel accelerated quadrature for elliptic PDEs with random diffusion Mathematisches Institut Universität Basel Switzerland Overview Computation of the Karhunen-Loéve expansion Elliptic PDE with uniformly
More informationNumerical Methods in Economics MIT Press, Chapter 9 Notes Quasi-Monte Carlo Methods. Kenneth L. Judd Hoover Institution.
1 Numerical Methods in Economics MIT Press, 1998 Chapter 9 Notes Quasi-Monte Carlo Methods Kenneth L. Judd Hoover Institution October 26, 2002 2 Quasi-Monte Carlo Methods Observation: MC uses random sequences
More informationInfinite-Dimensional Integration on Weighted Hilbert Spaces
Infinite-Dimensional Integration on Weighted Hilbert Spaces Michael Gnewuch Department of Computer Science, Columbia University, 1214 Amsterdam Avenue, New Yor, NY 10027, USA Abstract We study the numerical
More informationDiscrepancy Bounds for Deterministic Acceptance-Rejection Samplers
Discrepancy Bounds for Deterministic Acceptance-Rejection Samplers Houying Zhu Athesisinfulfilmentoftherequirementsforthedegreeof Doctor of Philosophy School of Mathematics and Statistics Faculty of Science
More informationScenario generation in stochastic programming
Scenario generation in stochastic programming Werner Römisch Humboldt-University Berlin, Institute of Mathematics, 10099 Berlin, Germany, romisch@math.hu-berlin.de Abstract Stability-based methods for
More informationEffective dimension of some weighted pre-sobolev spaces with dominating mixed partial derivatives
Effective dimension of some weighted pre-sobolev spaces with dominating mixed partial derivatives Art B. Owen Stanford University August 2018 Abstract This paper considers two notions of effective dimension
More informationChapter 8 Integral Operators
Chapter 8 Integral Operators In our development of metrics, norms, inner products, and operator theory in Chapters 1 7 we only tangentially considered topics that involved the use of Lebesgue measure,
More informationExponential Convergence and Tractability of Multivariate Integration for Korobov Spaces
Exponential Convergence and Tractability of Multivariate Integration for Korobov Spaces Josef Dick, Gerhard Larcher, Friedrich Pillichshammer and Henryk Woźniakowski March 12, 2010 Abstract In this paper
More informationA Belgian view on lattice rules
A Belgian view on lattice rules Ronald Cools Dept. of Computer Science, KU Leuven Linz, Austria, October 14 18, 2013 Atomium Brussels built in 1958 height 103m figure = 2e coin 5 10 6 in circulation Body
More informationRandom and Quasi-Random Point Sets
Peter Hellekalek Gerhard Larcher (Editors) Random and Quasi-Random Point Sets With contributions by JözsefBeck Peter Hellekalek Fred J. Hickemell Gerhard Larcher Pierre L'Ecuyer Harald Niederreiter Shu
More informationRandomized Quasi-Monte Carlo Simulation of Markov Chains with an Ordered State Space
Randomized Quasi-Monte Carlo Simulation of Markov Chains with an Ordered State Space Pierre L Ecuyer 1, Christian Lécot 2, and Bruno Tuffin 3 1 Département d informatique et de recherche opérationnelle,
More informationScenario generation Contents
Scenario generation W. Römisch Humboldt-University Berlin Department of Mathematics www.math.hu-berlin.de/~romisch Page 1 of 39 Tutorial, ICSP12, Halifax, August 14, 2010 (1) Aproximation issues (2) Generation
More information2 A Model, Harmonic Map, Problem
ELLIPTIC SYSTEMS JOHN E. HUTCHINSON Department of Mathematics School of Mathematical Sciences, A.N.U. 1 Introduction Elliptic equations model the behaviour of scalar quantities u, such as temperature or
More informationMathematical Methods for Neurosciences. ENS - Master MVA Paris 6 - Master Maths-Bio ( )
Mathematical Methods for Neurosciences. ENS - Master MVA Paris 6 - Master Maths-Bio (2014-2015) Etienne Tanré - Olivier Faugeras INRIA - Team Tosca October 22nd, 2014 E. Tanré (INRIA - Team Tosca) Mathematical
More informationarxiv: v2 [math.na] 15 Oct 2015
Optimal quasi-monte Carlo rules on order 2 digital nets for the numerical integration of multivariate periodic functions Aicke Hinrichs a, Lev Markhasin b, Jens Oettershagen c, Tino Ullrich c arxiv:1501.01800v2
More informationON TRACTABILITY OF WEIGHTED INTEGRATION OVER BOUNDED AND UNBOUNDED REGIONS IN R s
MATHEMATICS OF COMPTATION Volume 73, Number 248, Pages 1885 1901 S 0025-5718(04)01624-2 Article electronically published on January 5, 2004 ON TRACTABILITY OF WEIGHTED INTEGRATION OVER BONDED AND NBONDED
More informationSTOCHASTIC SAMPLING METHODS
STOCHASTIC SAMPLING METHODS APPROXIMATING QUANTITIES OF INTEREST USING SAMPLING METHODS Recall that quantities of interest often require the evaluation of stochastic integrals of functions of the solutions
More informationTractability of Multivariate Problems
Erich Novak University of Jena Chemnitz, Summer School 2010 1 Plan for the talk Example: approximation of C -functions What is tractability? Tractability by smoothness? Tractability by sparsity, finite
More informationLifting the Curse of Dimensionality
Lifting the Curse of Dimensionality Frances Y. Kuo and Ian H. Sloan Introduction Richard Bellman [1] coined the phrase the curse of dimensionality to describe the extraordinarily rapid growth in the difficulty
More informationGiovanni Migliorati. MATHICSE-CSQI, École Polytechnique Fédérale de Lausanne
Analysis of the stability and accuracy of multivariate polynomial approximation by discrete least squares with evaluations in random or low-discrepancy point sets Giovanni Migliorati MATHICSE-CSQI, École
More informationCompression on the digital unit sphere
16th Conference on Applied Mathematics, Univ. of Central Oklahoma, Electronic Journal of Differential Equations, Conf. 07, 001, pp. 1 4. ISSN: 107-6691. URL: http://ejde.math.swt.edu or http://ejde.math.unt.edu
More informationMATH 590: Meshfree Methods
MATH 590: Meshfree Methods Chapter 14: The Power Function and Native Space Error Estimates Greg Fasshauer Department of Applied Mathematics Illinois Institute of Technology Fall 2010 fasshauer@iit.edu
More informationLINEAR SECOND-ORDER EQUATIONS
LINEAR SECON-ORER EQUATIONS Classification In two independent variables x and y, the general form is Au xx + 2Bu xy + Cu yy + u x + Eu y + Fu + G = 0. The coefficients are continuous functions of (x, y)
More informationSobolevology. 1. Definitions and Notation. When α = 1 this seminorm is the same as the Lipschitz constant of the function f. 2.
Sobolevology 1. Definitions and Notation 1.1. The domain. is an open subset of R n. 1.2. Hölder seminorm. For α (, 1] the Hölder seminorm of exponent α of a function is given by f(x) f(y) [f] α = sup x
More informationScenario generation in stochastic programming with application to energy systems
Scenario generation in stochastic programming with application to energy systems W. Römisch Humboldt-University Berlin Institute of Mathematics www.math.hu-berlin.de/~romisch SESO 2017 International Thematic
More informationLow-discrepancy constructions in the triangle
Low-discrepancy constructions in the triangle Department of Statistics Stanford University Joint work with Art B. Owen. ICERM 29th October 2014 Overview Introduction 1 Introduction The Problem Motivation
More informationQuasi-Monte Carlo Algorithms with Applications in Numerical Analysis and Finance
Quasi-Monte Carlo Algorithms with Applications in Numerical Analysis and Finance Reinhold F. Kainhofer Rigorosumsvortrag, Institut für Mathematik Graz, 16. Mai 2003 Inhalt 1. Quasi-Monte Carlo Methoden
More informationarxiv: v1 [math.na] 13 Jul 2017
Richardson extrapolation of polynomial lattice rules Josef Dick, Takashi Goda, Takehito Yoshiki arxiv:707.03989v [math.na] 3 Jul 207 July 4, 207 Abstract We study multivariate numerical integration of
More informationCONVERGENCE THEORY. G. ALLAIRE CMAP, Ecole Polytechnique. 1. Maximum principle. 2. Oscillating test function. 3. Two-scale convergence
1 CONVERGENCE THEOR G. ALLAIRE CMAP, Ecole Polytechnique 1. Maximum principle 2. Oscillating test function 3. Two-scale convergence 4. Application to homogenization 5. General theory H-convergence) 6.
More informationJUHA KINNUNEN. Harmonic Analysis
JUHA KINNUNEN Harmonic Analysis Department of Mathematics and Systems Analysis, Aalto University 27 Contents Calderón-Zygmund decomposition. Dyadic subcubes of a cube.........................2 Dyadic cubes
More informationAdvanced Algorithms for Multidimensional Sensitivity Studies of Large-scale Air Pollution Models Based on Sobol Sequences
Advanced Algorithms for Multidimensional Sensitivity Studies of Large-scale Air Pollution Models Based on Sobol Sequences I. Dimov a,, R. Georgieva a, Tz. Ostromsky a, Z. Zlatev b a Department of Parallel
More informationCollocation methods for uncertainty quantification in PDE models with random data
Collocation methods for uncertainty quantification in PDE models with random data Fabio Nobile CSQI-MATHICSE, EPFL, Switzerland Acknowlegments: L. Tamellini, G. Migliorati (EPFL), R. Tempone, (KAUST),
More informationAPPLIED MATHEMATICS REPORT AMR04/2 DIAPHONY, DISCREPANCY, SPECTRAL TEST AND WORST-CASE ERROR. J. Dick and F. Pillichshammer
APPLIED MATHEMATICS REPORT AMR4/2 DIAPHONY, DISCREPANCY, SPECTRAL TEST AND WORST-CASE ERROR J. Dick and F. Pillichshammer January, 24 Diaphony, discrepancy, spectral test and worst-case error Josef Dick
More informationApproximation of stochastic optimization problems and scenario generation
Approximation of stochastic optimization problems and scenario generation W. Römisch Humboldt-University Berlin Institute of Mathematics 10099 Berlin, Germany http://www.math.hu-berlin.de/~romisch Page
More informationarxiv: v2 [math.na] 15 Aug 2018
Noname manuscript No. (will be inserted by the editor) Lattice rules in non-periodic subspaces of Sobolev spaces Takashi Goda Kosuke Suzuki Takehito Yoshiki arxiv:72.2572v2 [math.na] 5 Aug 28 Received:
More informationQUASI-RANDOM NUMBER GENERATION IN THE VIEW OF PARALLEL IMPLEMENTATION. 1. Introduction
Trends in Mathematics Information Center for Mathematical Sciences Volume 6, Number 2, December, 2003, Pages 155 162 QUASI-RANDOM NUMBER GENERATION IN THE VIEW OF PARALLEL IMPLEMENTATION CHI-OK HWANG Abstract.
More informationRegularity for Poisson Equation
Regularity for Poisson Equation OcMountain Daylight Time. 4, 20 Intuitively, the solution u to the Poisson equation u= f () should have better regularity than the right hand side f. In particular one expects
More informationAdapting quasi-monte Carlo methods to simulation problems in weighted Korobov spaces
Adapting quasi-monte Carlo methods to simulation problems in weighted Korobov spaces Christian Irrgeher joint work with G. Leobacher RICAM Special Semester Workshop 1 Uniform distribution and quasi-monte
More informationSobolev spaces. May 18
Sobolev spaces May 18 2015 1 Weak derivatives The purpose of these notes is to give a very basic introduction to Sobolev spaces. More extensive treatments can e.g. be found in the classical references
More informationIntroduction and Preliminaries
Chapter 1 Introduction and Preliminaries This chapter serves two purposes. The first purpose is to prepare the readers for the more systematic development in later chapters of methods of real analysis
More information4 Riesz Kernels. Since the functions k i (ξ) = ξ i. are bounded functions it is clear that R
4 Riesz Kernels. A natural generalization of the Hilbert transform to higher dimension is mutiplication of the Fourier Transform by homogeneous functions of degree 0, the simplest ones being R i f(ξ) =
More informationApproximation of High-Dimensional Numerical Problems Algorithms, Analysis and Applications
Approximation of High-Dimensional Numerical Problems Algorithms, Analysis and Applications Christiane Lemieux (University of Waterloo), Ian Sloan (University of New South Wales), Henryk Woźniakowski (University
More informationLOW DISCREPANCY SEQUENCES FOR THE ESTIMATION OF MIXED LOGIT MODELS
1 LOW DISCREPANCY SEQUENCES FOR THE ESTIMATION OF MIXED LOGIT MODELS Rodrigo A. Garrido and Mariela Silva Pontificia Universidad Católica de Chile Department of Transport Engineering Tel: 56-2-686 4270,
More informationLow Discrepancy Toolbox Manual. Michael Baudin
Low Discrepancy Toolbox Manual Michael Baudin Version 0.1 May 2013 Abstract This document is an introduction to the Low Discrepancy module v0.5. Contents 1 Gallery 4 1.1 The Van Der Corput sequence.............................
More informationConstruction Algorithms for Higher Order Polynomial Lattice Rules
Construction Algorithms for Higher Order Polynomial Lattice Rules Jan Baldeaux, Josef Dick, Julia Greslehner and Friedrich Pillichshammer Dedicated to Gerhard Larcher on the occasion of his 50th birthday
More informationRandom Number Generation: RNG: A Practitioner s Overview
Random Number Generation: A Practitioner s Overview Department of Computer Science Department of Mathematics Department of Scientific Computing Florida State University, Tallahassee, FL 32306 USA E-mail:
More informationSCRAMBLED GEOMETRIC NET INTEGRATION OVER GENERAL PRODUCT SPACES. Kinjal Basu Art B. Owen
SCRAMBLED GEOMETRIC NET INTEGRATION OVER GENERAL PRODUCT SPACES By Kinjal Basu Art B. Owen Technical Report No. 2015-07 March 2015 Department of Statistics STANFORD UNIVERSITY Stanford, California 94305-4065
More informationIntroduction to (randomized) quasi-monte Carlo
1 aft Introduction to (randomized) quasi-monte Carlo Dr Pierre L Ecuyer MCQMC Conference, Stanford University, August 2016 Program Monte Carlo, Quasi-Monte Carlo, Randomized quasi-monte Carlo QMC point
More informationEconomics 204 Fall 2011 Problem Set 1 Suggested Solutions
Economics 204 Fall 2011 Problem Set 1 Suggested Solutions 1. Suppose k is a positive integer. Use induction to prove the following two statements. (a) For all n N 0, the inequality (k 2 + n)! k 2n holds.
More informationQuadrature using sparse grids on products of spheres
Quadrature using sparse grids on products of spheres Paul Leopardi Mathematical Sciences Institute, Australian National University. For presentation at ANZIAM NSW/ACT Annual Meeting, Batemans Bay. Joint
More informationAn intractability result for multiple integration. I.H.Sloan y and H.Wozniakowski yy. University of New South Wales. Australia.
An intractability result for multiple integration I.H.Sloan y and H.Wozniakowski yy Columbia University Computer Science Technical Report CUCS-019-96 y School of Mathematics University of ew South Wales
More informationFourier Series. ,..., e ixn ). Conversely, each 2π-periodic function φ : R n C induces a unique φ : T n C for which φ(e ix 1
Fourier Series Let {e j : 1 j n} be the standard basis in R n. We say f : R n C is π-periodic in each variable if f(x + πe j ) = f(x) x R n, 1 j n. We can identify π-periodic functions with functions on
More informationQuasi-reducible Polynomials
Quasi-reducible Polynomials Jacques Willekens 06-Dec-2008 Abstract In this article, we investigate polynomials that are irreducible over Q, but are reducible modulo any prime number. 1 Introduction Let
More informationSobolev Spaces. Chapter Hölder spaces
Chapter 2 Sobolev Spaces Sobolev spaces turn out often to be the proper setting in which to apply ideas of functional analysis to get information concerning partial differential equations. Here, we collect
More informationA Randomized Quasi-Monte Carlo Simulation Method for Markov Chains
A Randomized Quasi-Monte Carlo Simulation Method for Markov Chains Pierre L Ecuyer GERAD and Département d Informatique et de Recherche Opérationnelle Université de Montréal, C.P. 6128, Succ. Centre-Ville,
More informationExercises - Chapter 1 - Chapter 2 (Correction)
Université de Nice Sophia-Antipolis Master MathMods - Finite Elements - 28/29 Exercises - Chapter 1 - Chapter 2 Correction) Exercise 1. a) Let I =], l[, l R. Show that Cl) >, u C Ī) Cl) u H 1 I), u DĪ).
More informationSupport points. May 26, Abstract
Support points Simon Mak, V. Roshan Joseph May 26, 2018 arxiv:1609.01811v6 [math.st] 8 Sep 2017 Abstract This paper introduces a new way to compact a continuous probability distribution F into a set of
More informationOn Aleksandrov-Bakelman-Pucci Type Estimates For Integro-Differential Equations
On Aleksandrov-Bakelman-Pucci Type Estimates For Integro-Differential Equations Russell Schwab Carnegie Mellon University 2 March 2012 (Nonlocal PDEs, Variational Problems and their Applications, IPAM)
More informationFinite-dimensional spaces. C n is the space of n-tuples x = (x 1,..., x n ) of complex numbers. It is a Hilbert space with the inner product
Chapter 4 Hilbert Spaces 4.1 Inner Product Spaces Inner Product Space. A complex vector space E is called an inner product space (or a pre-hilbert space, or a unitary space) if there is a mapping (, )
More informationHigh-Dimensional Problems: Multivariate Linear Tensor Product Problems, Multivariate Numerical Integration, and Geometric Discrepancy
High-Dimensional Problems: Multivariate Linear Tensor Product Problems, Multivariate Numerical Integration, and Geometric Discrepancy Habilitationsschrift vorgelegt von Michael Gnewuch Kiel 2009 1 Preface
More informationThe Calderon-Vaillancourt Theorem
The Calderon-Vaillancourt Theorem What follows is a completely self contained proof of the Calderon-Vaillancourt Theorem on the L 2 boundedness of pseudo-differential operators. 1 The result Definition
More informationCourse 212: Academic Year Section 1: Metric Spaces
Course 212: Academic Year 1991-2 Section 1: Metric Spaces D. R. Wilkins Contents 1 Metric Spaces 3 1.1 Distance Functions and Metric Spaces............. 3 1.2 Convergence and Continuity in Metric Spaces.........
More informationScenario Generation and Sampling Methods
Scenario Generation and Sampling Methods Tito Homem-de-Mello Güzin Bayraksan SVAN 2016 IMPA 9 13 May 2106 Let s Start with a Recap Sample Average Approximation We want to solve the true problem min {g(x)
More informationAxis-alignment in low-rank and other structures
Axis-alignment in low-rank and other structures Nick Trefethen, Oxford and ENS Lyon 1 Low-rank approximation 2 Quasi-Monte Carlo 3 Sparse grids 4 Multivariate polynomials Paper: Cubature, approximation,
More informationReduction of Variance. Importance Sampling
Reduction of Variance As we discussed earlier, the statistical error goes as: error = sqrt(variance/computer time). DEFINE: Efficiency = = 1/vT v = error of mean and T = total CPU time How can you make
More informationRandomized Quasi-Monte Carlo for MCMC
Randomized Quasi-Monte Carlo for MCMC Radu Craiu 1 Christiane Lemieux 2 1 Department of Statistics, Toronto 2 Department of Statistics, Waterloo Third Workshop on Monte Carlo Methods Harvard, May 2007
More informationWeierstraß-Institut. für Angewandte Analysis und Stochastik. Leibniz-Institut im Forschungsverbund Berlin e. V. Preprint ISSN
Weierstraß-Institut für Angewandte Analysis und Stochastik Leibniz-Institut im Forschungsverbund Berlin e. V. Preprint ISSN 2198-5855 Are Quasi-Monte Carlo algorithms efficient for two-stage stochastic
More informationMathematical Analysis Outline. William G. Faris
Mathematical Analysis Outline William G. Faris January 8, 2007 2 Chapter 1 Metric spaces and continuous maps 1.1 Metric spaces A metric space is a set X together with a real distance function (x, x ) d(x,
More informationdiv(f ) = D and deg(d) = deg(f ) = d i deg(f i ) (compare this with the definitions for smooth curves). Let:
Algebraic Curves/Fall 015 Aaron Bertram 4. Projective Plane Curves are hypersurfaces in the plane CP. When nonsingular, they are Riemann surfaces, but we will also consider plane curves with singularities.
More informationCan we do statistical inference in a non-asymptotic way? 1
Can we do statistical inference in a non-asymptotic way? 1 Guang Cheng 2 Statistics@Purdue www.science.purdue.edu/bigdata/ ONR Review Meeting@Duke Oct 11, 2017 1 Acknowledge NSF, ONR and Simons Foundation.
More informationNONLOCAL DIFFUSION EQUATIONS
NONLOCAL DIFFUSION EQUATIONS JULIO D. ROSSI (ALICANTE, SPAIN AND BUENOS AIRES, ARGENTINA) jrossi@dm.uba.ar http://mate.dm.uba.ar/ jrossi 2011 Non-local diffusion. The function J. Let J : R N R, nonnegative,
More informationIntegration of permutation-invariant. functions
permutation-invariant Markus Weimar Philipps-University Marburg Joint work with Dirk Nuyens and Gowri Suryanarayana (KU Leuven, Belgium) MCQMC2014, Leuven April 06-11, 2014 un Outline Permutation-invariant
More informationLow-discrepancy point sets lifted to the unit sphere
Low-discrepancy point sets lifted to the unit sphere Johann S. Brauchart School of Mathematics and Statistics, UNSW MCQMC 2012 (UNSW) February 17 based on joint work with Ed Saff (Vanderbilt) and Josef
More informationQuadrature using sparse grids on products of spheres
Quadrature using sparse grids on products of spheres Paul Leopardi Mathematical Sciences Institute, Australian National University. For presentation at 3rd Workshop on High-Dimensional Approximation UNSW,
More informationTRB 2005: For Presentation and Publication Paper # Final Submission: April 1, 2005 Word Count: 8,191
Simulation Estimation of Mixed Discrete Choice Models Using Randomized Quasi-Monte Carlo Sequences: A Comparison of Alternative Sequences, Scrambling Methods, and Uniform-to-Normal Variate Transformation
More informationLow discrepancy constructions in the triangle
Low discrepancy constructions in the triangle Kinjal Basu Stanford University Art B. Owen Stanford University March 014 Abstract Most quasi-monte Carlo research focuses on sampling from the unit cube.
More information