Lineare Inverse Probleme See

Quasi-best approximation in optimization with PDE constraints See

We consider finite element solutions to quadratic optimization problems, where the state depends on the control via a well-posed linear partial differential equation. Exploiting the structure of a suitably reduced optimality system, we prove that the combined error in the state and adjoint state of the variational discretization is bounded by the best approximation error in the underlying discrete spaces. The constant in this bound depends on the inverse square-root of the Tikhonov regulariza...

Regularization for optimal control problems associated to nonlinear evolution equations See

Quadratically regularized optimal transport See

We investigate the problem of optimal transport in the so-called Kantorovich form, i.e. given two Radon measures on two compact sets, we seek an optimal transport plan which is another Radon measure on the product of the sets that has these two measures as marginals and minimizes a certain cost function. We consider quadratic regularization of the problem, which forces the optimal transport plan to be a square integrable function rather than a Radon measure. We derive the dual problem and sho...

Matrix-free subcell residual distribution for Bernstein finite elements: Low-order schemes and FCT See

In this work, we introduce a new residual distribution (RD) framework for the design of matrix-free bound-preserving finite element schemes. As a starting point, we consider continuous and discontinuous Galerkin discretizations of the linear advection equation. To construct the corresponding local extremum diminishing (LED) approximation, we perform mass lumping and redistribute the element residuals in a manner which guarantees the LED property. The hierarchical correction procedure for high...

Finite Element Discretization of Local Minimization Schemes for Rate-Independent Evolutions See

This paper is concerned with a space-time discretization of a rate-independent evolution governed by a non-smooth dissipation and a non-convex energy functional. For the time discretization, we apply the local minimization scheme introduced in [EM06], which is known to resolve time discontinuities, which may show up due to the non-convex energy. The spatial discretization is performed by classical linear finite elements. We show that accumulation points of the sequence of discrete solutions f...

Oscillation in a posteriori error estimation See

In a posteriori error analysis, the relationship between error and estimator is usually spoiled by so-called oscillation terms, which cannot be bounded by the error. In order to remedy, we devise a new approach where the oscillation has the following two properties. First, it is dominated by the error, irrespective of mesh fineness and the regularity of data and the exact solution. Second, it captures in terms of data the part of the residual that, in general, cannot be quantified with finite...

Goal oriented a posteriori error estimators for problems with modified discrete formulations based on the dual weighted residual method See

The article at hand focuses on finite element discretizations, where the continuous and the discrete formulations differ. We introduce a general approach based on the dual weighted residual method for estimating on the one hand the discretization error in a user specified quantity of interest and on the other hand the discrete model error induced by using different discrete techniques. Here, the usual error identities are obtained plus some additional terms. Furthermore, the numerical approxi...

Random walk methods for Monte Carlo simulations of Brownian diffusion on a sphere See

This paper is focused on efficient Monte Carlo simulations of Brownian diffusion effects in particle-based numerical methods for solving transport equations on a sphere (or a circle). Using the heat equation as a model problem, random walks are designed to emulate the action of the Laplace-Beltrami operator without evolving or reconstructing the probability density function. The intensity of perturbations is fitted to the value of the rotary diffusion coefficient in the deterministic mo...

Quasi-optimal and pressure robust discretizations of the Stokes equations by new augmented Lagrangian Formulations See

We approximate the solution of the stationary Stokes equations with various conforming and nonconforming inf-sup stable pairs of finite element spaces on simplicial meshes. Based on each pair, we design a discretization that is quasi-optimal and pressure robust, in the sense that the velocity H^1-error is proportional to the best H^1-error to the analytical velocity. This shows that such a property can be achieved without using conforming and divergence-free pairs. We bound also the pressure ...

Convergence of adaptive C0-interior penalty Galerkin method for the biharmonic problem See

We develop a basic convergence analysis for an adaptive C0IPG method for the Biharmonic problem which provides convergence without rates for all practically relevant marking strategies and all penalty parameters assuring coercivity of the method. The analysis hinges on embedding properties of (broken) Sobolev and BV spaces, and the construction of a suitable limit space. In contrast to the convergence result of adaptive discontinuous Galerkin methods for elliptic PDEs, by Kreuzer and Georgoul...

Efficient and robust monolithic finite element multilevel Krylov subspace solvers for the solution of stationary incompressible Navier-Stokes equations See

Multigrid methods belong to the best-known methods for solving linear systems arising from the discretization of elliptic partial differential equations. The main attraction of multigrid methods is that they have an asymptotically meshindependent convergence behavior. Multigrid with Vanka (or local multilevel pressure Schur complement method) as smoother have been frequently used for the construction of very effcient coupled monolithic solvers for the solution of the stationary incompre...

A quasi-optimal Crouzeix-Raviart discretization of the Stokes equations See

Algebraic limiting techniques and hp-adaptivity for continuous finite element discretizations See

Bulk-robust assignment problems: hardness, approximability and algorithms See

This thesis studies robust assignment problems with focus on computational complexity. Assignment problems are well-studied combinatorial optimization problems with numerous practical applications, for instance in production planning. Classical approaches to optimization expect the input data for a problem to be given precisely. In contrast, real-life optimization problems are modeled using forecasts resulting in uncertain problem parameters. This fact can be taken into account using the f...

A partition of unity approach to adaptivity and limiting in continuous finite element methods See

The partition of unity finite element method (PUFEM) proposed in this paper makes it possible to blend space and time approximations of different orders in a continuous manner. The lack of abrupt changes in the local mesh size h and polynomial degree p simplifies implementation and eliminates the need for using sophisticated hierarchical data structures. In contrast to traditional hp-adaptivity for finite elements, the proposed approach preserves discrete conservation properties and the conti...

Gradient-based limiting and stabilization of continuous Galerkin methods See

In this paper, we stabilize and limit continuous Galerkin discretizations of a linear transport equation using an algebraic approach to derivation of artificial diffusion operators. Building on recent advances in the analysis and design of edge-based algebraic flux correction schemes for singularly perturbed convection-diffusion problems, we derive algebraic stabilization operators that generate nonlinear high-order stabilization in smooth regions and enforce discrete maximum principles every...

Sensitivity analysis of elliptic variational inequalities of the first and the second kind See

This thesis is concerned with the differential sensitivity analysis of elliptic variational inequalities of the first and the second kind in finite and infinite dimensions. We develop a general theory that provides a sharp criterion for the Hadamard directional differentiability of the solution operator to an elliptic variational inequality and introduce several tools that facilitate the sensitivity analysis in practical applications. Our analysis is accompanied by examples from mechanics ...

Frame-invariant directional vector limiters for discontinuous Galerkin methods See

Second and higher order numerical approximations of conservation laws for vector fields call for the use of limiting techniques based on generalized monotonicity criteria. In this paper, we introduce a family of directional vertexbased slope limiters for tensor-valued gradients of formally second-order accurate piecewise-linear discontinuous Galerkin (DG) discretizations. The proposed methodology enforces local maximum principles for scalar products corresponding to projections of a vector fi...