Quasi-Monte Carlo integration over the Euclidean space and applications

Size: px
Start display at page:

Download "Quasi-Monte Carlo integration over the Euclidean space and applications"

Transcription

1 Quasi-Monte Carlo integration over the Euclidean space and applications University of New South Wales, Sydney, Australia joint work with James Nichols (UNSW) Journal of Complexity 30 (204)

2 MC v.s. QMC in the unit cube [0,] s g(x)dx n n i= g(t i ) Monte Carlo method Quasi-Monte Carlo methods t i random uniform t i deterministic n /2 convergence close to n convergence or better 0 64 random points 0 First 64 points of a 2D Sobol sequence 0 A lattice rule with 64 points more effective for earlier variables and lower-order projections order of variables irrelevant order of variables very important use randomized QMC methods for error estimation

3 QMC Two main families of QMC methods: (t,m,s)-nets and (t,s)-sequences lattice rules 0 First 64 points of a 2D Sobol sequence 0 A lattice rule with 64 points (0,6,2)-net Having the right number of points in various sub-cubes A group under addition modulo Z and includes the integer points Niederreiter book (992) Sloan and Joe book (994) Important developments: component-by-component (CBC) construction higher order digital nets Dick and Pillichshammer book (200) Dick, Kuo, Sloan Acta Numerica (203)

4 Standard QMC analysis Worst case error bound g(x)dx [0,] s n n g(t i ) ewor γ (t,...,t n ) g γ i= Standard setting weighted Sobolev space g 2 γ = u g 2 (x u ;0) dx x u u u {:s} γ u [0,] u 2 s subsets anchor at 0 (also unanchored ) weights Mixed first derivatives are square integrable Small weight γ u means that g depends weakly on the variables x u Choose weights to minimize the error bound ( ) /(2λ) ( 2 γ λ u n a b u u u {:s} }{{} bound on worst case error (CBC) u {:s} γ u ) /2 } {{ } bound on norm γ u = Construct points (CBC) to minimize the worst case error ( bu a u ) /(+λ)

5 Practical problems do not fit... Practical integral over the Euclidean space q(z)ρ(z)dz. Transformation R s (translation, rotation, rescaling) = f(y) φ(y j )dy φ is any univariate pdf R s = [0,] s f(φ (x))dx 2. Mapping to unit cube φ - pdf Φ - cdf Φ - icdf n n f(φ (t i )) 3. Applying QMC i= Transformed integrand g = f Φ rarely falls in the standard setting!

6 Application : option pricing Black-Scholes model: stock price follows a geometric Brownian motion = = R s max ( s s ( max R s s [0,] s max ) exp( 2 S j (z) K,0 zt Σ z) (2π) s det(σ) dz s ( s S j (Ay) K,0 s RW/BB/PCA. Transformation Write Σ = AA T Sub. z = Ay ) s S j (AΦ nor(x)) K,0 φ nor (y j )dy ) dx 2. Mapping to the cube Sub. y = Φ nor (x) standard error S j (z) = exp( a j z j ) MC QMC + PCA naive QMC n Issues: unbounded near the boundary of the unit cube, and kink, i.e., no square-integrable mixed first derivatives

7 Application 2: maximum likelihood Generalized linear mixed model [K., Dunsmuir, Sloan, Wand, Womersley (2008)] R s ( s exp(τ j (β + z j ) e β+z j) τ j! ) exp( 2 zt Σ z) (2π) s det(σ) dz If we write Σ = AA T and substitute z = Ay followed by y = Φ nor (x), then we get very bad results... no re-scaling (bad) no centering and no re-scaling (worse)

8 Application 2: maximum likelihood Generalized linear mixed model [K., Dunsmuir, Sloan, Wand, Womersley (2008)] exp(t(z))dz R s = c exp(t(a y + z )) φ(y j )dy R s φ(y j ) }{{} f(y) = c exp(f(a Φ (x) + z )) (0,) s φ(φ du (x j )) }{{} g(x)=f(φ (x)) φ normal (good). Transformation [centering, re-scaling] Sub. z = A y + z 2. Mapping to the cube [φ free to choose] Sub. y = Φ (x) φ logistic (better) Issues: unbounded near the boundary of the unit cube, or huge derivatives near the boundary of the unit cube φ Student-t (best)

9 Application 3: PDE with random coeff. Elliptic PDE with lognormal random coefficient = R s G(u(,y)) (a( x,y) u( x,y)) = forcing( x), x D R d, d =,2,3 ( s ) a( x,y) = exp µj ξ j ( x)y j, y j i.i.d. normal φ nor (y j )dy [0,] s G(u(,Φ nor (x))dx G linear functional [Graham, K., Nuyens, Scheichl, Sloan (200)] circulant embedding [K., Schwab, Sloan (20,202,204)] uniform case, POD weights, fast CBC, multilevel Differentiate the PDE to estimate the norm of integrand Minimize the error bound POD weights γ u = Γ u [Dick, K., Le Gia, Nuyens, Schwab (204)] higher order [Dick, K., Le Gia, Schwab (204)] higher order, multilevel etc. j u γ j

10 A non-standard setting Change of variables R s q(z)ρ(z)dz = f(y) R s φ(y j )dy = f(φ (x))dx [0,] s g = f Φ rarely belongs to weighted Sobolev space Non-standard norm [Wasilkowski & Woźniakowski (2000)] f 2 γ = u f 2 (y u ;0) ψ 2 (y y u j )dy u u {:s} γ u R u weight function Nichols & K. (204) cf. [K., Sloan, Wasilkowski, Waterhouse (200)] Also unanchored variant, coordinate dependent ψ j Randomly shifted lattice rules CBC error bound for general weights γ u Convergence rate depends on the relationship between φ and ψ Fast CBC for POD weights γ u = Γ u j u γ j Important for applications: φ and ψ and γ u are up to us to choose (tune)

11 std.err. Application 3: PDE with random coeff. Elliptic PDE with lognormal random coefficient = R s G(u(,y)) (a( x,y) u( x,y)) = forcing( x), x D R d, d =,2,3 ( s ) a( x,y) = exp µj ξ j ( x)y j, y j i.i.d. normal φ nor (y j )dy [0,] s G(u(,Φ nor (x))dx G linear functional Graham, K., Nichols, Scheichl, Schwab, Sloan (204) Differentiate PDE to obtain bound on the norm 0 - ν =0.75, λ C =0. Choose φ φ nor Choose ψ j (y j ) = exp( α j y j ), α j > 0 Choose POD weights γ u = Γ u j u γ j

12 Application 2: maximum likelihood Generalized linear mixed model exp(t(z))dz R s = c exp(t(a y + z )) R s φ(y j ) }{{} f(y) φ(y j )dy = c exp(f(a Φ (x) + z )) (0,) s φ(φ du (x j )) }{{} Sinescu, K., Sloan (203) g(x)=f(φ (x)) Differentiate integrand to obtain bound on the norm φ normal (good) φ logistic (better) Choose φ φ nor or φ logit or φ stud Choose ψ Choose POD weights γ u = Γ u j u γ j φ Student-t (best)

13 Application : option pricing Black-Scholes model = = R s max ( s s ( max R s s [0,] s max ) exp( 2 S j (z) K,0 zt Σ z) (2π) s det(σ) dz s ( s S j (Ay) K,0 s ) s S j (AΦ nor(x)) K,0 φ nor (y j )dy ) dx standard error S j (z) = exp( a j z j ) 0 0 MC naive QMC QMC + PCA Griebel, K., Sloan (200, 203, 204) ANOVA decomposition: g = u {:s} g u in [0,] s n or f = u f u in R s RW/BB: all g u with u s+ belong to Sobolev space; PCA: similar 2 RW/BB: all f u with u { : s} are smooth; PCA: similar ANOVA decomposition for -variate function f: all terms are smooth Remains to see how to apply the theory of Nichols & K. (204)

14 Summary Nice QMC theory over the unit cube Transformed integrand rarely falls in the standard setting q(z)ρ(z)dz = f(y) φ(y j )dy = f(φ (x))dx R s R s [0,] s Non-standard setting f 2 γ = u {:s} γ u R u u f 2 (y u ;0) y u φ and ψ and γ u are up to us to choose (tune) ψ 2 (y j )dy u Application Transformation φ ψ γ u 3. PDE φ nor exp( α j y) POD 2. likelihood centering, re-scaling φ nor,φ logit,φ stud POD. option RW, BB, PCA φ nor???

Hot new directions for QMC research in step with applications

Hot 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 information

Application of QMC methods to PDEs with random coefficients

Application 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 information

Quasi-Monte Carlo Methods for Applications in Statistics

Quasi-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 information

What s new in high-dimensional integration? designing for applications

What 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 information

New Multilevel Algorithms Based on Quasi-Monte Carlo Point Sets

New 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 information

Optimal Randomized Algorithms for Integration on Function Spaces with underlying ANOVA decomposition

Optimal 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 information

Tutorial on quasi-monte Carlo methods

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 information

Fast 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. 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 information

Part III. Quasi Monte Carlo methods 146/349

Part III. Quasi Monte Carlo methods 146/349 Part III Quasi Monte Carlo methods 46/349 Outline Quasi Monte Carlo methods 47/349 Quasi Monte Carlo methods Let y = (y,...,y N ) be a vector of independent uniform random variables in Γ = [0,] N, u(y)

More information

FAST QMC MATRIX-VECTOR MULTIPLICATION

FAST QMC MATRIX-VECTOR MULTIPLICATION FAST QMC MATRIX-VECTOR MULTIPLICATION JOSEF DICK, FRANCES Y. KUO, QUOC T. LE GIA, CHRISTOPH SCHWAB Abstract. Quasi-Monte Carlo (QMC) rules 1/N N 1 n=0 f(y na) can be used to approximate integrals of the

More information

Progress in high-dimensional numerical integration and its application to stochastic optimization

Progress 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 information

A Practical Guide to Quasi-Monte Carlo Methods

A Practical Guide to Quasi-Monte Carlo Methods A Practical Guide to Quasi-Monte Carlo Methods Frances Y. Kuo and Dirk Nuyens Abstract These notes are prepared for the short course on High-dimensional Integration: the Quasi-Monte Carlo Way, to be held

More information

QMC methods in quantitative finance. and perspectives

QMC 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 information

APPLIED 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. 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 information

ANOVA decomposition of convex piecewise linear functions

ANOVA 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 information

Lattice rules and sequences for non periodic smooth integrands

Lattice 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 information

Lifting the Curse of Dimensionality

Lifting 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 information

High dimensional integration of kinks and jumps smoothing by preintegration. Andreas Griewank, Frances Y. Kuo, Hernan Leövey and Ian H.

High dimensional integration of kinks and jumps smoothing by preintegration. Andreas Griewank, Frances Y. Kuo, Hernan Leövey and Ian H. High dimensional integration of kinks and jumps smoothing by preintegration Andreas Griewank, Frances Y. Kuo, Hernan Leövey and Ian H. Sloan August 2017 arxiv:1712.00920v1 [math.na] 4 Dec 2017 Abstract

More information

Low Discrepancy Sequences in High Dimensions: How Well Are Their Projections Distributed?

Low 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 information

Stochastic 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 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 information

On 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 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 information

arxiv: v1 [math.na] 7 Nov 2017

arxiv: v1 [math.na] 7 Nov 2017 Combining Sparse Grids, Multilevel MC and QMC for Elliptic PDEs with Random Coefficients Michael B. Giles Frances Y. Kuo Ian H. Sloan arxiv:1711.02437v1 [math.na] 7 Nov 2017 Abstract Building on previous

More information

Quasi-Monte Carlo for Highly Structured Generalised Response Models

Quasi-Monte Carlo for Highly Structured Generalised Response Models Quasi-Monte Carlo for Highly Structured Generalised Response Models BY F.Y. KUO, W.T.M. DUNSMUIR, I.H. SLOAN, M.P. WAND AND R.S. WOMERSLEY School of Mathematics and Statistics, University of New South

More information

Ian Sloan and Lattice Rules

Ian 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 information

-Variate Integration

-Variate Integration -Variate Integration G. W. Wasilkowski Department of Computer Science University of Kentucky Presentation based on papers co-authored with A. Gilbert, M. Gnewuch, M. Hefter, A. Hinrichs, P. Kritzer, F.

More information

The ANOVA decomposition of a non-smooth function of infinitely many variables can have every term smooth

The ANOVA decomposition of a non-smooth function of infinitely many variables can have every term smooth Wegelerstraße 6 53115 Bonn Germany phone +49 228 73-3427 fax +49 228 73-7527 www.ins.uni-bonn.de M. Griebel, F.Y. Kuo and I.H. Sloan The ANOVA decomposition of a non-smooth function of infinitely many

More information

Approximation of High-Dimensional Numerical Problems Algorithms, Analysis and Applications

Approximation 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 information

Effective 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 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 information

Digital lattice rules

Digital 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 information

Numerical Methods II

Numerical Methods II Numerical Methods II Prof. Mike Giles mike.giles@maths.ox.ac.uk Oxford University Mathematical Institute MC Lecture 13 p. 1 Quasi-Monte Carlo As in lecture 6, quasi-monte Carlo methods offer much greater

More information

arxiv: v3 [math.na] 18 Sep 2016

arxiv: 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 information

On Infinite-Dimensional Integration in Weighted Hilbert Spaces

On Infinite-Dimensional Integration in Weighted Hilbert Spaces On Infinite-Dimensional Integration in Weighted Hilbert Spaces Sebastian Mayer Universität Bonn Joint work with M. Gnewuch (UNSW Sydney) and K. Ritter (TU Kaiserslautern). HDA 2013, Canberra, Australia.

More information

APPLIED MATHEMATICS REPORT AMR04/2 DIAPHONY, DISCREPANCY, SPECTRAL TEST AND WORST-CASE ERROR. J. Dick and F. Pillichshammer

APPLIED 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 information

Numerical Analysis of Elliptic PDEs with Random Coefficients

Numerical Analysis of Elliptic PDEs with Random Coefficients Numerical Analysis of Elliptic PDEs with Random Coefficients (Lecture I) Robert Scheichl Department of Mathematical Sciences University of Bath Workshop on PDEs with Random Coefficients Weierstrass Institute,

More information

arxiv: v2 [math.na] 15 Aug 2018

arxiv: 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 information

Error Analysis for Quasi-Monte Carlo Methods

Error Analysis for Quasi-Monte Carlo Methods Error Analysis for Quasi-Monte Carlo Methods Fred J. Hickernell Department of Applied Mathematics, Illinois Institute of Technology hickernell@iit.edu mypages.iit.edu/~hickernell Thanks to the Guaranteed

More information

FOCM Workshop B5 Information Based Complexity

FOCM Workshop B5 Information Based Complexity FOCM 2014 - Workshop B5 Information Based Complexity B5 - December 15, 14:30 15:00 The ANOVA decomposition of a non-smooth function of an infinite number of variables Ian Sloan University of New South

More information

Adapting quasi-monte Carlo methods to simulation problems in weighted Korobov spaces

Adapting 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 information

Advanced 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 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 information

An 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. 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 information

Approximation of Functions Using Digital Nets

Approximation of Functions Using Digital Nets Approximation of Functions Using Digital Nets Josef Dick 1, Peter Kritzer 2, and Frances Y. Kuo 3 1 UNSW Asia, 1 Kay Siang Road, Singapore 248922. E-mail: j.dick@unswasia.edu.sg 2 Fachbereich Mathematik,

More information

Quasi-Monte Carlo methods for elliptic PDEs with random coefficients and applications

Quasi-Monte Carlo methods for elliptic PDEs with random coefficients and applications Quasi-Monte Carlo methods for elliptic PDEs with random coefficients and applications I. G. Graham,4, F. Y. Kuo 2, D. uyens 2,3, R. Scheichl, and I. H. Sloan 2 Dept of Mathematical Sciences, University

More information

Quadrature using sparse grids on products of spheres

Quadrature 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 information

Uniform Distribution and Quasi-Monte Carlo Methods

Uniform Distribution and Quasi-Monte Carlo Methods Workshop on Uniform Distribution and Quasi-Monte Carlo Methods October 14-18, 2013 as part of the Radon Special Semester 2013 on Applications of Algebra and Number Theory Metric number theory, lacunary

More information

UNCERTAINTY QUANTIFICATION IN LIQUID COMPOSITE MOULDING PROCESSES

UNCERTAINTY QUANTIFICATION IN LIQUID COMPOSITE MOULDING PROCESSES UNCERTAINTY QUANTIFICATION IN LIQUID COMPOSITE MOULDING PROCESSES Bart Verleye 1, Dirk Nuyens 1, Andrew Walbran 3,2, and Ming Gan 2 1 Dept. Computer Science, KU Leuven, Celestijnenlaan 200A, B-3001 Leuven,

More information

arxiv: v1 [math.na] 13 Jul 2017

arxiv: 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 information

Construction Algorithms for Higher Order Polynomial Lattice Rules

Construction 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 information

Generalizing the Tolerance Function for Guaranteed Algorithms

Generalizing the Tolerance Function for Guaranteed Algorithms Generalizing the Tolerance Function for Guaranteed Algorithms Lluís Antoni Jiménez Rugama Joint work with Professor Fred J. Hickernell Room 120, Bldg E1, Department of Applied Mathematics Email: lluisantoni@gmail.com

More information

QMC designs and covering of spheres by spherical caps

QMC designs and covering of spheres by spherical caps QMC designs and covering of spheres by spherical caps Ian H. Sloan University of New South Wales, Sydney, Australia Joint work with Johann Brauchart, Josef Dick, Ed Saff (Vanderbilt), Rob Womersley and

More information

Importance Sampling to Accelerate the Convergence of Quasi-Monte Carlo

Importance Sampling to Accelerate the Convergence of Quasi-Monte Carlo Importance Sampling to Accelerate the Convergence of Quasi-Monte Carlo Wolfgang Hörmann, Josef Leydold Department of Statistics and Mathematics Wirtschaftsuniversität Wien Research Report Series Report

More information

Sobol-Hoeffding Decomposition with Application to Global Sensitivity Analysis

Sobol-Hoeffding Decomposition with Application to Global Sensitivity Analysis Sobol-Hoeffding decomposition Application to Global SA Computation of the SI Sobol-Hoeffding Decomposition with Application to Global Sensitivity Analysis Olivier Le Maître with Colleague & Friend Omar

More information

Hochdimensionale Integration

Hochdimensionale Integration Oliver Ernst Institut für Numerische Mathematik und Optimierung Hochdimensionale Integration 4-tägige Vorlesung im Wintersemester 2/ im Rahmen des Moduls Ausgewählte Kapitel der Numerik Contents. Introduction.

More information

Scenario generation in stochastic programming with application to energy systems

Scenario 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 information

Bath Institute For Complex Systems

Bath Institute For Complex Systems Quasi-Monte Carlo methods for computing flow in random porous media I.G.Graham,F.Y.Kuo,D.uyens,R.Scheichl,andI.H.Sloan Bath Institute For Complex Systems Preprint 04/0(200) http://www.bath.ac.uk/math-sci/bics

More information

On the existence of higher order polynomial. lattices with large figure of merit ϱ α.

On the existence of higher order polynomial. lattices with large figure of merit ϱ α. On the existence of higher order polynomial lattices with large figure of merit Josef Dick a, Peter Kritzer b, Friedrich Pillichshammer c, Wolfgang Ch. Schmid b, a School of Mathematics, University of

More information

Tractability of Multivariate Problems

Tractability 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 information

Variance Reduction Techniques for Monte Carlo Simulations with Stochastic Volatility Models

Variance Reduction Techniques for Monte Carlo Simulations with Stochastic Volatility Models Variance Reduction Techniques for Monte Carlo Simulations with Stochastic Volatility Models Jean-Pierre Fouque North Carolina State University SAMSI November 3, 5 1 References: Variance Reduction for Monte

More information

A Belgian view on lattice rules

A 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 information

Scenario generation Contents

Scenario 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 information

Variance Reduction s Greatest Hits

Variance Reduction s Greatest Hits 1 Variance Reduction s Greatest Hits Pierre L Ecuyer CIRRELT, GERAD, and Département d Informatique et de Recherche Opérationnelle Université de Montréal, Canada ESM 2007, Malta, October 22, 2007 Context

More information

ERROR ESTIMATES FOR THE ANOVA METHOD WITH POLYNOMIAL CHAOS INTERPOLATION: TENSOR PRODUCT FUNCTIONS

ERROR ESTIMATES FOR THE ANOVA METHOD WITH POLYNOMIAL CHAOS INTERPOLATION: TENSOR PRODUCT FUNCTIONS ERROR ESTIMATES FOR THE ANOVA METHOD WITH POLYNOMIAL CHAOS INTERPOLATION: TENSOR PRODUCT FUNCTIONS ZHONGQIANG ZHANG, MINSEOK CHOI AND GEORGE EM KARNIADAKIS Abstract. We focus on the analysis of variance

More information

Numerical Methods in Economics MIT Press, Chapter 9 Notes Quasi-Monte Carlo Methods. Kenneth L. Judd Hoover Institution.

Numerical 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 information

Scenario Generation in Stochastic Programming with Application to Optimizing Electricity Portfolios under Uncertainty

Scenario Generation in Stochastic Programming with Application to Optimizing Electricity Portfolios under Uncertainty Scenario Generation in Stochastic Programming with Application to Optimizing Electricity Portfolios under Uncertainty W. Römisch Humboldt-University Berlin Department of Mathematics www.math.hu-berlin.de/~romisch

More information

Reliable Error Estimation for Quasi-Monte Carlo Methods

Reliable Error Estimation for Quasi-Monte Carlo Methods Reliable Error Estimation for Quasi-Monte Carlo Methods Department of Applied Mathematics, Joint work with Fred J. Hickernell July 8, 2014 Outline 1 Motivation Reasons Problem 2 New approach Set-up of

More information

STRONG TRACTABILITY OF MULTIVARIATE INTEGRATION USING QUASI MONTE CARLO ALGORITHMS

STRONG 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 information

TRB 2005: For Presentation and Publication Paper # Final Submission: April 1, 2005 Word Count: 8,191

TRB 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 information

Randomized Quasi-Monte Carlo: An Introduction for Practitioners

Randomized Quasi-Monte Carlo: An Introduction for Practitioners Randomized Quasi-Monte Carlo: An Introduction for Practitioners Pierre L Ecuyer Abstract We survey basic ideas and results on randomized quasi-monte Carlo (RQMC) methods, discuss their practical aspects,

More information

Quadrature using sparse grids on products of spheres

Quadrature 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 information

Approximation of stochastic optimization problems and scenario generation

Approximation 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 information

Random and Quasi-Random Point Sets

Random 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 information

Randomized 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 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 information

SCRAMBLED GEOMETRIC NET INTEGRATION OVER GENERAL PRODUCT SPACES. Kinjal Basu Art B. Owen

SCRAMBLED 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 information

A PIECEWISE CONSTANT ALGORITHM FOR WEIGHTED L 1 APPROXIMATION OVER BOUNDED OR UNBOUNDED REGIONS IN R s

A PIECEWISE CONSTANT ALGORITHM FOR WEIGHTED L 1 APPROXIMATION OVER BOUNDED OR UNBOUNDED REGIONS IN R s A PIECEWISE CONSTANT ALGORITHM FOR WEIGHTED L 1 APPROXIMATION OVER BONDED OR NBONDED REGIONS IN R s FRED J. HICKERNELL, IAN H. SLOAN, AND GRZEGORZ W. WASILKOWSKI Abstract. sing Smolyak s construction [5],

More information

Test Problems for Probability Theory ,

Test Problems for Probability Theory , 1 Test Problems for Probability Theory 01-06-16, 010-1-14 1. Write down the following probability density functions and compute their moment generating functions. (a) Binomial distribution with mean 30

More information

Applicability of Quasi-Monte Carlo for lattice systems

Applicability of Quasi-Monte Carlo for lattice systems Applicability of Quasi-Monte Carlo for lattice systems Andreas Ammon 1,2, Tobias Hartung 1,2,Karl Jansen 2, Hernan Leovey 3, Andreas Griewank 3, Michael Müller-Preussker 1 1 Humboldt-University Berlin,

More information

Quasi-Monte Carlo methods with applications in finance

Quasi-Monte Carlo methods with applications in finance Finance Stoch (2009) 13: 307 349 DOI 10.1007/s00780-009-0095-y Quasi-Monte Carlo methods with applications in finance Pierre L Ecuyer Received: 30 May 2008 / Accepted: 20 August 2008 / Published online:

More information

Sobolev Spaces. Chapter 10

Sobolev Spaces. Chapter 10 Chapter 1 Sobolev Spaces We now define spaces H 1,p (R n ), known as Sobolev spaces. For u to belong to H 1,p (R n ), we require that u L p (R n ) and that u have weak derivatives of first order in L p

More information

4.5 The critical BGW tree

4.5 The critical BGW tree 4.5. THE CRITICAL BGW TREE 61 4.5 The critical BGW tree 4.5.1 The rooted BGW tree as a metric space We begin by recalling that a BGW tree T T with root is a graph in which the vertices are a subset of

More information

On ANOVA expansions and strategies for choosing the anchor point

On ANOVA expansions and strategies for choosing the anchor point On ANOVA expansions and strategies for choosing the anchor point Zhen Gao and Jan S. Hesthaven August 31, 2010 Abstract The classic Lebesgue ANOVA expansion offers an elegant way to represent functions

More information

Exact Simulation of Multivariate Itô Diffusions

Exact Simulation of Multivariate Itô Diffusions Exact Simulation of Multivariate Itô Diffusions Jose Blanchet Joint work with Fan Zhang Columbia and Stanford July 7, 2017 Jose Blanchet (Columbia/Stanford) Exact Simulation of Diffusions July 7, 2017

More information

Kernel-based Approximation. Methods using MATLAB. Gregory Fasshauer. Interdisciplinary Mathematical Sciences. Michael McCourt.

Kernel-based Approximation. Methods using MATLAB. Gregory Fasshauer. Interdisciplinary Mathematical Sciences. Michael McCourt. SINGAPORE SHANGHAI Vol TAIPEI - Interdisciplinary Mathematical Sciences 19 Kernel-based Approximation Methods using MATLAB Gregory Fasshauer Illinois Institute of Technology, USA Michael McCourt University

More information

A MONTE CARLO ALGORITHM FOR WEIGHTED INTEGRATION OVER R d

A MONTE CARLO ALGORITHM FOR WEIGHTED INTEGRATION OVER R d MATHEMATICS OF COMPUTATION Volume 73, Number 246, Pages 813 825 S 25-5718(3)1564-3 Article electronically published on August 19, 23 A MONTE CARLO ALGORITHM FOR WEIGHTED INTEGRATION OVER R d PIOTR GAJDA,

More information

Katholieke Universiteit Leuven Department of Computer Science

Katholieke Universiteit Leuven Department of Computer Science Extensions of Fibonacci lattice rules Ronald Cools Dirk Nuyens Report TW 545, August 2009 Katholieke Universiteit Leuven Department of Computer Science Celestijnenlaan 200A B-3001 Heverlee (Belgium Extensions

More information

ISyE 6644 Fall 2016 Test #1 Solutions

ISyE 6644 Fall 2016 Test #1 Solutions 1 NAME ISyE 6644 Fall 2016 Test #1 Solutions This test is 85 minutes. You re allowed one cheat sheet. Good luck! 1. Suppose X has p.d.f. f(x) = 3x 2, 0 < x < 1. Find E[3X + 2]. Solution: E[X] = 1 0 x 3x2

More information

arxiv: v2 [math.na] 15 Oct 2015

arxiv: 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 information

Introduction to (randomized) quasi-monte Carlo

Introduction 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 information

arxiv: v2 [stat.co] 22 Jun 2017

arxiv: v2 [stat.co] 22 Jun 2017 A randomized Halton algorithm in R arxiv:1706.02808v2 [stat.co] 22 Jun 2017 Art B. Owen Stanford University May 2017 Abstract Randomized quasi-monte Carlo (RQMC) sampling can bring orders of magnitude

More information

Minimizing the Number of Function Evaluations to Estimate Sobol Indices Using Quasi-Monte Carlo

Minimizing the Number of Function Evaluations to Estimate Sobol Indices Using Quasi-Monte Carlo Minimizing the Number of Function Evaluations to Estimate Sobol Indices Using Quasi-Monte Carlo Lluís Antoni Jiménez Rugama Joint work with: Fred J Hickernell (IIT), Clémentine Prieur (Univ Grenoble),

More information

The Error Analysis through Dual Net and Walsh Function in Quasi-Monte Carlo Method

The Error Analysis through Dual Net and Walsh Function in Quasi-Monte Carlo Method The Error Analysis through Dual Net and Walsh Function in Quasi-Monte Carlo Method Siyuan Deng Department of Applied Mathematics Illinois Institute of Technology Apr 25, 2013 The Basic Concept of Quasi-Monte

More information

Sparse grid quadrature on products of spheres

Sparse grid quadrature on products of spheres Sparse grid quadrature on products of spheres Markus Hegland a, Paul Leopardi a, a Centre for Mathematics and its Applications, Australian National University. Abstract This paper examines sparse grid

More information

ON TRACTABILITY OF WEIGHTED INTEGRATION OVER BOUNDED AND UNBOUNDED REGIONS IN R s

ON 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 information

Exponential Convergence and Tractability of Multivariate Integration for Korobov Spaces

Exponential 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 information

Low-discrepancy point sets lifted to the unit sphere

Low-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 information

Course: ESO-209 Home Work: 1 Instructor: Debasis Kundu

Course: ESO-209 Home Work: 1 Instructor: Debasis Kundu Home Work: 1 1. Describe the sample space when a coin is tossed (a) once, (b) three times, (c) n times, (d) an infinite number of times. 2. A coin is tossed until for the first time the same result appear

More information

PDEs, Homework #3 Solutions. 1. Use Hölder s inequality to show that the solution of the heat equation

PDEs, Homework #3 Solutions. 1. Use Hölder s inequality to show that the solution of the heat equation PDEs, Homework #3 Solutions. Use Hölder s inequality to show that the solution of the heat equation u t = ku xx, u(x, = φ(x (HE goes to zero as t, if φ is continuous and bounded with φ L p for some p.

More information

x. Figure 1: Examples of univariate Gaussian pdfs N (x; µ, σ 2 ).

x. Figure 1: Examples of univariate Gaussian pdfs N (x; µ, σ 2 ). .8.6 µ =, σ = 1 µ = 1, σ = 1 / µ =, σ =.. 3 1 1 3 x Figure 1: Examples of univariate Gaussian pdfs N (x; µ, σ ). The Gaussian distribution Probably the most-important distribution in all of statistics

More information

Integration of permutation-invariant. functions

Integration 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 information

Quasi- Monte Carlo Multiple Integration

Quasi- 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 information

Fourier Transform & Sobolev Spaces

Fourier Transform & Sobolev Spaces Fourier Transform & Sobolev Spaces Michael Reiter, Arthur Schuster Summer Term 2008 Abstract We introduce the concept of weak derivative that allows us to define new interesting Hilbert spaces the Sobolev

More information

CONVERGENCE THEORY. G. ALLAIRE CMAP, Ecole Polytechnique. 1. Maximum principle. 2. Oscillating test function. 3. Two-scale convergence

CONVERGENCE 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 information