SearcharxivSearch

arXiv subjects

Christopher Müller

Publications and source records attributed to Christopher Müller.

3 recordsLinked to original sources

Stochastic Galerkin reduced basis methods for parametrized linear elliptic partial differential equations

We consider the estimation of parameter-dependent statistics of functional outputs of elliptic boundary value problems (BVPs) with parametrized random and deterministic inputs. For a given value of the deterministic paremeter, a stochastic Galerkin finite element (SGFE) method can estimate the corresponding expectation and variance of a linear output at the cost of a single solution of a large block-structured linear system of equations. We propose a stochastic Galerkin reduced basis (SGRB) method as a means to lower the computational burden when statistical outputs are required for a large number of deterministic parameter queries. Our working assumption is that we have access to the computational resources necessary to set up such a reduced order model for a spatial-stochastic weak formulation of the parameter-dependent BVP. To derive an SGRB model, we project the spatial-stochastic weak solution of a parameter-dependent SGFE model onto a POD reduced basis generated from snapshots of SGFE solutions at representative values of the parameter. We propose residual-corrected estimates of the parameter-dependent expectation and variance of linear functional outputs and provide respective computable error bounds.~We test the SGRB method numerically for a convection-diffusion-reaction problem, choosing the convective velocity as a deterministic parameter and the parametrized reactivity field as a random input. Compared to a standard reduced basis model embedded in a Monte Carlo sampling procedure, the SGRB model requires a similar number of reduced basis functions to meet a given tolerance requirement. However, only a single run of the SGRB model suffices to estimate a statistical output for a new deterministic parameter value, while the standard reduced basis model must be solved for each Monte Carlo sample.

math.NA

A Bramble-Pasciak conjugate gradient method for discrete Stokes equations with random viscosity

We study the iterative solution of linear systems of equations arising from stochastic Galerkin finite element discretizations of saddle point problems. We focus on the Stokes model with random data parametrized by uniformly distributed random variables and discuss well-posedness of the variational formulations. We introduce a Bramble-Pasciak conjugate gradient method as a linear solver. It builds on a non-standard inner product associated with a block triangular preconditioner. The block triangular structure enables more sophisticated preconditioners than the block diagonal structure usually applied in MINRES methods. We show how the existence requirements of a conjugate gradient method can be met in our setting. We analyze the performance of the solvers depending on relevant physical and numerical parameters by means of eigenvalue estimates. For this purpose, we derive bounds for the eigenvalues of the relevant preconditioned sub-matrices. We illustrate our findings using the flow in a driven cavity as a numerical test case, where the viscosity is given by a truncated Karhunen-Lo\`eve expansion of a random field. In this example, a Bramble-Pasciak conjugate gradient method with block triangular preconditioner outperforms a MINRES method with block diagonal preconditioner in terms of iteration numbers.

math.NA

A Bramble-Pasciak conjugate gradient method for discrete Stokes problems with lognormal random viscosity

We study linear systems of equations arising from a stochastic Galerkin finite element discretization of saddle point problems with random data and its iterative solution. We consider the Stokes flow model with random viscosity described by the exponential of a correlated random process and shortly discuss the discretization framework and the representation of the emerging matrix equation. Due to the high dimensionality and the coupling of the associated symmetric, indefinite, linear system, we resort to iterative solvers and problem-specific preconditioners. As a standard iterative solver for this problem class, we consider the block diagonal preconditioned MINRES method and further introduce the Bramble-Pasciak conjugate gradient method as a promising alternative. This special conjugate gradient method is formulated in a non-standard inner product with a block triangular preconditioner. From a structural point of view, such a block triangular preconditioner enables a better approximation of the original problem than the block diagonal one. We derive eigenvalue estimates to assess the convergence behavior of the two solvers with respect to relevant physical and numerical parameters and verify our findings by the help of a numerical test case. We model Stokes flow in a cavity driven by a moving lid and describe the viscosity by the exponential of a truncated Karhunen-Loeve expansion. Regarding iteration counts, the Bramble-Pasciak conjugate gradient method with block triangular preconditioner is superior to the MINRES method with block diagonal preconditioner in the considered example.

math.NA