Abstract
In this paper we consider a proper generalized decomposition method to solve the steady incompressible Navier-Stokes equations with random Reynolds number and forcing term. The aim of such a technique is to compute a low-cost reduced basis approximation of the full stochastic Galerkin solution of the problem at hand. A particular algorithm, inspired by the Arnoldi method for solving eigenproblems, is proposed for an efficient greedy construction of a deterministic reduced basis approximation. This algorithm decouples the computation of the deterministic and stochastic components of the solution, thus allowing reuse of preexisting deterministic Navier-Stokes solvers. It has the remarkable property of only requiring the solution of m uncoupled deterministic problems for the construction of an m-dimensional reduced basis rather than M coupled problems of the full stochastic Galerkin approximation space, with m l M (up to one order of magnitudefor the problem at hand in this work).
| Original language | English |
|---|---|
| Pages (from-to) | A1089-A1117 |
| Journal | SIAM Journal on Scientific Computing |
| Volume | 36 |
| Issue number | 3 |
| DOIs | |
| Publication status | Published - 1 Jan 2014 |
| Externally published | Yes |
Keywords
- Galerkin method
- Model reduction
- Reduced basis
- Stochastic navier-stokes equations
- Uncertainty quantification
Fingerprint
Dive into the research topics of 'Model reduction based on proper generalized decomposition for the stochastic steady incompressible navier-stokes equations'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver