AUBURN_2009.TEX
Covering Pascal's Triangle on a Budget:
Accuracy, Precision, and Efficiency in Sparse Grids

I gave a talk on 06 February 2009 to the Computational Mathematics Seminar of the Mathematics Department at Auburn University. The talk was titled

Covering Pascal's Triangle on a Budget:
Accuracy, Precision and Efficiency in Sparse Grids

A plain text abstract of the talk is available as auburn_2009.txt.

A PDF version is available as ../../presentations/auburn_2009.pdf.

Some information on the sparse grid research I participated in is included in these references:

  1. John Burkardt, Max Gunzburger, Clayton Webster,
    Reduced Order Modeling of Some Nonlinear Stochastic Partial Differential Equations,
    International Journal of Numerical Analysis and Modeling,
    Volume 4, Number 3-4, 2007, pages 368-391,
    bgw_ijnam_2007.pdf.
  2. Clayton Webster,
    Sparse Grid Stochastic Collocation Techniques for the Numerical Solution of Partial Differential Equations with Random Input Data,
    PhD Dissertation,
    Mathematics Department,
    Florida State University, May 2007,
    webster_thesis.pdf.

The following files constitute the LaTeX file used to create the slides:

Last revised on 23 January 2009.