Title:

Regularity and approximation of a hyperbolicelliptic coupled problem

In this thesis, we investigate the regularity and approximation of a hyperbolicelliptic coupled problem. In particular, we consider the Poisson and the transport equation where both are assigned nonhomogeneous Dirichlet boundary conditions. The coupling of the two problems is executed as follows. The right hand side function of the Poisson equation is the solution ρ of the transport equation whereas the gradient field E = −∇u, with u being solution of the Poisson problem, is the convective field for the transport equation. The analysis is done throughout on a nonconvex, not simply connected domain that is supposed to be homeomorph to an annular domain. In the first part of this thesis, we will focus on the existence and uniqueness of a classical solution to this highly nonlinear problem using the framework of Hölder continuous functions. Herein, we distinguish between a time dependent and time independent formulation. In both cases, we investigate the streamline functions defined by the convective field E. These are used in the time dependent case to derive an operator equation whose fixed point is the streamline function to the gradient of the classical solution u. In the time independent setting, we formulate explicitly the solution operators L for the Poisson and T for the transport equation and show with a fixed point argument the existence and uniqueness of a classical solution (u,ρ). The second part of this thesis deals with the approximation of the coupled problem in Sobolev spaces. First, we show that the nonlinear transport equation can be formulated equivalently as variational inequality and analyse its Galerkin finite element discretization. Due to the nonlinearity of the coupled problem, it is necessary to use iterative solvers. We will introduce the staggered algorithm which is an iterative method solving alternating the Poisson and transport equation until convergence is obtained. Assuming that LοT is a contraction in the Sobolev space H1(Ω), we will investigate the convergence of the discrete staggered algorithm and obtain an error estimate. Subsequently, we present numerical results in two and three dimensions. Beside the staggered algorithm, we will introduce other iterative solvers that are based on linearizing the coupled problem by Newton’s method. We illustrate that all iterative solvers converge satisfactorily to the solution (u, ρ).
