Multilevel accelerated quadrature for elliptic PDEs with random diffusion. Helmut Harbrecht Mathematisches Institut Universität Basel Switzerland
|
|
- Gertrude Amberlynn Bates
- 6 years ago
- Views:
Transcription
1 Multilevel accelerated quadrature for elliptic PDEs with random diffusion Mathematisches Institut Universität Basel Switzerland
2 Overview Computation of the Karhunen-Loéve expansion Elliptic PDE with uniformly elliptic random diffusion Parameterized problem Discretization Multilevel quadrature Extension to elliptic PDEs with log-normal random diffusion Numerical results
3 Part. Karhunen-Loéve expansion
4 Karhunen-Loève expansion To separate spatial and stochastic variables, approximate the stochastic field a L P( Ω;L (D) ) by the truncated Karhunen-Loève expansion a(x,ω) E[a](x) + M λi ϕ i (x)y i (ω) i= with orthogonal collections {ϕ i } L (D) and {Y i } L P (Ω). The Karhunen-Loève expansion involves the computation of the dominant eigenpairs (λ i,ϕ i ) of the integral operator (Cϕ i )(x) = Cov[a](x,y)ϕ i(y)dy = λ i ϕ i (x), x D D with covariance kernel ( )( ) Cov[a](x, y) = a(x,ω) E[a](x) a(y,ω) E[a](y) dp(ω) L (D D). Ω eigenvalue problem for a nonlocal operator requires fast methods Theorem: If a LP( Ω;H p (D) ), then the eigenvalues {λ m } m N of C decay like λ m m (p+d)/d as m.
5 Discretization I Consider a family of quasi-uniform triangulations T h for D of mesh width h and spaces V r h := {v h : D R : v T is a polynomial of order r for all T T h } L (D). Then, given a function v H p (D) with p r, it holds the approximation estimated v Q h v L (D) := inf v v v h Vh r h L (D) hp v H p (D). Theorem. Let N = dimv r h, λ λ... be the eigenvalues of the covariance operator C and λ,h λ,h... λ N,h those of C h = Q h CQ h. Then, with a = a E[a], it holds a Q h a L P (Ω;L (D)) = tracec tracec h h min{p,r} a L P (Ω;H p (D)) and therefore a Q h a L P (Ω;L (D)) = N (λ m λ m,h ) + λ m. m= m=n+
6 Discretization II The theorem remains valid if we introduce the additional orthogonal proection P h : V r h U onto an M-dimensional subspace U V r h. The related proected random field is given by a h,m := a h + P h a,h = Q h E[a] + P h Q h a and its covariance according to C h,m := P h C h P h. Theorem: Let C h = Q h CQ h, C h,m = P h C h P h and a h,m = a h + P h a,h. Then, there holds a a h,m L P (Ω;L (D)) tracec h tracec h,m + h min{p,r}, where the hidden constant involves the L P( Ω;H p (D) ) -norm of a. discretization by finite elements yields a generalized eigenvalue problem use the Lanczos method to compute the dominant eigenpairs ARPACK apply a fast boundary element method to provide a fast matrix-vector product ACA
7 Alternative approach Generalized eigenvalue problem: Ax = λbx, A = [(Cφ i,φ )] i,, B = [(φ i,φ )] i, Inserting the low-rank approximation by the pivoted Cholesky decomposition A A m := L m L T m, L m R n m leads to L m L T mx = λbx B / L m L T mb / x = λ x, x = B / x. Since the nonzero eigenvalues of MM T and M T M coincide, we can replace the large eigenvalue problem by a small one L T mb L }{{ m } x = λ x, x = B L m x. R m m Error estimate: (Bauer/Fike) λ k λ k B / (A A m )B / A A m, k =,,...,m
8 Eigenvalue computation Gauss kernel exp( x y ): Approximate spectrum for ε =./././. Exponential kernel exp( x y ): Approximate spectrum for ε =./././. 8 8
9 Covariance kernels of Matèrn class.9.8. Matern / Matern / Matern / Matern 9/ Matern Matern / Matern / Matern / Matern 9/ fit (C=9.9) fit (C=.) fit (C=8.) fit (C=.98) y value x value y value 8 m Matern kernels for ν = p + /: ( k ν (r) = exp ) νr l p p! (p)! i= ( ) (p + i)! 8νr p i. i!(p i)! l ν = / corresponds to the exponential kernel k / (r) = exp( x y /l) ν = corresponds to the Gaussian kernel k (r) = exp ( x y /(l ) ) these are the generating kernels for the Sobolev spaces on R d the eigenvalues behave like λ m m (ν+d)/d
10 Numerical examples for the sphere ACA and ARPACK ν = / ν = / ν = / ν = 9/ (9) () () () 8 () () () 9 (9) 8 (9) () () () () (9) () () () 9 (8) 9 (9) (9) 8 (89) 9 () (8) () 98 (9) () () 8 (8) 8 8 (9) () (9) () Pivoted Cholesky decomposition ν = / ν = / ν = / ν = 9/ () () () () 9 () () () () 9 () 9 () () () (8) (8) 8 () () 9 () 9 () 8 () (9) 9 (8) (8) 89 (9) (9) (8) 9 () () 9 (9) 8 (8) (9) 9 () () Matern 9/ Matern / Matern / Matern / trace error time (s) trace error trace error error ACA (full subspaces) error ACA (full subspaces) error ACA (full subspaces) error ACA (full subspaces) error ACA error ACA error ACA error ACA error PCD error PCD error PCD error PCD error PCD (with recompress) error PCD (with recompress) error PCD (with recompress) error PCD (with recompress) Asymptotics Asymptotics Asymptotics Asymptotics Matern 9/ time assembly ACA total time ACA (full subspaces) total time ACA time PCD time PCD (with recompress) time (s) Matern / time assembly ACA total time ACA (full subspaces) total time ACA time PCD time PCD (with recompress) time (s) Matern / time assembly ACA total time ACA (full subspaces) total time ACA time PCD time PCD (with recompress) trace error time (s) Matern / time assembly ACA total time ACA (full subspaces) total time ACA time PCD time PCD (with recompress)
11 Numerical examples for a plate geometry ν = / () () 8 (8) 8 (9) (9) 98(8) Matern / Matern / Matern / time assembly ACA total time ACA time PCD time PCD (with recompress) time assembly ACA total time ACA time PCD time PCD (with recompress) time (s) error ACA error PCD error PCD (with recompress) Asymptotics time (s) time (s) time assembly ACA total time ACA time PCD time PCD (with recompress) Matern / time assembly ACA total time ACA time PCD time PCD (with recompress) error ACA error PCD error PCD (with recompress) Asymptotics Matern 9/ error ACA error PCD error PCD (with recompress) Asymptotics time (s) trace error error ACA error PCD error PCD (with recompress) Asymptotics trace error trace error ν= () () () () () () Matern / ν = 9/ 9 (9) () () 9 () 8 (9) () Matern / ν = / 9 (9) () () () 9 () () trace error Matern 9/ ν = / () 9 () () () 8 (9) ()
12 Part. Uniformly elliptic diffusion
13 Problem statement elliptic boundary value problems can be solved with high accuracy, provided that the input data are known exactly practical significance of highly accurate numerical solutions is limited due to inexact input data Model problem: (elliptic problem with random coefficient) div x ( a(x,ω) x u(x,ω) ) = f (x) u(x,ω) = (x,ω) D Ω (x,ω) D Ω where D R d is a convex, polygonal domain or C -smooth (d =,) (Ω, Σ, P) is a complete probability space and < a min := essinf x D a(x,ω) esssupa(x,ω) =: a max < almost surely x D Quantities of interest: general functional: QoI[u](x) = F ( u(x,ω) ) dp(ω) Ω expectation: E[u](x) = u(x,ω)dp(ω) Ω ( ) [ variance: Var[u](x) = u(x,ω) E[u](x) dp(ω) = E u ] (x) E[u](x) Ω
14 Parameterized problem Assume a finite Karhunen-Loéve expansion of a, i.e., m a(x,ω) = E a (x) + σ k ϕ k (x)y k (ω) k= where Y k : Ω [,] are independent random variables with density functions ρ k. By introducing coordinates y := [,] m, we obtain the parameterized diffusion coefficient a(x,y) = E a (x) + and thus arrive at the parametrized problem m σ k ϕ k (x)y k k= div x ( a(x,y) x u(x,y) ) = f (x) u(x,y) = (x,y) D (x,y) D We are thus looking for where ρ(y) = m k= ρ k(y k ). QoI[u](x) = F ( u(x,y) ) ρ(y)dy The map y u(y) is analytic as a mapping H (D) provided that the eigenfunctions in the KL-expansion are in W, (D) ( Cohen/DeVore/Schwab []).
15 Quadrature in the stochastic variable We shall provide a sequence of quadrature formulae Q l : L ρ( ;X ) X, Q l v = N l ω l,i v(,ξ l,i )ρ(ξ l,i ) i= for the high-dimensional Bochner integral Int : Lρ( ;X ) X, Intv = v(,y)ρ(y)dy where X L (D) denotes a Banach space. It is supposed to provide the error bound (Int Q l )v X ε l v H ( ;X ) ε l = l uniformly in l N, where H ( ;X ) L ρ( ;X ) is a suitable Bochner space. Monte Carlo method quasi-monte Carlo method tensor product quadrature sparse grid quadrature
16 Quadrature in the stochastic variable MC method. Satisfies ε l = N / l H ( ;X ) = Lρ( ;X ). q with respect to the root mean square error for Quasi MC method. Let the densities ρ k be in W, ([,]). Then, it typically holds ε l = Nl (logn l ) m and H ( ;X ) = W, mix ( ;X ), where v, := W mix ( ;X ) q y q v(y) yq yq m dy <. m X Gaussian quadrature. If v : X is analytical, then a tensor product Gaussian quadrature rule gives ε l = exp( bn /m l ) and H ( ;X ) = L ( ;X ). In fact, the polynomial chaos approach can be interpreted as a dimension weighted tensor product Gaussian quadrature rule where the weights depend on the numbers {σ k ϕ k L (D) }. Clenshaw-Curtis quadrature. Let the densities ρ k be in W r, ([,]). If v: X has mixed regularity of order r with respect to the parameter y, i.e. α y v L ( ;X ) <. v r, W mix ( ;X ) := max α r Then, a sparse tensor product Clenshaw-Curtis quadrature rule leads to the convergence rate ε l = Nl r (logn l ) m and H ( ;X ) = W r, mix ( ;X ).
17 Finite element approximation in the spatial variable Introduce a sequence of quasi-uniform triangulations T l of D with h l l. Define the finite element spaces S l (D) := {v C(D) : v τ P for all τ T l and v(x) = for all nodes x D} For any y, the finite element solution to the problem find u l (y) S l (D) such that α(x,y) u l(y) v l dx = D D f v l dx for all v l S l (D) satisfies the error estimates u(y) u l (y) H (D) l f L (D) u (y) u l (y) W, (D) l f L (D) with constants depending only on the ratio of a min and a max.
18 Variance reduction method For sake of simplicity, assume that the output functional F is a linear functional F : H (D) R. Use the multilevel splitting for a given function u V : for computing u = u + ( u } {{ u } ) + + ( u u ) + ( u }{{} u }{{ } H (D) H (D) H (D) ) F (u ) = F (u ) +F (u u ) + +F (u }{{} u ) +F (u }{{} u ) }{{} Idea. Exploit this decay for quadrature: F ( u (y) ) ρ(y)dy = F ( u (y) ) ρ(y)dy + F ( (u u )(y) ) ρ(y)dy + }{{} + F ( (u u )(y) ) ρ(y)dy + }{{} F ( (u u )(y) ) ρ(y)dy. }{{}
19 Review of sparse grids Consider two multiscale sequences: V () V () V () H, V () V () V () H The starting point for the sparse grid construction are multilevel decompositions V () = W () W () W (), V () = W () W () W (). The sparse tensor product space is given by V = W () l W () l l+l Given that the dimensions of {V () l } and {V () form geometric series, V contains essentially only degrees of freedom. max { dimv (),dimv () } V offers nearly the same approximation power as V () V () provided that the obect to be approximated offers some extra smoothness by means of mixed regularity. l } W () W () W () W () W () W () W () W () W () W ()
20 Alternative representation of sparse grids W () W () W () W () W () W () W () W () W () W () W () V () W () V () W () V () W () V () W () V () W () V () W () V () W () V () W () V () W () V () Factoring out with respect to the first component, one can rewrite the sparse grid space according to ( l ) V = W () l W () l = W () l V () l = ( V () l V () ) l V () l (SG) l= l = l= l= and give up the nestedness of {V () l }. sparse grid combination technique Likewise, we can give up the nestedness of {V () l } in the representation ( l ) V = W () l W () l = V () () l W l = V () ( l V () l V () ) l. (SG) l = l= l= l=
21 Multilevel quadrature estimator For our problem under consideration, the sequence {V () l } corresponds now to finite element spaces of increasing resolution and {V () l } refers to a sequence of quadrature rules of increasing precision. With respect to the representation (SG), we arrive at where F ( u(y) ) ρ(y)dy ( ) Q l F l u(y), l= F l ( u(y) ) := F ( ul (y) ) F ( u l (y) ), F ( u (y) ) :=. (MLQ) Likewise, with respect to the representation (SG), we obtain F ( u(y) ) ρ(y)dy where Q l F ( u l (y) ), l= Q l := Q l Q l, Q :=. (MLQ) Theorem. There holds the identity ( ) Q l F l u(y) = l= Q l F ( u l (y) ). l=
22 Complexity Theorem. Denote the cost of computing u for a specific y, including the cost of evaluating F, by C, where C σ C (σ > ). Moreover, let the sequence of quadrature formulae be nested, satisfying N θ N (θ > ). Then, the cost to compute (MLQ) is of order ( + )N σ C θ l σ l, l= whereas the cost to compute (MLQ) is of order N C θ l σ l. l= Typically, we have σ =,,8 for n =,,. Thus, we save about % work in D and still.% in D. The cost improvement comes for free. The factor σ might be improved by adaptive mesh refinement, resulting in a larger gain. The use of non-nested quadratures for (MLQ) yields the same cost as (MLQ) This would result in the sparse grid combination technique.
23 Error estimation for the multilevel quadrature I The error estimation of the multilevel quadrature is based on the generic estimate (Int Q l )(u p u p l ) X (l+l ) f p L (D), (GE) where X = H (D) if p = and X = W, (D) if p =. Theorem. Let {Q l } be a sequence of quadrature rules that satisfies the generic error estimate (GE). Then, the error of the multilevel estimator for the mean and the second moment is bounded by Intup Q l u p l f p L (D). l= X Remark. Here, we consider the equilibration of the accuracy. Instead, one can also consider the equilibration of the cost-benefit ratio or the equilibration of the cost.
24 Error estimation for the multilevel quadrature II Proof. We shall apply the following multilevel splitting of the error Intup Q l u p l = Intup Q u p + l= X Intu p Q u p X + Q l u p l= l= l= Q l u p l X Q l ( u p u p l) X. The first term simply reflects the quadrature error on the finest quadrature level and is bounded according to Intu p Q u p X f p L (D). In view of the generic estimate (GE), the term inside the sum satisfies ( Q l u p u p ) X l (Int Q l ) ( u p u p ) X l + (Int Q l ) ( u p u p ) X l (l+ l) f p L (D) + (l + l) f p L (D) f p L (D). Thus, we arrive at the assertion as follows Intup Q l u p l f p L (D) + f p L (D) f p L (D). l= X l=
25 Some remarks The representation (MLQ) yields the traditional multilevel quadrature, often motivated as a variance reduction method. The representation (MLQ) is simple to implement and requires only a black box finite element solver. In particular, adaptivity can be easily employed. Since the Monte Carlo quadrature needs no regularity, the multilevel Monte Carlo quadrature always works. Nevertheless, for the problem under consideration, it can be shown that α ( y u p u p ) l (y) X l α!c α f p L for all α N m. (D) This holds also for log-normally distributed diffusion coefficients. Easy to parallelize if one levelwise distributes specific samples to the different cores. If one is interested in the two-point correlation instead of the variance, one can use a sparse tensor product approximation. The cost complexity depends on the specific quadrature rule: quadrature method d = d = d = MLMC 8 MLQMC m 8 ML(S)GQ 8
26 Numerical results: Analytical example on the unit ball We solve div ( a(y) u(y) ) = in H (D) where α(y) = ( i= ( y ) ) i. Thus, it holds E[u(y)] = E and therefore [ i= ( y ) ] i = E[u](x) = ( x ). Error - - MLQMC MLCC MLMC Asymptotics h h
27 Numerical results: A more complex geometry I We solve div ( a(y) u(y) ) = in H (D) where α(x,y) = + exp( x ) ( sin(πx )y + sin(πx )y + sin(πx )y + 8 sin(πx )sin(πx )y + sin(πx )sin(πx )y + ) sin(πx )sin(πx )y. A reference solution is computed on a mesh with 9 9 tetrahedrons (h =.9) by samples of the Halton sequence.
28 Numerical results: A more complex geometry II expectation variance Error Error - - MLQMC MLCC MLMC Asymptotics h.8... h.. MLQMC MLCC MLMC Asymptotics h h
29 Part. Log-normal diffusion
30 Problem with log-normal diffusion coefficient Problem: (elliptic problem with log-normally distributed random coefficient) div x ( a(x,ω) x u(x,ω) ) = f (x) u(x,ω) = (x,ω) D Ω (x,ω) D Ω where a(x,ω) = exp ( b(x,ω) ) for a Gaussian random field b where D R d is a convex, polygonal domain or C -smooth (d =,) (Ω, Σ, P) is a complete probability space We assume that a L P (Ω;C (D) ). Then, it holds < a min (ω) := essinf x D with /a min,a max L P (Ω). a(x,ω) esssupa(x,ω) =: a max (ω) < almost surely x D Quantities of interest: general functional: QoI[u](x) = F ( u(x,ω) ) dp(ω) Ω expectation: E[u](x) = u(x,ω)dp(ω) Ω [ ] variance: Var[u](x) = u(x,ω) E[u](x) dp(ω) = Eu (x) E[u] (x) Ω
31 Parameterized problem Assume a finite Karhunen-Loéve expansion of b, i.e., m b(x,ω) = E[b](x) + σ k ϕ k (x)y k (ω) k= with independent Gaussian random variables Y k N (,). By introducing coordinates y R m we obtain the parameterized diffusion coefficient ( m ) a(x,y) = exp E[b](x) + σ k ϕ k (x)y k k= and thus arrive at the parametrized problem div x ( a(x,y) x u(x,y) ) = f (x) u(x,y) = (x,y) D R m (x,y) D R m We are thus looking for QoI[u](x) = F ( u(x,y) ) ρ(y)dy where ρ(y) = (π) m/ exp( y /). The map y u(y) is analytic as a mapping R m H (D) provided that the eigenfunctions in the KL-expansion are in W, (D) ( Schwab/Hoang []).
32 Quadrature in the stochastic variable We shall provide a sequence of quadrature formulae for the Bochner integral Q l : L ρ(r m ;X ) X, Q l v = Int : L ρ(r m ;X ) X, Intv = N l ω l,i v(,ξ l,i ) i= R m v(,y)ρ(y)dy where X L (D) denotes a Banach space. It is supposed to provide the error bound (Int Q l )v X ε l v H (R m ;X ) uniformly in l N, where H (R m ;X ) L ρ(r m,x) is a suitable Bochner space. MC method. Satisfies ε l = N / l in the mean for H (R m ;X ) = Lρ(R m ;X ). Quasi MC method. Yields typically ε l = Nl (logn l ) m and H (R m ;X ) =W, mix (Rm ;X ). requires auxiliary density function exp( y /) to ensure convergence! Hermite Gaussian quadrature. If v : R m X is analytical, then the tensor product Hermite Gaussian quadrature rule gives ε l = exp ( bn /(m) l ) and H (R m ;X ) := C σ (R m ;X ) = { v: R m X, v is continuous and max y R m σ(y)v(,y) X < }.
33 Finite element approximation in the spatial variable Introduce a sequence of quasi-uniform triangulations T l of D with h l l. Define the finite element spaces S l (D) := {v C(D) : v τ P for all τ T l and v(x) = for all nodes x D} For any y, the finite element solution to the problem find u l (y) S l (D) such that α(x,y) u l(y) v l dx = D D f v l dx for all v l S l (D) satisfies the error estimates u(y) u l (y) H (D) l α max (y) α min (y) f L (D) u (y) u l (y) W, (D) l α max (y) α min (y) f L (D). Midpoint rule is sufficient for the spatial quadrature of the diffusion coefficient!
34 Numerical results: finite dimensional stochastics Problem. Seek u(ω) H (D) such that div ( exp(α(ω)) u(ω) ) = in D where α(x,ω) = χ B (x)ψ (ω) + χ B (x)ψ (ω) + χ B (x)ψ (ω) + χ B (x)ψ (ω) E α (x) =, Cov α (x,y) = χ B (x)χ B (y) i=
35 Numerical results: finite dimensional stochastics expectation second moment Error Error MC QMC (δ=) QMC (δ=.) QMC (δ=.) GQ l Asymptotics l MC QMC (δ=) QMC (δ=.) QMC (δ=.) GQ l Asymptotics l
36 Infinite dimensional stochastics: m Karhunen-Loéve expansion: ( m ) a(x,y) = exp E[b](x) + σ k ϕ k (x)y k k= If the number m of terms tends to, the Monte Carlo method does not care. The quasi Monte Carlo method does not care either! Theorem: Define γ k := σ k ϕ k L (D) and assume that γ k k ε for some ε >. Then, the QMC quadrature using Halton points for approximating the expectation of the solution u is polynomial tractable. More precisely, for each δ > there exists a constant such that the error of the N-point QMC quadrature using Halton points satisfies E[u] Q N u H (D) mn +δ f L (D), E u Q N u W, (D) mn +δ f L (D).
37 Numerical results: infinite dimensional stochastics Problem. Seek u(ω) H(D) such that div exp(a(ω)) u(ω) = in D where D = (, ), E[a](x) =, and Cov[a](x, y) = exp( kx yk/). expectation second moment Error Error MC QMC (δ=) QMC (δ=.) QMC (δ=.) GQ Asymptotics l l 8 MC QMC (δ=) QMC (δ=.) QMC (δ=.) GQ Asymptotics l l 8
38 Part. Summary
39 Summary We have shown that the multilevel Monte Carlo method is nothing but the sparse grid combination technique. We have used this knowledge to extend the multilevel Monte Carlo method to general multilevel quadrature methods. We have reversed the construction of the multilevel quadrature which enables us to give up the nestedness of the spatial approximation spaces. The cost can be considerably reduced by application of nested quadrature formulae. Any quadrature that provides the generic estimate (Int Q l )(u p u p l ) X (l+l ) f p L (D) for p =, is feasible for a multilevel quadrature method. requires mixed regularity! If also the spatial problem provides mixed regularity, then one can apply a higher dimensional sparse grid approach. multi-index Monte Carlo method
Karhunen-Loève Approximation of Random Fields Using Hierarchical Matrix Techniques
Institut für Numerische Mathematik und Optimierung Karhunen-Loève Approximation of Random Fields Using Hierarchical Matrix Techniques Oliver Ernst Computational Methods with Applications Harrachov, CR,
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 informationMulti-Element Probabilistic Collocation Method in High Dimensions
Multi-Element Probabilistic Collocation Method in High Dimensions Jasmine Foo and George Em Karniadakis Division of Applied Mathematics, Brown University, Providence, RI 02912 USA Abstract We combine multi-element
More informationBath Institute For Complex Systems
BICS Bath Institute for Complex Systems Finite Element Error Analysis of Elliptic PDEs with Random Coefficients and its Application to Multilevel Monte Carlo Methods Julia Charrier, Robert Scheichl and
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 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 informationA MULTILEVEL STOCHASTIC COLLOCATION METHOD FOR PARTIAL DIFFERENTIAL EQUATIONS WITH RANDOM INPUT DATA
A MULTILEVEL STOCHASTIC COLLOCATION METHOD FOR PARTIAL DIFFERENTIAL EQUATIONS WITH RANDOM INPUT DATA A. L. TECKENTRUP, P. JANTSCH, C. G. WEBSTER, AND M. GUNZBURGER Abstract. Stochastic collocation methods
More informationAdaptive Collocation with Kernel Density Estimation
Examples of with Kernel Density Estimation Howard C. Elman Department of Computer Science University of Maryland at College Park Christopher W. Miller Applied Mathematics and Scientific Computing Program
More informationLecture 1: Center for Uncertainty Quantification. Alexander Litvinenko. Computation of Karhunen-Loeve Expansion:
tifica Lecture 1: Computation of Karhunen-Loeve Expansion: Alexander Litvinenko http://sri-uq.kaust.edu.sa/ Stochastic PDEs We consider div(κ(x, ω) u) = f (x, ω) in G, u = 0 on G, with stochastic coefficients
More informationAccuracy, Precision and Efficiency in Sparse Grids
John, Information Technology Department, Virginia Tech.... http://people.sc.fsu.edu/ jburkardt/presentations/ sandia 2009.pdf... Computer Science Research Institute, Sandia National Laboratory, 23 July
More informationSolving the steady state diffusion equation with uncertainty Final Presentation
Solving the steady state diffusion equation with uncertainty Final Presentation Virginia Forstall vhfors@gmail.com Advisor: Howard Elman elman@cs.umd.edu Department of Computer Science May 6, 2012 Problem
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 informationHierarchical Parallel Solution of Stochastic Systems
Hierarchical Parallel Solution of Stochastic Systems Second M.I.T. Conference on Computational Fluid and Solid Mechanics Contents: Simple Model of Stochastic Flow Stochastic Galerkin Scheme Resulting Equations
More informationStochastic Spectral Approaches to Bayesian Inference
Stochastic Spectral Approaches to Bayesian Inference Prof. Nathan L. Gibson Department of Mathematics Applied Mathematics and Computation Seminar March 4, 2011 Prof. Gibson (OSU) Spectral Approaches to
More informationMulti-Level Monte-Carlo Finite Element Methods for stochastic elliptic variational inequalities
Multi-Level Monte-Carlo Finite Element Methods for stochastic elliptic variational inequalities R. Kornhuber and C. Schwab and M. Wolf Research Report No. 2013-12 April 2013 Seminar für Angewandte Mathematik
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 informationKernel-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 informationMonte Carlo Methods for Uncertainty Quantification
Monte Carlo Methods for Uncertainty Quantification Mike Giles Mathematical Institute, University of Oxford Contemporary Numerical Techniques Mike Giles (Oxford) Monte Carlo methods 1 / 23 Lecture outline
More informationNovember 7, 2002 GALERKIN FINITE ELEMENT APPROXIMATIONS OF STOCHASTIC ELLIPTIC PARTIAL DIFFERENTIAL EQUATIONS
November 7, 00 GALERKIN FINITE ELEMENT APPROXIMATIONS OF STOCHASTIC ELLIPTIC PARTIAL IFFERENTIAL EQUATIONS IVO BABUŠKA, RAÚL TEMPONE AN GEORGIOS E. ZOURARIS Abstract. We describe and analyze two numerical
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 informationFoundations of the stochastic Galerkin method
Foundations of the stochastic Galerkin method Claude Jeffrey Gittelson ETH Zurich, Seminar for Applied Mathematics Pro*oc Workshop 2009 in isentis Stochastic diffusion equation R d Lipschitz, for ω Ω,
More informationApproximating Infinity-Dimensional Stochastic Darcy s Equations without Uniform Ellipticity
Approximating Infinity-Dimensional Stochastic Darcy s Equations without Uniform Ellipticity Marcus Sarkis Jointly work with Juan Galvis USC09 Marcus Sarkis (WPI) SPDE without Uniform Ellipticity USC09
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 informationNumerical Approximation of Stochastic Elliptic Partial Differential Equations
Numerical Approximation of Stochastic Elliptic Partial Differential Equations Hermann G. Matthies, Andreas Keese Institut für Wissenschaftliches Rechnen Technische Universität Braunschweig wire@tu-bs.de
More informationSolving the Stochastic Steady-State Diffusion Problem Using Multigrid
Solving the Stochastic Steady-State Diffusion Problem Using Multigrid Tengfei Su Applied Mathematics and Scientific Computing Advisor: Howard Elman Department of Computer Science Sept. 29, 2015 Tengfei
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 informationDownloaded 01/28/13 to Redistribution subject to SIAM license or copyright; see
SIAM J. SCI. COMPUT. Vol. 27, No. 3, pp. 1118 1139 c 2005 Society for Industrial and Applied Mathematics HIGH-ORDER COLLOCATION METHODS FOR DIFFERENTIAL EQUATIONS WITH RANDOM INPUTS DONGBIN XIU AND JAN
More informationFinite Elements. Colin Cotter. January 15, Colin Cotter FEM
Finite Elements January 15, 2018 Why Can solve PDEs on complicated domains. Have flexibility to increase order of accuracy and match the numerics to the physics. has an elegant mathematical formulation
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 informationMultigrid and stochastic sparse-grids techniques for PDE control problems with random coefficients
Multigrid and stochastic sparse-grids techniques for PDE control problems with random coefficients Università degli Studi del Sannio Dipartimento e Facoltà di Ingegneria, Benevento, Italia Random fields
More informationPolynomial Chaos and Karhunen-Loeve Expansion
Polynomial Chaos and Karhunen-Loeve Expansion 1) Random Variables Consider a system that is modeled by R = M(x, t, X) where X is a random variable. We are interested in determining the probability of the
More informationMultilevel Monte Carlo methods for highly heterogeneous media
Multilevel Monte Carlo methods for highly heterogeneous media Aretha L. Teckentrup University of Bath Claverton Down Bath, BA2 7AY, UK Abstract We discuss the application of multilevel Monte Carlo methods
More informationOn the convergence of the combination technique
Wegelerstraße 6 53115 Bonn Germany phone +49 228 73-3427 fax +49 228 73-7527 www.ins.uni-bonn.de M. Griebel, H. Harbrecht On the convergence of the combination technique INS Preprint No. 1304 2013 On
More informationSchwarz Preconditioner for the Stochastic Finite Element Method
Schwarz Preconditioner for the Stochastic Finite Element Method Waad Subber 1 and Sébastien Loisel 2 Preprint submitted to DD22 conference 1 Introduction The intrusive polynomial chaos approach for uncertainty
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 informationSparse Tensor Methods for PDEs with Stochastic Data II: Convergence Rates of gpcfem
Sparse Tensor Methods for PDEs with Stochastic Data II: Convergence Rates of gpcfem Christoph Schwab Seminar for Applied Mathematics ETH Zürich Albert Cohen (Paris, France) & Ron DeVore (Texas A& M) R.
More informationA Reduced Basis Approach for Variational Problems with Stochastic Parameters: Application to Heat Conduction with Variable Robin Coefficient
A Reduced Basis Approach for Variational Problems with Stochastic Parameters: Application to Heat Conduction with Variable Robin Coefficient Sébastien Boyaval a,, Claude Le Bris a, Yvon Maday b, Ngoc Cuong
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 informationSampling and Low-Rank Tensor Approximations
Sampling and Low-Rank Tensor Approximations Hermann G. Matthies Alexander Litvinenko, Tarek A. El-Moshely +, Brunswick, Germany + MIT, Cambridge, MA, USA wire@tu-bs.de http://www.wire.tu-bs.de $Id: 2_Sydney-MCQMC.tex,v.3
More informationJournal of Computational Physics
Journal of Computational Physics 229 (2010) 1536 1557 Contents lists available at ScienceDirect Journal of Computational Physics journal homepage: www.elsevier.com/locate/jcp Multi-element probabilistic
More informationEXPLORING THE LOCALLY LOW DIMENSIONAL STRUCTURE IN SOLVING RANDOM ELLIPTIC PDES
MULTISCALE MODEL. SIMUL. Vol. 5, No. 2, pp. 66 695 c 27 Society for Industrial and Applied Mathematics EXPLORING THE LOCALLY LOW DIMENSIONAL STRUCTURE IN SOLVING RANDOM ELLIPTIC PDES THOMAS Y. HOU, QIN
More informationarxiv: v1 [math.na] 14 Dec 2018
A MIXED l 1 REGULARIZATION APPROACH FOR SPARSE SIMULTANEOUS APPROXIMATION OF PARAMETERIZED PDES NICK DEXTER, HOANG TRAN, AND CLAYTON WEBSTER arxiv:1812.06174v1 [math.na] 14 Dec 2018 Abstract. We present
More informationAlgebraic Multigrid as Solvers and as Preconditioner
Ò Algebraic Multigrid as Solvers and as Preconditioner Domenico Lahaye domenico.lahaye@cs.kuleuven.ac.be http://www.cs.kuleuven.ac.be/ domenico/ Department of Computer Science Katholieke Universiteit Leuven
More informationComputer simulation of multiscale problems
Progress in the SSF project CutFEM, Geometry, and Optimal design Computer simulation of multiscale problems Axel Målqvist and Daniel Elfverson University of Gothenburg and Uppsala University Umeå 2015-05-20
More informationPreconditioned space-time boundary element methods for the heat equation
W I S S E N T E C H N I K L E I D E N S C H A F T Preconditioned space-time boundary element methods for the heat equation S. Dohr and O. Steinbach Institut für Numerische Mathematik Space-Time Methods
More informationMonte Carlo simulation inspired by computational optimization. Colin Fox Al Parker, John Bardsley MCQMC Feb 2012, Sydney
Monte Carlo simulation inspired by computational optimization Colin Fox fox@physics.otago.ac.nz Al Parker, John Bardsley MCQMC Feb 2012, Sydney Sampling from π(x) Consider : x is high-dimensional (10 4
More informationarxiv: v1 [math.na] 3 Apr 2019
arxiv:1904.02017v1 [math.na] 3 Apr 2019 Poly-Sinc Solution of Stochastic Elliptic Differential Equations Maha Youssef and Roland Pulch Institute of Mathematics and Computer Science, University of Greifswald,
More informationMultilevel stochastic collocations with dimensionality reduction
Multilevel stochastic collocations with dimensionality reduction Ionut Farcas TUM, Chair of Scientific Computing in Computer Science (I5) 27.01.2017 Outline 1 Motivation 2 Theoretical background Uncertainty
More informationASSESSMENT OF COLLOCATION AND GALERKIN APPROACHES TO LINEAR DIFFUSION EQUATIONS WITH RANDOM DATA
International Journal for Uncertainty Quantification, 11):19 33, 2011 ASSESSMENT OF COLLOCATION AND GALERKIN APPROACHES TO LINEAR DIFFUSION EQUATIONS WITH RANDOM DATA Howard C. Elman, 1, Christopher W.
More informationFast Numerical Methods for Stochastic Computations: A Review
COMMUNICATIONS IN COMPUTATIONAL PHYSICS Vol. 5, No. 2-4, pp. 242-272 Commun. Comput. Phys. February 2009 REVIEW ARTICLE Fast Numerical Methods for Stochastic Computations: A Review Dongbin Xiu Department
More informationConstrained Minimization and Multigrid
Constrained Minimization and Multigrid C. Gräser (FU Berlin), R. Kornhuber (FU Berlin), and O. Sander (FU Berlin) Workshop on PDE Constrained Optimization Hamburg, March 27-29, 2008 Matheon Outline Successive
More informationCollocation based high dimensional model representation for stochastic partial differential equations
Collocation based high dimensional model representation for stochastic partial differential equations S Adhikari 1 1 Swansea University, UK ECCM 2010: IV European Conference on Computational Mechanics,
More informationA Data-Driven Stochastic Method
A ata-riven Stochastic Method Mulin Cheng, Thomas Y. Hou, Pengchong Yan Applied and Computational Mathematics, California Institute of Technology, Pasadena, CA 96 Abstract Stochastic partial differential
More informationSimulating with uncertainty : the rough surface scattering problem
Simulating with uncertainty : the rough surface scattering problem Uday Khankhoje Assistant Professor, Electrical Engineering Indian Institute of Technology Madras Uday Khankhoje (EE, IITM) Simulating
More informationA Kernel-based Collocation Method for Elliptic Partial Differential Equations with Random Coefficients
A Kernel-based Collocation Method for Elliptic Partial Differential Equations with Random Coefficients Gregory E. Fasshauer and Qi Ye Abstract This paper is an extension of previous work where we laid
More informationEfficient approximation of random fields for numerical applications
Institutional Repository of the University of Basel University Library Schoenbeinstrasse 8-0 CH-0 Basel, Switzerland http://edoc.unibas.ch/ Year: 0 Efficient approximation of random fields for numerical
More informationFixed-domain Asymptotics of Covariance Matrices and Preconditioning
Fixed-domain Asymptotics of Covariance Matrices and Preconditioning Jie Chen IBM Thomas J. Watson Research Center Presented at Preconditioning Conference, August 1, 2017 Jie Chen (IBM Research) Covariance
More informationSliced Inverse Regression
Sliced Inverse Regression Ge Zhao gzz13@psu.edu Department of Statistics The Pennsylvania State University Outline Background of Sliced Inverse Regression (SIR) Dimension Reduction Definition of SIR Inversed
More information4. Numerical Quadrature. Where analytical abilities end... continued
4. Numerical Quadrature Where analytical abilities end... continued Where analytical abilities end... continued, November 30, 22 1 4.3. Extrapolation Increasing the Order Using Linear Combinations Once
More informationWeighted Regularization of Maxwell Equations Computations in Curvilinear Polygons
Weighted Regularization of Maxwell Equations Computations in Curvilinear Polygons Martin Costabel, Monique Dauge, Daniel Martin and Gregory Vial IRMAR, Université de Rennes, Campus de Beaulieu, Rennes,
More informationMicrostructurally-Informed Random Field Description: Case Study on Chaotic Masonry
Microstructurally-Informed Random Field Description: Case Study on Chaotic Masonry M. Lombardo 1 J. Zeman 2 M. Šejnoha 2,3 1 Civil and Building Engineering Loughborough University 2 Department of Mechanics
More informationRandom Eigenvalue Problems Revisited
Random Eigenvalue Problems Revisited S Adhikari Department of Aerospace Engineering, University of Bristol, Bristol, U.K. Email: S.Adhikari@bristol.ac.uk URL: http://www.aer.bris.ac.uk/contact/academic/adhikari/home.html
More informationH 2 -matrices with adaptive bases
1 H 2 -matrices with adaptive bases Steffen Börm MPI für Mathematik in den Naturwissenschaften Inselstraße 22 26, 04103 Leipzig http://www.mis.mpg.de/ Problem 2 Goal: Treat certain large dense matrices
More informationarxiv: v1 [math.na] 11 Jul 2011
Multigrid Preconditioner for Nonconforming Discretization of Elliptic Problems with Jump Coefficients arxiv:07.260v [math.na] Jul 20 Blanca Ayuso De Dios, Michael Holst 2, Yunrong Zhu 2, and Ludmil Zikatanov
More informationResearch Article A Pseudospectral Approach for Kirchhoff Plate Bending Problems with Uncertainties
Mathematical Problems in Engineering Volume 22, Article ID 7565, 4 pages doi:.55/22/7565 Research Article A Pseudospectral Approach for Kirchhoff Plate Bending Problems with Uncertainties Ling Guo, 2 and
More informationSolving the stochastic steady-state diffusion problem using multigrid
IMA Journal of Numerical Analysis (2007) 27, 675 688 doi:10.1093/imanum/drm006 Advance Access publication on April 9, 2007 Solving the stochastic steady-state diffusion problem using multigrid HOWARD ELMAN
More informationA Vector-Space Approach for Stochastic Finite Element Analysis
A Vector-Space Approach for Stochastic Finite Element Analysis S Adhikari 1 1 Swansea University, UK CST2010: Valencia, Spain Adhikari (Swansea) Vector-Space Approach for SFEM 14-17 September, 2010 1 /
More informationMULTIGRID PRECONDITIONING IN H(div) ON NON-CONVEX POLYGONS* Dedicated to Professor Jim Douglas, Jr. on the occasion of his seventieth birthday.
MULTIGRID PRECONDITIONING IN H(div) ON NON-CONVEX POLYGONS* DOUGLAS N ARNOLD, RICHARD S FALK, and RAGNAR WINTHER Dedicated to Professor Jim Douglas, Jr on the occasion of his seventieth birthday Abstract
More informationarxiv: v2 [math.pr] 27 Oct 2015
A brief note on the Karhunen-Loève expansion Alen Alexanderian arxiv:1509.07526v2 [math.pr] 27 Oct 2015 October 28, 2015 Abstract We provide a detailed derivation of the Karhunen Loève expansion of a stochastic
More informationBlock-diagonal preconditioning for spectral stochastic finite-element systems
IMA Journal of Numerical Analysis (2009) 29, 350 375 doi:0.093/imanum/drn04 Advance Access publication on April 4, 2008 Block-diagonal preconditioning for spectral stochastic finite-element systems CATHERINE
More informationMaximum norm estimates for energy-corrected finite element method
Maximum norm estimates for energy-corrected finite element method Piotr Swierczynski 1 and Barbara Wohlmuth 1 Technical University of Munich, Institute for Numerical Mathematics, piotr.swierczynski@ma.tum.de,
More informationTECHNISCHE UNIVERSITÄT BERLIN
TECHNISCHE UNIVERSITÄT BERLIN Adaptive Stochastic Galerkin FEM with Hierarchical Tensor Representations Martin Eigel Max Pfeffer Reinhold Schneider Preprint 2015/29 Preprint-Reihe des Instituts für Mathematik
More informationA Preconditioned Recycling GMRES Solver for Stochastic Helmholtz Problems
COMMUNICATIONS IN COMPUTATIONAL PHYSICS Vol. 6, No. 2, pp. 342-353 Commun. Comput. Phys. August 2009 A Preconditioned Recycling GMRES Solver for Stochastic Helmholtz Problems Chao Jin 1 and Xiao-Chuan
More informationarxiv: v2 [math.na] 8 Apr 2017
A LOW-RANK MULTIGRID METHOD FOR THE STOCHASTIC STEADY-STATE DIFFUSION PROBLEM HOWARD C. ELMAN AND TENGFEI SU arxiv:1612.05496v2 [math.na] 8 Apr 2017 Abstract. We study a multigrid method for solving large
More informationKarhunen-Loève decomposition of Gaussian measures on Banach spaces
Karhunen-Loève decomposition of Gaussian measures on Banach spaces Jean-Charles Croix jean-charles.croix@emse.fr Génie Mathématique et Industriel (GMI) First workshop on Gaussian processes at Saint-Etienne
More informationIntroduction to Uncertainty Quantification in Computational Science Handout #3
Introduction to Uncertainty Quantification in Computational Science Handout #3 Gianluca Iaccarino Department of Mechanical Engineering Stanford University June 29 - July 1, 2009 Scuola di Dottorato di
More informationYongdeok Kim and Seki Kim
J. Korean Math. Soc. 39 (00), No. 3, pp. 363 376 STABLE LOW ORDER NONCONFORMING QUADRILATERAL FINITE ELEMENTS FOR THE STOKES PROBLEM Yongdeok Kim and Seki Kim Abstract. Stability result is obtained for
More informationIterative methods for positive definite linear systems with a complex shift
Iterative methods for positive definite linear systems with a complex shift William McLean, University of New South Wales Vidar Thomée, Chalmers University November 4, 2011 Outline 1. Numerical solution
More informationarxiv: v2 [math.na] 5 Dec 2013
ACTIVE SUBSPACE METHODS IN THEORY AND PRACTICE: APPLICATIONS TO KRIGING SURFACES PAUL G. CONSTANTINE, ERIC DOW, AND QIQI WANG arxiv:1304.2070v2 [math.na 5 Dec 2013 Abstract. Many multivariate functions
More informationVARIATIONAL AND NON-VARIATIONAL MULTIGRID ALGORITHMS FOR THE LAPLACE-BELTRAMI OPERATOR.
VARIATIONAL AND NON-VARIATIONAL MULTIGRID ALGORITHMS FOR THE LAPLACE-BELTRAMI OPERATOR. ANDREA BONITO AND JOSEPH E. PASCIAK Abstract. We design and analyze variational and non-variational multigrid algorithms
More informationComputer Intensive Methods in Mathematical Statistics
Computer Intensive Methods in Mathematical Statistics Department of mathematics johawes@kth.se Lecture 16 Advanced topics in computational statistics 18 May 2017 Computer Intensive Methods (1) Plan of
More informationDinesh Kumar, Mehrdad Raisee and Chris Lacor
Dinesh Kumar, Mehrdad Raisee and Chris Lacor Fluid Mechanics and Thermodynamics Research Group Vrije Universiteit Brussel, BELGIUM dkumar@vub.ac.be; m_raisee@yahoo.com; chris.lacor@vub.ac.be October, 2014
More informationAdaptive methods for control problems with finite-dimensional control space
Adaptive methods for control problems with finite-dimensional control space Saheed Akindeinde and Daniel Wachsmuth Johann Radon Institute for Computational and Applied Mathematics (RICAM) Austrian Academy
More informationSlow Growth for Gauss Legendre Sparse Grids
Slow Growth for Gauss Legendre Sparse Grids John Burkardt, Clayton Webster April 4, 2014 Abstract A sparse grid for multidimensional quadrature can be constructed from products of 1D rules. For multidimensional
More informationNon-Conforming Finite Element Methods for Nonmatching Grids in Three Dimensions
Non-Conforming Finite Element Methods for Nonmatching Grids in Three Dimensions Wayne McGee and Padmanabhan Seshaiyer Texas Tech University, Mathematics and Statistics (padhu@math.ttu.edu) Summary. In
More informationConvergence Rates of Kernel Quadrature Rules
Convergence Rates of Kernel Quadrature Rules Francis Bach INRIA - Ecole Normale Supérieure, Paris, France ÉCOLE NORMALE SUPÉRIEURE NIPS workshop on probabilistic integration - Dec. 2015 Outline Introduction
More informationarxiv: v2 [math.na] 17 Oct 2017
Modern Monte Carlo Variants for Uncertainty Quantification in Neutron Transport Ivan G. Graham, Matthew J. Parkinson, and Robert Scheichl arxiv:1702.03561v2 [math.na] 17 Oct 2017 Dedicated to Ian H. Sloan
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 informationH(div) Preconditioning for a Mixed Finite Element Formulation of the Stochastic Diffusion Problem 1
University of Maryland Department of Computer Science CS-TR-4918 University of Maryland Institute for Advanced Computer Studies UMIACS-TR-2008-15 H(div) Preconditioning for a Mixed Finite Element Formulation
More informationPascal s Triangle on a Budget. Accuracy, Precision and Efficiency in Sparse Grids
Covering : Accuracy, Precision and Efficiency in Sparse Grids https://people.sc.fsu.edu/ jburkardt/presentations/auburn 2009.pdf... John Interdisciplinary Center for Applied Mathematics & Information Technology
More informationHilbert Space Methods for Reduced-Rank Gaussian Process Regression
Hilbert Space Methods for Reduced-Rank Gaussian Process Regression Arno Solin and Simo Särkkä Aalto University, Finland Workshop on Gaussian Process Approximation Copenhagen, Denmark, May 2015 Solin &
More informationLaplace s Equation. Chapter Mean Value Formulas
Chapter 1 Laplace s Equation Let be an open set in R n. A function u C 2 () is called harmonic in if it satisfies Laplace s equation n (1.1) u := D ii u = 0 in. i=1 A function u C 2 () is called subharmonic
More informationAlgorithms for Uncertainty Quantification
Algorithms for Uncertainty Quantification Lecture 9: Sensitivity Analysis ST 2018 Tobias Neckel Scientific Computing in Computer Science TUM Repetition of Previous Lecture Sparse grids in Uncertainty Quantification
More informationNumerical Solution for Random Forced SPDE via Galerkin Finite Element Method
Journal of mathematics and computer science 9 (014), 71-8 umerical Solution for Random Forced SE via Galerkin Finite Element ethod Rasoul aseri, A. alek 1 epartment of Applied athematics, Faculty of athematical
More informationNUMERICAL METHODS FOR FRACTIONAL DIFFUSION Lecture 2: Spectral Fractional Laplacian
NUMERICAL METHODS FOR FRACTIONAL DIFFUSION Lecture 2: Spectral Fractional Laplacian Department of Mathematics and Institute for Physical Science and Technology University of Maryland, USA Nonlocal School
More informationAdaptive Finite Element Methods Lecture Notes Winter Term 2017/18. R. Verfürth. Fakultät für Mathematik, Ruhr-Universität Bochum
Adaptive Finite Element Methods Lecture Notes Winter Term 2017/18 R. Verfürth Fakultät für Mathematik, Ruhr-Universität Bochum Contents Chapter I. Introduction 7 I.1. Motivation 7 I.2. Sobolev and finite
More informationDifferentiation and Integration
Differentiation and Integration (Lectures on Numerical Analysis for Economists II) Jesús Fernández-Villaverde 1 and Pablo Guerrón 2 February 12, 2018 1 University of Pennsylvania 2 Boston College Motivation
More informationRadial Basis Functions I
Radial Basis Functions I Tom Lyche Centre of Mathematics for Applications, Department of Informatics, University of Oslo November 14, 2008 Today Reformulation of natural cubic spline interpolation Scattered
More informationResearch Collection. Multilevel Monte Carlo methods for stochastic elliptic multiscale PDEs. Report. ETH Library
Research Collection Report Multilevel Monte Carlo methods for stochastic elliptic multiscale PDEs Author(s): Abdulle, Assyr; Barth, Andrea; Schwab, Christoph Publication Date: 2012 Permanent Link: https://doi.org/10.3929/ethz-a-010394923
More informationCS 450 Numerical Analysis. Chapter 8: Numerical Integration and Differentiation
Lecture slides based on the textbook Scientific Computing: An Introductory Survey by Michael T. Heath, copyright c 2018 by the Society for Industrial and Applied Mathematics. http://www.siam.org/books/cl80
More information