A gradient-enhanced sparse grid algorithm for uncertainty quantification

4Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

Abstract

Adjoint-based gradient information has been successfully incorporated to create surrogate models of the output of expensive computer codes. Exploitation of these surrogates offers the possibility of uncertainty quantification, optimization and parameter estimation at reduced computational cost. Presently, when we look for a surrogate method to include gradient information, the most common choice is gradient-enhanced Kriging (GEK). As a competitor, we develop a novel method: gradient-enhanced sparse grid interpolation. Results for two test functions, the Rosenbrock function and a test function based on the drag of a transonic airfoil with random shape deformations, show that the gradient-enhanced sparse grid interpolation is a reliable surrogate that can incorporate the gradient information efficiently for high-dimensional problems.

Cite

CITATION STYLE

APA

de Baar, J. H. S., & Harding, B. (2015). A gradient-enhanced sparse grid algorithm for uncertainty quantification. International Journal for Uncertainty Quantification, 5(5), 453–468. https://doi.org/10.1615/Int.J.UncertaintyQuantification.2015014394

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free