Giovanni Migliorati. MATHICSE-CSQI, École Polytechnique Fédérale de Lausanne
|
|
- Diana Lynch
- 6 years ago
- Views:
Transcription
1 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 Polytechnique Fédérale de Lausanne Analysis with random points: joint work with Fabio Nobile (EPFL), Raul Tempone (KAUST), Albert Cohen (UPMC), Abdellah Chkifa (UPMC) and Erik von Schwerin (KTH). Analysis with low-discrepancy points: joint work with Fabio Nobile. G.Migliorati (EPFL) ICERM - Brown University Providence - September 23th,
2 Outline 1 Discrete least squares on multivariate polynomial spaces 2 Stability and accuracy with evaluations in random points 3 Stability and accuracy with evaluations in low-discrepancy point sets 4 Conclusions G.Migliorati (EPFL) ICERM - Brown University Providence - September 23th,
3 Discrete least squares on multivariate polynomial spaces 1 Discrete least squares on multivariate polynomial spaces 2 Stability and accuracy with evaluations in random points 3 Stability and accuracy with evaluations in low-discrepancy point sets 4 Conclusions G.Migliorati (EPFL) ICERM - Brown University Providence - September 23th,
4 Discrete least squares on multivariate polynomial spaces Notation and definitions For any d 1, Γ := [ 1, 1] d and any real numbers α, β > 1, define d ρ(y) := B(α, β) d (1 y i ) α (1 + y i ) β, y Γ, f 1, f 2 L 2 ρ (Γ) := Γ i=1 f 1 (y)f 2 (y)ρ(y)dy, f 1, f 2 M := 1 M M f 1 (y m ) f 2 (y m ), m=1 L 2 ρ :=, 1/2, L 2 M :=, 1/2 ρ M, with y 1,..., y M being any points in Γ, either realizations of i.i.d. random variables Y 1,..., Y M i.i.d. ρ or deterministically given (e.g. low-discrepancy point sets). Given univariate L 2 ρ-orthonormal polynomials (ϕ k ) k 0 and a multi-index set Λ N d 0, for any ν Λ we define d ψ ν (y) := i=1 ϕ νi (y i ), y Γ, P Λ := span {ψ ν : ν Λ}. G.Migliorati (EPFL) ICERM - Brown University Providence - September 23th,
5 Discrete least squares on multivariate polynomial spaces Markov and Nikolskii inequalities for multivariate polynomials with downward closed multi-index sets Definition (Downward closed multi-index set) Λ is downward closed if (ν Λ and ν ν) ν Λ. Lemma (M. 2014) In any dimension, for any Λ downward closed and any α, β N 0 it holds u 2 L (Γ) (#Λ)2 max{α,β}+2 u 2 L 2 ρ (Γ), u P Λ(Γ). Lemma (M. 2014) In any dimension and for any Λ downward closed, when α = β = 0 (Legendre polynomials), it holds d 2 u y 1 y d 4 d (#Λ) 4 u 2 L 2 ρ (Γ) L 2 (Γ), u P Λ(Γ). ρ G.Migliorati (EPFL) ICERM - Brown University Providence - September 23th,
6 Discrete least squares on multivariate polynomial spaces Discrete least squares on polynomial spaces For any smooth (analytic) real-valued (or Hilbert-valued) function φ : Γ R, we define its continuous and discrete L 2 projections over P Λ as Π Λ φ := argmin φ v L 2 ρ, Π M Λ φ := argmin φ v M. v P Λ v P Λ Algebraic formulation: design matrix [D] ij = ψ j (y i ), right-hand side [b] i = φ(y i ), for any i = 1,..., M and j = 1,..., #Λ. Normal equations: D D β = D b, with β containing the coefficients of the expansion Π M Λ φ = ν Λ β νψ ν. We define also the matrix G := D D/M. G.Migliorati (EPFL) ICERM - Brown University Providence - September 23th,
7 Discrete least squares on multivariate polynomial spaces Optimality of discrete least squares in the L 2 ρ norm In any dimension, with any index set Λ and any ρ with bounded support: Proposition (M., Nobile, von Schwerin and Tempone, FoCM 2014) For any (random or deterministic) choice of M points in Γ it holds ) φ ΠΛ M φ L (1 2 + G 1 inf φ v ρ L. Proof v P Λ Theorem (M., Nobile, von Schwerin and Tempone, FoCM 2014) Given M points in Γ, being realizations of random variables independent and identically distributed w.r.t. ρ, it holds lim G 1 = lim G = 1, M + M + almost surely. Proposition (M., Nobile, von Schwerin and Tempone, FoCM 2014) cond (G) = G G 1. G.Migliorati (EPFL) ICERM - Brown University Providence - September 23th,
8 Discrete least squares on multivariate polynomial spaces Norm equivalence on P Λ (case of random points) Find δ (0, 1) such that with high probability. (1 δ) v 2 L 2 ρ v 2 M (1 + δ) v 2 L 2 ρ, v P Λ, Since v 2 M = M 1 Dv, Dv 2 = Gv, v 2 and v 2 R #Λ R #Λ L = v, 2 v 2, the ρ R #Λ matrix G satisfies v 2 v 2 M G = sup v P Λ \{v 0} v 2, G 1 L = sup 2 ρ L 2 v P ρ Λ \{v 0} v 2. M Hence, norm equivalence on P Λ w.h.p. iff concentration bounds again with high probability. 1 δ G 1 + δ, δ G δ, G I δ, G.Migliorati (EPFL) ICERM - Brown University Providence - September 23th,
9 Stability and accuracy with evaluations in random points 1 Discrete least squares on multivariate polynomial spaces 2 Stability and accuracy with evaluations in random points 3 Stability and accuracy with evaluations in low-discrepancy point sets 4 Conclusions G.Migliorati (EPFL) ICERM - Brown University Providence - September 23th,
10 Stability and accuracy with evaluations in random points Given any L 2 ρ-orthonormal polynomial basis (ψ ν ) ν Λ of P Λ, define K(Λ) := sup y Γ ( ) ψ ν (y) 2 v 2 = sup L ν Λ v P Λ v 2. L 2 ρ Lemma (Chkifa, Cohen, M., Nobile and Tempone, 2013) In any dimension and for any downward closed Λ it holds K(Λ) (#Λ) ln 3/ ln 2, with tensorized Chebyshev 1st kind polynomials. Lemma (M. 2014) In any dimension, for any downward closed Λ and any α, β N 0 it holds K(Λ) (#Λ) 2 max{α,β}+2, with tensorized Jacobi polynomials. These bounds are quite general, and set the ground for adaptive polynomial approximation based on discrete least squares. G.Migliorati (EPFL) ICERM - Brown University Providence - September 23th,
11 Stability and accuracy with evaluations in random points Assume that φ τ almost surely w.r.t. ρ and define T τ (t) := sign(t) min{τ, t }, ΠM Λ := T τ (Π M Λ ). Theorem (Chkifa, Cohen, M., Nobile and Tempone, 2013) For any γ>0 and any downward closed Λ, if M is such that K(Λ) 0.15 M 1 + γ ln M then, for any φ L (Γ) with φ L τ, it holds that Pr (cond(g) 3) 1 2M γ, ( Pr φ ΠΛ M φ L 2 (1 + ) 2) inf φ v ρ L 1 2M γ, v P Λ ( E φ Π ) ( ) Λ M 0.6 φ 2 L 1 + φ Π 2 ρ Λ φ 2 L (1 + γ) ln M + 8τ 2 M γ. 2 ρ (δ = 1/2 everywhere!) G.Migliorati (EPFL) ICERM - Brown University Providence - September 23th,
12 Stability and accuracy with low-discrepancy point sets 1 Discrete least squares on multivariate polynomial spaces 2 Stability and accuracy with evaluations in random points 3 Stability and accuracy with evaluations in low-discrepancy point sets 4 Conclusions G.Migliorati (EPFL) ICERM - Brown University Providence - September 23th,
13 Stability and accuracy with low-discrepancy point sets Discrete least squares with deterministic points: multivariate case with Chebyshev density in [0, 1] d Deterministic points introduced by Zhou, Narayan and Xu: ( ) 2π y j = cos M (j,..., jd ) [ 1, 1] d, j = 1,..., M, asymptotically distributed according to the Chebyshev density. Theorem (Zhou, Narayan and Xu, arxiv 2014) In any dimension d and with the Chebyshev density, if M is a prime number and M 4 d+1 d 2 (#Λ) 2 then it holds that ( φ ΠΛ M φ L ) ρ d 2 inf φ v L. #Λ v P Λ The proof uses arguments from number theory. G.Migliorati (EPFL) ICERM - Brown University Providence - September 23th,
14 Stability and accuracy with low-discrepancy point sets Discrete least squares with deterministic points: the multivariate case with uniform density in [0, 1] d Given any set of M points y 1,..., y M [0, 1] d and any set U {1,..., d}, we define its local discrepancy U (t, 1) := 1 M M i=1 q U I [0,t q ](y q i ) t q, t [0, 1] U, q U and its star-discrepancy D,U := sup U (t, 1). t [0,1] U Values of components in {1,..., d} \ U are frozen to 1. G.Migliorati (EPFL) ICERM - Brown University Providence - September 23th,
15 Stability and accuracy with low-discrepancy point sets Example d = 2, U = {2}, {1, 2} \ U = {1} (picture from J.Dick, F.Pillichshammer: Digital Nets and Sequences, 2010) G.Migliorati (EPFL) ICERM - Brown University Providence - September 23th,
16 Stability and accuracy with low-discrepancy point sets Discrete least squares with deterministic points: the multivariate case with uniform density in [0, 1] d Let t 0, m 1, d 1 and b 2 be integers with t m. A (t, m, d)-net in base b is a point set consisting of b m points in [0, 1) d such that every elementary interval of the form d q=1 [ aj b h, a ) j + 1 j b h j with each h j 0, 0 a j < b h j exactly b t points. and h h d = m t, contains Example: (0, 4, 2)-net in base b = 2 (Hammersley points). G.Migliorati (EPFL) ICERM - Brown University Providence - September 23th,
17 Stability and accuracy with low-discrepancy point sets Discrete least squares with deterministic points: the multivariate case with uniform density in [0, 1] d Our analysis uses a type of Koksma-Hlawka inequality and low-discrepancy point sets. Starting point: Lemma (Hlawka-Zaremba s identity ) Given M points y 1,..., y M [0, 1] d, for any f with continuous mixed derivatives it holds f (y)dy 1 M f (y i ) [0,1] d M = ( 1) U U (y U, 1) U i=1 U {1,...,d} [0,1] U y U f (y U, 1) dy U. Lemma (Standard Koksma-Hlawka inequality) f (y)dy 1 M f (y i ) [0,1] d M D,{1,...,d} f HK. i=1 G.Migliorati (EPFL) ICERM - Brown University Providence - September 23th,
18 Stability and accuracy with low-discrepancy point sets Discrete least squares with deterministic points: the multivariate case with uniform density in [0, 1] d Three main ingredients in our approach: 1) we prove a variant of the standard Koksma-Hlawka inequality starting from the Hlawka-Zaremba s identity: Lemma (M., Nobile 2014) f 2 L 2 f 2 M ρ D,U T y T f (y U, 1) U {1,...,d} T U L 2 ([0,1] U ) U T y U\T f (y T, 1) L 2 ([0,1] U ). 2) Markov-type and Nikolskii-type multivariate inequalities for polynomials associated with downward closed multi-index sets (M. 2014). 3) upper bounds for the star-discrepancy of (t, m, d)-nets and (t, d)-sequences (e.g. Faure-Kritzer, Monatsh. Math. 2013). G.Migliorati (EPFL) ICERM - Brown University Providence - September 23th,
19 Stability and accuracy with low-discrepancy point sets Discrete least squares with deterministic points: the multivariate case with uniform density in [0, 1] d Consider any (t, m, d)-net in base b 2 with quality parameter t 0. Theorem (M., Nobile 2014) In any dimension d, with the uniform density and with anisotropic tensor product spaces P Λ, if ( { } ) b 1 1 > δ > 0.7 b t 2 (1 + 2 ln M)d exp + O (1) (#Λ) 2 ln b M then it holds that cond(g) 1 + δ 1 δ, ) 1 φ ΠΛ M φ L (1 2 + inf φ v ρ L. 1 δ v P Λ Similar theorem also for (t, d)-sequences (M.,Nobile 2014). G.Migliorati (EPFL) ICERM - Brown University Providence - September 23th,
20 Stability and accuracy with low-discrepancy point sets Discrete least squares with deterministic points: the multivariate case with uniform density in [0, 1] d Given Λ downward closed and U {1,..., d} we define its sections by Λ U := {ν N U 0 : µ = (µ U, µ {1,...,d}\U ) Λ and ν = µ U }. In general, for any downward closed multi-index set the condition becomes 1 > δ > min (#Λ)4 D,U, =U {1,...,d} =U {1,...,d} D,U ( ) 2 #Λ {1,...,d}\U (#Λ T ) 2 ( ) 2 #Λ U\T. T U Nonoptimal when Λ is more sparse than anisotropic tensor product, compared to M (#Λ) 2 with random points and any Λ downward closed. G.Migliorati (EPFL) ICERM - Brown University Providence - September 23th,
21 Conclusions 1 Discrete least squares on multivariate polynomial spaces 2 Stability and accuracy with evaluations in random points 3 Stability and accuracy with evaluations in low-discrepancy point sets 4 Conclusions G.Migliorati (EPFL) ICERM - Brown University Providence - September 23th,
22 Conclusions Conclusions (theoretical analysis) RANDOM POINTS: analysis w.r.t. M, d, Λ, ρ, smoothness φ: in any dimension d, proven stability and accuracy provided that M/ ln M C 1 (dim(p Λ )) ln 3 ln 2 with Chebyshev density, M/ ln M C 2 (dim(p Λ )) 2 with uniform density, M/ ln M C 3 (dim(p Λ )) 2 max{α,β}+2 with beta(α + 1, β + 1), α, β 0, with the constants C 1, C 2, C 3 being independent of d. DETERMINISTIC POINTS: analysis w.r.t. M, d, Λ, smoothness φ: in any dimension d, proven stability and accuracy provided that M Ĉ1(d)(dim(P Λ )) 2 with Chebyshev density and any Λ (Zhou et al.), M/(1 + 2 ln M) d Ĉ2(dim(P Λ )) 2 with uniform density and anisotropic tensor product, M/(1 + 2 ln M) d Ĉ3(dim(P Λ )) γ, 2 γ 4 with uniform density and any Λ downward closed. with the constant Ĉ1 being dependent on d, and Ĉ2, Ĉ3 being dependent on the parameters of the (t, m, d)-net or (t, d)-sequence. G.Migliorati (EPFL) ICERM - Brown University Providence - September 23th,
23 Conclusions Conclusions (experience from numerics) In high dimensions and with smooth functions, with both random and deterministic points, it seems to be enough M dim(p Λ ) to achieve the optimal convergence rate up to a threshold. A lot of numerical evidence, but no formal proof yet. Deterministic points CAN outperform random points in low dimensions. What about high dimensions? Discrete least squares is a well-promising approximation tool for multivariate aleatory functions and PDEs with stochastic data. G.Migliorati (EPFL) ICERM - Brown University Providence - September 23th,
24 Conclusions References on discrete least squares with RANDOM points A.Cohen, M.Davenport, D.Leviatan: On the stability and accuracy of least squares approximations. Foundations of Computational Mathematics, G.Migliorati, F.Nobile, E.von Schwerin, R.Tempone: Analysis of discrete L 2 projection on polynomial spaces with random evaluations. Foundations of Computational Mathematics, A.Chkifa, A.Cohen, G.Migliorati, F.Nobile, R.Tempone: Discrete least squares polynomial approximation with random evaluations; application to parametric and stochastic elliptic PDEs. submitted. Available as MATHICSE report G.Migliorati, F.Nobile, E.von Schwerin, R.Tempone: Approximation of Quantities of Interest in stochastic PDEs by the random discrete L 2 projection on polynomial spaces, SIAM J. Sci. Comput., G.Migliorati: Multivariate Markov-type and Nikolskii-type inequalities for polynomials associated with downward closed multi-index sets, submitted. Available as MATHICSE report G.Migliorati: Polynomial approximation by the random discrete L 2 projection and application to inverse problems for PDEs with stochastic data, PhD thesis, Department of Mathematics at Politecnico di Milano and Centre de Mathématiques Appliquées at École Polytechnique, References on discrete least squares with DETERMINISTIC points T.Zhou, A.Narayan, Z.Xu: Multivariate discrete least-squares approximations with a new type of collocation grid, arkiv: v1, G.Migliorati, F.Nobile: Analysis of discrete least squares on multivariate polynomial spaces with evaluations in low-discrepancy point sets, submitted. Available as MATHICSE report G.Migliorati (EPFL) ICERM - Brown University Providence - September 23th,
25 Conclusions Thank you for your attention! G.Migliorati (EPFL) ICERM - Brown University Providence - September 23th,
Collocation 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 informationComparison of Clenshaw-Curtis and Leja quasi-optimal sparse grids for the approximation of random PDEs
MATHICSE Mathematics Institute of Computational Science and Engineering School of Basic Sciences - Section of Mathematics MATHICSE Technical Report Nr. 41.2014 September 2014 Comparison of Clenshaw-Curtis
More informationDownloaded 06/07/18 to Redistribution subject to SIAM license or copyright; see
SIAM J. SCI. COMPUT. Vol. 40, No. 1, pp. A366 A387 c 2018 Society for Industrial and Applied Mathematics WEIGHTED APPROXIMATE FEKETE POINTS: SAMPLING FOR LEAST-SQUARES POLYNOMIAL APPROXIMATION LING GUO,
More informationSparse Grids. Léopold Cambier. February 17, ICME, Stanford University
Sparse Grids & "A Dynamically Adaptive Sparse Grid Method for Quasi-Optimal Interpolation of Multidimensional Analytic Functions" from MK Stoyanov, CG Webster Léopold Cambier ICME, Stanford University
More informationImplementation of Sparse Wavelet-Galerkin FEM for Stochastic PDEs
Implementation of Sparse Wavelet-Galerkin FEM for Stochastic PDEs Roman Andreev ETH ZÜRICH / 29 JAN 29 TOC of the Talk Motivation & Set-Up Model Problem Stochastic Galerkin FEM Conclusions & Outlook Motivation
More informationQuasi-optimal and adaptive sparse grids with control variates for PDEs with random diffusion coefficient
Quasi-optimal and adaptive sparse grids with control variates for PDEs with random diffusion coefficient F. Nobile, L. Tamellini, R. Tempone, F. Tesei CSQI - MATHICSE, EPFL, Switzerland Dipartimento di
More informationTutorial 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 informationSparse Quadrature Algorithms for Bayesian Inverse Problems
Sparse Quadrature Algorithms for Bayesian Inverse Problems Claudia Schillings, Christoph Schwab Pro*Doc Retreat Disentis 2013 Numerical Analysis and Scientific Computing Disentis - 15 August, 2013 research
More informationStochastic methods for solving partial differential equations in high dimension
Stochastic methods for solving partial differential equations in high dimension Marie Billaud-Friess Joint work with : A. Macherey, A. Nouy & C. Prieur marie.billaud-friess@ec-nantes.fr Centrale Nantes,
More informationOn the Stability of Polynomial Interpolation Using Hierarchical Sampling
On the Stability of Polynomial Interpolation Using Hierarchical Sampling Albert Cohen, Abdellah Chkifa To cite this version: Albert Cohen, Abdellah Chkifa. On the Stability of Polynomial Interpolation
More informationHypothesis testing for Stochastic PDEs. Igor Cialenco
Hypothesis testing for Stochastic PDEs Igor Cialenco Department of Applied Mathematics Illinois Institute of Technology igor@math.iit.edu Joint work with Liaosha Xu Research partially funded by NSF grants
More informationBrownian motion. Samy Tindel. Purdue University. Probability Theory 2 - MA 539
Brownian motion Samy Tindel Purdue University Probability Theory 2 - MA 539 Mostly taken from Brownian Motion and Stochastic Calculus by I. Karatzas and S. Shreve Samy T. Brownian motion Probability Theory
More informationApproximation of High-Dimensional Rank One Tensors
Approximation of High-Dimensional Rank One Tensors Markus Bachmayr, Wolfgang Dahmen, Ronald DeVore, and Lars Grasedyck March 14, 2013 Abstract Many real world problems are high-dimensional in that their
More informationEfficient Solvers for Stochastic Finite Element Saddle Point Problems
Efficient Solvers for Stochastic Finite Element Saddle Point Problems Catherine E. Powell c.powell@manchester.ac.uk School of Mathematics University of Manchester, UK Efficient Solvers for Stochastic Finite
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 informationNonlinear tensor product approximation
ICERM; October 3, 2014 1 Introduction 2 3 4 Best multilinear approximation We are interested in approximation of a multivariate function f (x 1,..., x d ) by linear combinations of products u 1 (x 1 )
More informationSTAT 200C: High-dimensional Statistics
STAT 200C: High-dimensional Statistics Arash A. Amini May 30, 2018 1 / 59 Classical case: n d. Asymptotic assumption: d is fixed and n. Basic tools: LLN and CLT. High-dimensional setting: n d, e.g. n/d
More informationInterpolation via weighted l 1 minimization
Interpolation via weighted l 1 minimization Rachel Ward University of Texas at Austin December 12, 2014 Joint work with Holger Rauhut (Aachen University) Function interpolation Given a function f : D C
More informationPart 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 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 informationTHE CHOICE OF AUXILIARY DENSITY FUNCTION IN STOCHASTIC COLLOCATION
IN STOCHASTIC COLLOCATION KELLIN RUMSEY & NEVIN MARTIN 12/06/2016 1 IN STOCHASTIC COLLOCATION 2 1. Introduction Stochastic collocation has been used in a wide range of application spaces as a way to efficiently
More informationGlobal Maxwellians over All Space and Their Relation to Conserved Quantites of Classical Kinetic Equations
Global Maxwellians over All Space and Their Relation to Conserved Quantites of Classical Kinetic Equations C. David Levermore Department of Mathematics and Institute for Physical Science and Technology
More informationSplitting methods with boundary corrections
Splitting methods with boundary corrections Alexander Ostermann University of Innsbruck, Austria Joint work with Lukas Einkemmer Verona, April/May 2017 Strang s paper, SIAM J. Numer. Anal., 1968 S (5)
More informationA NEW UPPER BOUND ON THE STAR DISCREPANCY OF (0,1)-SEQUENCES. Peter Kritzer 1. Abstract
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 5(3 (2005, #A11 A NEW UPPER BOUND ON THE STAR DISCREPANCY OF (0,1-SEQUENCES Peter Kritzer 1 Department of Mathematics, University of Salzburg,
More informationScattered Data Interpolation with Wavelet Trees
Scattered Data Interpolation with Wavelet Trees Christophe P. Bernard, Stéphane G. Mallat and Jean-Jacques Slotine Abstract. This paper describes a new result on a wavelet scheme for scattered data interpolation
More information2014:05 Incremental Greedy Algorithm and its Applications in Numerical Integration. V. Temlyakov
INTERDISCIPLINARY MATHEMATICS INSTITUTE 2014:05 Incremental Greedy Algorithm and its Applications in Numerical Integration V. Temlyakov IMI PREPRINT SERIES COLLEGE OF ARTS AND SCIENCES UNIVERSITY OF SOUTH
More informationTrivariate polynomial approximation on Lissajous curves 1
Trivariate polynomial approximation on Lissajous curves 1 Stefano De Marchi DMV2015, Minisymposium on Mathematical Methods for MPI 22 September 2015 1 Joint work with Len Bos (Verona) and Marco Vianello
More informationErgodic Theorems. Samy Tindel. Purdue University. Probability Theory 2 - MA 539. Taken from Probability: Theory and examples by R.
Ergodic Theorems Samy Tindel Purdue University Probability Theory 2 - MA 539 Taken from Probability: Theory and examples by R. Durrett Samy T. Ergodic theorems Probability Theory 1 / 92 Outline 1 Definitions
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 informationA sparse grid stochastic collocation method for elliptic partial differential equations with random input data
A sparse grid stochastic collocation method for elliptic partial differential equations with random input data F. Nobile R. Tempone C. G. Webster June 22, 2006 Abstract This work proposes and analyzes
More informationOptimal Polynomial Admissible Meshes on the Closure of C 1,1 Bounded Domains
Optimal Polynomial Admissible Meshes on the Closure of C 1,1 Bounded Domains Constructive Theory of Functions Sozopol, June 9-15, 2013 F. Piazzon, joint work with M. Vianello Department of Mathematics.
More informationFourier and Wavelet Signal Processing
Ecole Polytechnique Federale de Lausanne (EPFL) Audio-Visual Communications Laboratory (LCAV) Fourier and Wavelet Signal Processing Martin Vetterli Amina Chebira, Ali Hormati Spring 2011 2/25/2011 1 Outline
More informationThe Discrepancy Function and the Small Ball Inequality in Higher Dimensions
The Discrepancy Function and the Small Ball Inequality in Higher Dimensions Dmitriy Georgia Institute of Technology (joint work with M. Lacey and A. Vagharshakyan) 2007 Fall AMS Western Section Meeting
More informationStochastic Collocation Methods for Polynomial Chaos: Analysis and Applications
Stochastic Collocation Methods for Polynomial Chaos: Analysis and Applications Dongbin Xiu Department of Mathematics, Purdue University Support: AFOSR FA955-8-1-353 (Computational Math) SF CAREER DMS-64535
More informationFast Numerical Methods for Stochastic Computations
Fast AreviewbyDongbinXiu May 16 th,2013 Outline Motivation 1 Motivation 2 3 4 5 Example: Burgers Equation Let us consider the Burger s equation: u t + uu x = νu xx, x [ 1, 1] u( 1) =1 u(1) = 1 Example:
More informationLow-discrepancy sequences obtained from algebraic function fields over finite fields
ACTA ARITHMETICA LXXII.3 (1995) Low-discrepancy sequences obtained from algebraic function fields over finite fields by Harald Niederreiter (Wien) and Chaoping Xing (Hefei) 1. Introduction. We present
More informationMATHICSE Mathematics Institute of Computational Science and Engineering School of Basic Sciences - Section of Mathematics
MATHICSE Mathematics Institute of Computational Science and Engineering School of Basic Sciences - Section of Mathematics MATHICSE Technical Report Nr. 05.2013 February 2013 (NEW 10.2013 A weighted empirical
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 informationGeometric bounds for Steklov eigenvalues
Geometric bounds for Steklov eigenvalues Luigi Provenzano École Polytechnique Fédérale de Lausanne, Switzerland Joint work with Joachim Stubbe June 20, 2017 luigi.provenzano@epfl.ch (EPFL) Steklov eigenvalues
More informationNEEDLET APPROXIMATION FOR ISOTROPIC RANDOM FIELDS ON THE SPHERE
NEEDLET APPROXIMATION FOR ISOTROPIC RANDOM FIELDS ON THE SPHERE Quoc T. Le Gia Ian H. Sloan Yu Guang Wang Robert S. Womersley School of Mathematics and Statistics University of New South Wales, Australia
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 informationNumerische Mathematik
Numer. Math. (203) :493 536 OI 0.007/s002-02-0493-5 Numerische Mathematik A stochastic collocation method for the second order wave equation with a discontinuous random speed Mohammad Motamed Fabio Nobile
More informationConstructing optimal polynomial meshes on planar starlike domains
Constructing optimal polynomial meshes on planar starlike domains F. Piazzon and M. Vianello 1 Dept. of Mathematics, University of Padova (Italy) October 13, 2014 Abstract We construct polynomial norming
More informationAnomalous transport of particles in Plasma physics
Anomalous transport of particles in Plasma physics L. Cesbron a, A. Mellet b,1, K. Trivisa b, a École Normale Supérieure de Cachan Campus de Ker Lann 35170 Bruz rance. b Department of Mathematics, University
More informationMATHICSE Mathematics Institute of Computational Science and Engineering School of Basic Sciences - Section of Mathematics
MATHICSE Mathematics Institute of Computational Science and Engineering School of Basic Sciences - Section of Mathematics MATHICSE Technical Report Nr. 23.2012 July 2012 NEW 10.2013 Stochastic optimal
More informationLarge-scale eigenvalue problems
ELE 538B: Mathematics of High-Dimensional Data Large-scale eigenvalue problems Yuxin Chen Princeton University, Fall 208 Outline Power method Lanczos algorithm Eigenvalue problems 4-2 Eigendecomposition
More informationOutline of Fourier Series: Math 201B
Outline of Fourier Series: Math 201B February 24, 2011 1 Functions and convolutions 1.1 Periodic functions Periodic functions. Let = R/(2πZ) denote the circle, or onedimensional torus. A function f : C
More informationAnalysis and Computation of Hyperbolic PDEs with Random Data
Analysis and Computation of Hyperbolic PDEs with Random Data Mohammad Motamed 1, Fabio Nobile 2,3 and Raúl Tempone 1 1 King Abdullah University of Science and Technology, Thuwal, Saudi Arabia 2 EPFL Lausanne,
More informationarxiv: v2 [math.na] 21 Jul 2016
Multi-Index Stochastic Collocation for random PDEs Abdul-Lateef Haji-Ali a,, Fabio Nobile b, Lorenzo Tamellini b,c, Raúl Tempone a a CEMSE, King Abdullah University of Science and Technology, Thuwal 23955-6900,
More informationEFFICIENT STOCHASTIC GALERKIN METHODS FOR RANDOM DIFFUSION EQUATIONS
EFFICIENT STOCHASTIC GALERKIN METHODS FOR RANDOM DIFFUSION EQUATIONS DONGBIN XIU AND JIE SHEN Abstract. We discuss in this paper efficient solvers for stochastic diffusion equations in random media. We
More informationON DISCRETE LEAST-SQUARES PROJECTION IN UNBOUNDED DOMAIN WITH RANDOM EVALUATIONS AND ITS APPLICATION TO PARAMETRIC UNCERTAINTY QUANTIFICATION
SIAM J. SCI. COMPUT. Vol. 36, No. 5, pp. A2272 A2295 c 2014 Society for Industrial and Applied Mathematics ON DISCRETE LEAST-SQUARES PROJECTION IN UNBOUNDED DOMAIN WITH RANDOM EVALUATIONS AND ITS APPLICATION
More informationInterpolation via weighted l 1 -minimization
Interpolation via weighted l 1 -minimization Holger Rauhut RWTH Aachen University Lehrstuhl C für Mathematik (Analysis) Matheon Workshop Compressive Sensing and Its Applications TU Berlin, December 11,
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 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 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 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 informationPerformance Evaluation of Generalized Polynomial Chaos
Performance Evaluation of Generalized Polynomial Chaos Dongbin Xiu, Didier Lucor, C.-H. Su, and George Em Karniadakis 1 Division of Applied Mathematics, Brown University, Providence, RI 02912, USA, gk@dam.brown.edu
More informationInference for High Dimensional Robust Regression
Department of Statistics UC Berkeley Stanford-Berkeley Joint Colloquium, 2015 Table of Contents 1 Background 2 Main Results 3 OLS: A Motivating Example Table of Contents 1 Background 2 Main Results 3 OLS:
More informationASYMPTOTICALLY EXACT A POSTERIORI ESTIMATORS FOR THE POINTWISE GRADIENT ERROR ON EACH ELEMENT IN IRREGULAR MESHES. PART II: THE PIECEWISE LINEAR CASE
MATEMATICS OF COMPUTATION Volume 73, Number 246, Pages 517 523 S 0025-5718(0301570-9 Article electronically published on June 17, 2003 ASYMPTOTICALLY EXACT A POSTERIORI ESTIMATORS FOR TE POINTWISE GRADIENT
More informationRough paths methods 4: Application to fbm
Rough paths methods 4: Application to fbm Samy Tindel Purdue University University of Aarhus 2016 Samy T. (Purdue) Rough Paths 4 Aarhus 2016 1 / 67 Outline 1 Main result 2 Construction of the Levy area:
More informationParameterized PDEs Compressing sensing Sampling complexity lower-rip CS for PDEs Nonconvex regularizations Concluding remarks. Clayton G.
COMPUTATIONAL & APPLIED MATHEMATICS Parameterized PDEs Compressing sensing Sampling complexity lower-rip CS for PDEs Nonconvex regularizations Concluding remarks Polynomial approximations via compressed
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 informationSome Aspects of Universal Portfolio
1 Some Aspects of Universal Portfolio Tomoyuki Ichiba (UC Santa Barbara) joint work with Marcel Brod (ETH Zurich) Conference on Stochastic Asymptotics & Applications Sixth Western Conference on Mathematical
More informationCMS winter meeting 2008, Ottawa. The heat kernel on connected sums
CMS winter meeting 2008, Ottawa The heat kernel on connected sums Laurent Saloff-Coste (Cornell University) December 8 2008 p(t, x, y) = The heat kernel ) 1 x y 2 exp ( (4πt) n/2 4t The heat kernel is:
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 November 26th, 2014 E. Tanré (INRIA - Team Tosca) Mathematical
More informationSTAT 200C: High-dimensional Statistics
STAT 200C: High-dimensional Statistics Arash A. Amini April 27, 2018 1 / 80 Classical case: n d. Asymptotic assumption: d is fixed and n. Basic tools: LLN and CLT. High-dimensional setting: n d, e.g. n/d
More informationWe denote the space of distributions on Ω by D ( Ω) 2.
Sep. 1 0, 008 Distributions Distributions are generalized functions. Some familiarity with the theory of distributions helps understanding of various function spaces which play important roles in the study
More informationOn Reparametrization and the Gibbs Sampler
On Reparametrization and the Gibbs Sampler Jorge Carlos Román Department of Mathematics Vanderbilt University James P. Hobert Department of Statistics University of Florida March 2014 Brett Presnell Department
More informationExplicit bounds on the entangled value of multiplayer XOR games. Joint work with Thomas Vidick (MIT)
Explicit bounds on the entangled value of multiplayer XOR games Jop Briët Joint work with Thomas Vidick (MIT) Waterloo, 2012 Entanglement and nonlocal correlations [Bell64] Measurements on entangled quantum
More informationEigenvalues, random walks and Ramanujan graphs
Eigenvalues, random walks and Ramanujan graphs David Ellis 1 The Expander Mixing lemma We have seen that a bounded-degree graph is a good edge-expander if and only if if has large spectral gap If G = (V,
More informationLipschitz continuity for solutions of Hamilton-Jacobi equation with Ornstein-Uhlenbeck operator
Lipschitz continuity for solutions of Hamilton-Jacobi equation with Ornstein-Uhlenbeck operator Thi Tuyen Nguyen Ph.D student of University of Rennes 1 Joint work with: Prof. E. Chasseigne(University of
More informationP (A G) dp G P (A G)
First homework assignment. Due at 12:15 on 22 September 2016. Homework 1. We roll two dices. X is the result of one of them and Z the sum of the results. Find E [X Z. Homework 2. Let X be a r.v.. Assume
More informationVector Spaces. Vector space, ν, over the field of complex numbers, C, is a set of elements a, b,..., satisfying the following axioms.
Vector Spaces Vector space, ν, over the field of complex numbers, C, is a set of elements a, b,..., satisfying the following axioms. For each two vectors a, b ν there exists a summation procedure: a +
More informationMIXED PROBLEM WITH INTEGRAL BOUNDARY CONDITION FOR A HIGH ORDER MIXED TYPE PARTIAL DIFFERENTIAL EQUATION
Applied Mathematics and Stochastic Analysis, 16:1 (200), 6-7. Printed in the U.S.A. 200 by North Atlantic Science Publishing Company MIXED PROBLEM WITH INTEGRAL BOUNDARY CONDITION FOR A HIGH ORDER MIXED
More informationOrthogonality of hat functions in Sobolev spaces
1 Orthogonality of hat functions in Sobolev spaces Ulrich Reif Technische Universität Darmstadt A Strobl, September 18, 27 2 3 Outline: Recap: quasi interpolation Recap: orthogonality of uniform B-splines
More informationSmall ball probabilities and metric entropy
Small ball probabilities and metric entropy Frank Aurzada, TU Berlin Sydney, February 2012 MCQMC Outline 1 Small ball probabilities vs. metric entropy 2 Connection to other questions 3 Recent results for
More informationLow-rank techniques applied to moment equations for the stochastic Darcy problem with lognormal permeability
Low-rank techniques applied to moment equations for the stochastic arcy problem with lognormal permeability Francesca Bonizzoni 1,2 and Fabio Nobile 1 1 CSQI-MATHICSE, EPFL, Switzerland 2 MOX, Politecnico
More informationDynamical systems with Gaussian and Levy noise: analytical and stochastic approaches
Dynamical systems with Gaussian and Levy noise: analytical and stochastic approaches Noise is often considered as some disturbing component of the system. In particular physical situations, noise becomes
More informationOn continuous time contract theory
Ecole Polytechnique, France Journée de rentrée du CMAP, 3 octobre, 218 Outline 1 2 Semimartingale measures on the canonical space Random horizon 2nd order backward SDEs (Static) Principal-Agent Problem
More informationLecture 5: Importance sampling and Hamilton-Jacobi equations
Lecture 5: Importance sampling and Hamilton-Jacobi equations Henrik Hult Department of Mathematics KTH Royal Institute of Technology Sweden Summer School on Monte Carlo Methods and Rare Events Brown University,
More informationConvergence of Multivariate Quantile Surfaces
Convergence of Multivariate Quantile Surfaces Adil Ahidar Institut de Mathématiques de Toulouse - CERFACS August 30, 2013 Adil Ahidar (Institut de Mathématiques de Toulouse Convergence - CERFACS) of Multivariate
More informationarxiv: v2 [math.na] 8 Sep 2017
arxiv:1704.06339v [math.na] 8 Sep 017 A Monte Carlo approach to computing stiffness matrices arising in polynomial chaos approximations Juan Galvis O. Andrés Cuervo September 3, 018 Abstract We use a Monte
More informationBernstein-Durrmeyer operators with arbitrary weight functions
Bernstein-Durrmeyer operators with arbitrary weight functions Elena E. Berdysheva German University of Technology in Oman Muscat, Sultanate of Oman Bernstein-Durrmeyer operators with arbitrary weight functions
More information1. Introduction. In this paper we consider stochastic optimization problems of the form
O RATES OF COVERGECE FOR STOCHASTIC OPTIMIZATIO PROBLEMS UDER O-I.I.D. SAMPLIG TITO HOMEM-DE-MELLO Abstract. In this paper we discuss the issue of solving stochastic optimization problems by means of sample
More informationOn the Complexity of Best Arm Identification with Fixed Confidence
On the Complexity of Best Arm Identification with Fixed Confidence Discrete Optimization with Noise Aurélien Garivier, Emilie Kaufmann COLT, June 23 th 2016, New York Institut de Mathématiques de Toulouse
More informationSampling and low-rank tensor approximation of the response surface
Sampling and low-rank tensor approximation of the response surface tifica Alexander Litvinenko 1,2 (joint work with Hermann G. Matthies 3 ) 1 Group of Raul Tempone, SRI UQ, and 2 Group of David Keyes,
More informationON THE REGULARITY OF SAMPLE PATHS OF SUB-ELLIPTIC DIFFUSIONS ON MANIFOLDS
Bendikov, A. and Saloff-Coste, L. Osaka J. Math. 4 (5), 677 7 ON THE REGULARITY OF SAMPLE PATHS OF SUB-ELLIPTIC DIFFUSIONS ON MANIFOLDS ALEXANDER BENDIKOV and LAURENT SALOFF-COSTE (Received March 4, 4)
More information= 1 2 x (x 1) + 1 {x} (1 {x}). [t] dt = 1 x (x 1) + O (1), [t] dt = 1 2 x2 + O (x), (where the error is not now zero when x is an integer.
Problem Sheet,. i) Draw the graphs for [] and {}. ii) Show that for α R, α+ α [t] dt = α and α+ α {t} dt =. Hint Split these integrals at the integer which must lie in any interval of length, such as [α,
More informationResearch Article Localization and Perturbations of Roots to Systems of Polynomial Equations
International Mathematics and Mathematical Sciences Volume 2012, Article ID 653914, 9 pages doi:10.1155/2012/653914 Research Article Localization and Perturbations of Roots to Systems of Polynomial Equations
More informationAdditive functionals of infinite-variance moving averages. Wei Biao Wu The University of Chicago TECHNICAL REPORT NO. 535
Additive functionals of infinite-variance moving averages Wei Biao Wu The University of Chicago TECHNICAL REPORT NO. 535 Departments of Statistics The University of Chicago Chicago, Illinois 60637 June
More informationConvex Feasibility Problems
Laureate Prof. Jonathan Borwein with Matthew Tam http://carma.newcastle.edu.au/drmethods/paseky.html Spring School on Variational Analysis VI Paseky nad Jizerou, April 19 25, 2015 Last Revised: May 6,
More informationOn some weighted fractional porous media equations
On some weighted fractional porous media equations Gabriele Grillo Politecnico di Milano September 16 th, 2015 Anacapri Joint works with M. Muratori and F. Punzo Gabriele Grillo Weighted Fractional PME
More informationOn the bang-bang property of time optimal controls for infinite dimensional linear systems
On the bang-bang property of time optimal controls for infinite dimensional linear systems Marius Tucsnak Université de Lorraine Paris, 6 janvier 2012 Notation and problem statement (I) Notation: X (the
More informationA sparse grid stochastic collocation method for partial differential equations with random input data
A sparse grid stochastic collocation method for partial differential equations with random input data F. Nobile R. Tempone C. G. Webster May 24, 2007 Abstract This work proposes and analyzes a Smolyak-type
More informationReduced basis method for the reliable model reduction of Navier-Stokes equations in cardiovascular modelling
Reduced basis method for the reliable model reduction of Navier-Stokes equations in cardiovascular modelling Toni Lassila, Andrea Manzoni, Gianluigi Rozza CMCS - MATHICSE - École Polytechnique Fédérale
More informationConstruction algorithms for plane nets in base b
Construction algorithms for plane nets in base b Gunther Leobacher, Friedrich Pillichshammer and Thomas Schell arxiv:1506.03201v1 [math.nt] 10 Jun 2015 Abstract The class of (0, m, s)-nets in base b has
More informationDyadic diaphony of digital sequences
Dyadic diaphony of digital sequences Friedrich Pillichshammer Abstract The dyadic diaphony is a quantitative measure for the irregularity of distribution of a sequence in the unit cube In this paper we
More informationSparse-grid polynomial interpolation approximation and integration for parametric and stochastic elliptic PDEs with lognormal inputs
Sparse-grid polynomial interpolation approximation and integration for parametric and stochastic elliptic PDEs with lognormal inputs Dinh Dũng Information Technology Institute, Vietnam National University
More informationRegularity of the density for the stochastic heat equation
Regularity of the density for the stochastic heat equation Carl Mueller 1 Department of Mathematics University of Rochester Rochester, NY 15627 USA email: cmlr@math.rochester.edu David Nualart 2 Department
More informationApproximation of BSDEs using least-squares regression and Malliavin weights
Approximation of BSDEs using least-squares regression and Malliavin weights Plamen Turkedjiev (turkedji@math.hu-berlin.de) 3rd July, 2012 Joint work with Prof. Emmanuel Gobet (E cole Polytechnique) Plamen
More information