Change search
ReferencesLink to record
Permanent link

Direct link
An anisotropic sparse grid stochastic collocation method for partial differential equations with random input data
KTH, School of Computer Science and Communication (CSC), Numerical Analysis and Computer Science, NADA.
2008 (English)In: SIAM Journal on Numerical Analysis, ISSN 0036-1429, E-ISSN 1095-7170, Vol. 46, no 5, 2411-2442 p.Article in journal (Refereed) Published
Abstract [en]

This work proposes and analyzes an anisotropic sparse grid stochastic collocation method for solving partial differential equations with random coefficients and forcing terms ( input data of the model). The method consists of a Galerkin approximation in the space variables and a collocation, in probability space, on sparse tensor product grids utilizing either Clenshaw-Curtis or Gaussian knots. Even in the presence of nonlinearities, the collocation approach leads to the solution of uncoupled deterministic problems, just as in the Monte Carlo method. This work includes a priori and a posteriori procedures to adapt the anisotropy of the sparse grids to each given problem. These procedures seem to be very effective for the problems under study. The proposed method combines the advantages of isotropic sparse collocation with those of anisotropic full tensor product collocation: the first approach is effective for problems depending on random variables which weigh approximately equally in the solution, while the benefits of the latter approach become apparent when solving highly anisotropic problems depending on a relatively small number of random variables, as in the case where input random variables are Karhunen-Loeve truncations of "smooth" random fields. This work also provides a rigorous convergence analysis of the fully discrete problem and demonstrates ( sub) exponential convergence in the asymptotic regime and algebraic convergence in the preasymptotic regime, with respect to the total number of collocation points. It also shows that the anisotropic approximation breaks the curse of dimensionality for a wide set of problems. Numerical examples illustrate the theoretical results and are used to compare this approach with several others, including the standard Monte Carlo. In particular, for moderately large-dimensional problems, the sparse grid approach with a properly chosen anisotropy seems to be very efficient and superior to all examined methods.

Place, publisher, year, edition, pages
2008. Vol. 46, no 5, 2411-2442 p.
Keyword [en]
collocation techniques, PDEs with random data, differential equations, finite elements, uncertainty quantification, anisotropic sparse grids, Smolyak sparse approximation, multivariate polynomial approximation, elliptic problems, finite-elements, uncertainty, coefficients, approximations, propagation, expansions, quadrature, chaos
National Category
Computer and Information Science
URN: urn:nbn:se:kth:diva-17703DOI: 10.1137/070680540ISI: 000257746600009ScopusID: 2-s2.0-52749093759OAI: diva2:335748
QC 20100525Available from: 2010-08-05 Created: 2010-08-05 Last updated: 2012-02-07Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Tempone, Raul
By organisation
Numerical Analysis and Computer Science, NADA
In the same journal
SIAM Journal on Numerical Analysis
Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 20 hits
ReferencesLink to record
Permanent link

Direct link