printlogo
ETH Zuerich - Homepage
Department of Mathematics
 
print
  

Numerical Analysis of Stochastic Partial Differential Equations

Lectures begin: Wednesday, February 24

Testat requirement: 70% of exercises reasonably solved

Exam: oral, 30 minutes

Office hours: Thursday, 12:00 noon, HG G 56.1

Lecturer Prof. Christoph Schwab
Coordinator Claude Gittelson
Lectures Wednesday, 10:15 a.m. - 11:55 a.m., HG G 26.3

Thursday, 10:15 a.m. - 11:55 a.m., HG G 26.3

Problem Sets

Problem sets can be turned in during the lecture or in the mailbox at HG G 53.  For programming exercises, print out and hand in plots and other output, and send your code to Claude Gittelson.

Problem Set
Deadline  
Problem Set 1
Thu. March 11
 
Problem Set 2
Thu. March 18
 
Problem Set 3
Thu. April 1
 
Problem Set 4
Thu. April 15
Code
Problem Set 5
Thu. April 29
 
Problem Set 6, Template
Mon. May 17
Code
Problem Set 7
Tue. May 25
Code
Problem Set 8, Code
Wed. June 2
Code

Prerequisites

Contents

  1. Mathematical Foundations

    We briefly recapitulate the foundations.
    It is assumed that students have taken the above
    three courses.

    1. Linear Functional Analysis (recapitulation)

      Hilbert spaces, Lax-Milgram Lemma,
      Spectral Theory of compact, self-adjoint operators,
      Tensor-Product spaces and measures.

    2. Probability Theory (recapitulation)

      Probability Spaces,
      Stochastic processes,
      Random fields,
      Karhunen-Loeve Expansion,
      Gaussian Measures on Hilbert spaces,
      Bochner-Minlos Theorem.

    3. Numerical Analysis (recapitulation)

      h-, p- and hp-FEMs:
      basic approximation results and implementation,
      hierarchic bases, multilevel decompositions of FE-spaces.

  2. Elliptic sPDEs with random sources
    1. Basic examples, well-posedness, unique solvability
    2. First and higher moments
    3. Regularity of random solution and its moments
    4. Approximation of second and higher moments by sparse tensor FEM
  3. Elliptic sPDEs with random coefficients
    1. Basic examples, well-posedness, unique solvability
    2. Representations of random fields: Karhunen-Loeve and Multiresolution expansions
    3. Regularity and approximations spaces
    4. Sparse tensor Finite Element discretizations: implementation, error analysis
  4. Parabolic sPDEs
    1. Random forcing: white and colored
    2. Random coefficients

Literature

Required:


Supplementary Reading:


The following research articles will be used and referenced in the course of the lecture.


 

Wichtiger Hinweis:
Diese Website wird in älteren Versionen von Netscape ohne graphische Elemente dargestellt. Die Funktionalität der Website ist aber trotzdem gewährleistet. Wenn Sie diese Website regelmässig benutzen, empfehlen wir Ihnen, auf Ihrem Computer einen aktuellen Browser zu installieren. Weitere Informationen finden Sie auf
folgender Seite.

Important Note:
The content in this site is accessible to any browser or Internet device, however, some graphics will display correctly only in the newer versions of Netscape. To get the most out of our site we suggest you upgrade to a newer browser.
More information

© 2012 Mathematics Department | Imprint | Disclaimer | 2 July 2010
top