Solution algorithms for stochastic galerkin discretizations of differential equations with random data

4Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This chapter discusses algorithms for solving systems of algebraic equations arising from stochastic Galerkin discretization of partial differential equations with random data, using the stochastic diffusion equation as a model problem. For problems in which uncertain coefficients in the differential operator are linear functions of random parameters, a variety of efficient algorithms of multigrid and multilevel type are presented, and, where possible, analytic bounds on convergence of these methods are derived. Some limitations of these approaches for problems that have nonlinear dependence on parameters are outlined, but for one example of such a problem, the diffusion equation with a diffusion coefficient that has exponential structure, a strategy is described for which the reformulated problem is also amenable to efficient solution by multigrid methods.

Cite

CITATION STYLE

APA

Elman, H. (2017). Solution algorithms for stochastic galerkin discretizations of differential equations with random data. In Handbook of Uncertainty Quantification (pp. 601–616). Springer International Publishing. https://doi.org/10.1007/978-3-319-12385-1_20

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