Program

Time: 8:30 am - 12:00 am, 14-17/11/2016

Teabreak: 10:00-10:30

 Day 1-14/11/2016:

  1. Background, motivation, and “tools of the trade" (Clayton Webster)
  2. Well-posed SPDEs, regularity, and numerical approximations (Clayton Webster)

 Day 2-15/11/2016:

  1. Orthogonal polynomials and best s-term approximation (Hoang Tran)
  2. Discrete least square and compressed sensing techniques (Hoang Tran)

 Day 3-16/11/2016:

  1. High-dimensional sparse grids via global Lagrange polynomials (Clayton Webster)
  2. Local adaptive sparse grid methods and applications (Guannan Zhang)

 Day 4-17/11/2016:

  1. Multilevel methods for parameterized PDEs (Guannan Zhang)
  2. Other topics, opportunities, and open discussion (ALL)