arXiv subjects

Ulrich Langer

Publications and source records attributed to Ulrich Langer.

At least 37 records · Page 2Linked to original sources

arXiv2020

Unstructured space-time finite element methods for optimal control of parabolic equations

This work presents and analyzes space-time finite element methods on fully unstructured simplicial space-time meshes for the numerical solution of parabolic optimal control problems. Using Babuška's theorem, we show well-posedness of the first-order optimality systems for a typical model problem with linear state equations, but without control constraints. This is done for both continuous and discrete levels. Based on these results, we derive discretization error estimates. Then we consider a semilinear parabolic optimal control problem arising from the Schlögl model. The associated nonlinear optimality system is solved by Newton's method, where a linear system, that is similar to the first-order optimality systems considered for the linear model problems, has to be solved at each Newton step. We present various numerical experiments including results for adaptive space-time finite element discretizations based on residual-type error indicators. In the last two examples, we also consider semilinear parabolic optimal control problems with box constraints imposed on the control.

math.NA↗

arXiv2020

Unstructured Space-Time Finite Element Methods for Optimal Sparse Control of Parabolic Equations

We consider a space-time finite element method on fully unstructured simplicial meshes for optimal sparse control of semilinear parabolic equations. The objective is a combination of a standard quadratic tracking-type functional including a Tikhonov regularization term and of the $L^1$-norm of the control that accounts for its spatio-temporal sparsity. We use a space-time Petrov-Galerkin finite element discretization for the first-order necessary optimality system of the associated discrete optimal sparse control problem. The discretization is based on a variational formulation that employs piecewise linear finite elements simultaneously in space and time. Finally, the discrete nonlinear optimality system that consists of coupled forward-backward state and adjoint state equations is solved by a semismooth Newton method.

math.NA↗

arXiv2020

Adaptive space-time finite element methods for non-autonomous parabolic problems with distributional sources

We consider locally stabilized, conforming finite element schemes on completely unstructured simplicial space-time meshes for the numerical solution of parabolic initial-boundary value problems with variable, possibly discontinuous in space and time, coefficients. Distributional sources are also admitted. Discontinuous coefficients, non-smooth boundaries, changing boundary conditions, non-smooth or incompatible initial conditions, and non-smooth right-hand sides can lead to non-smooth solutions. We present new a priori and a posteriori error estimates for low-regularity solutions. In order to avoid reduced convergence rates appearing in the case of uniform mesh refinement, we also consider adaptive refinement procedures based on residual a posteriori error indicators and functional a posteriori error estimators. The huge system of space-time finite element equations is then solved by means of GMRES preconditioned by space-time algebraic multigrid. In particular, in the 4d space-time case that is 3d in space, simultaneous space-time parallelization can considerably reduce the computational time. We present and discuss numerical results for several examples possessing different regularity features.

math.NA↗

arXiv2020

Reliability and efficiency of DWR-type a posteriori error estimates with smart sensitivity weight recovering

We derive efficient and reliable goal-oriented error estimations, and devise adaptive mesh procedures for the finite element method that are based on the localization of a posteriori estimates. In our previous work [SIAM J. Sci. Comput., 42(1), A371--A394, 2020], we showed efficiency and reliability for error estimators based on enriched finite element spaces. However, the solution of problems on a enriched finite element space is expensive. In the literature, it is well known that one can use some higher-order interpolation to overcome this bottleneck. Using a saturation assumption, we extend the proofs of efficiency and reliability to such higher-order interpolations. The results can be used to create a new family of algorithms, where one of them is tested on three numerical examples (Poisson problem, p-Laplace equation, Navier-Stokes benschmark), and is compared to our previous algorithm.

math.NA↗

arXiv2019

Multigoal-oriented optimal control problems with nonlinear PDE constraints

In this work, we consider an optimal control problem subject to a nonlinear PDE constraint and apply it to the regularized $p$-Laplace equation. To this end, a reduced unconstrained optimization problem in terms of the control variable is formulated. Based on the reduced approach, we then derive an a posteriori error representation and mesh adaptivity for multiple quantities of interest. All quantities are combined to one, and then the dual-weighted residual (DWR) method is applied to this combined functional. Furthermore, the estimator allows for balancing the discretization error and the nonlinear iteration error. These developments allow us to formulate an adaptive solution strategy, which is finally substantiated via several numerical examples.

math.NA↗

arXiv2019

Space-Time Finite Element Methods for Parabolic Evolution Problems with Non-smooth Solutions

We propose consistent locally stabilized, conforming finite element schemes on completely unstructured simplicial space-time meshes for the numerical solution of non-autonomous parabolic evolution problems under the assumption of maximal parabolic regularity. We present new a priori estimates for low-regularity solutions. In order to avoid reduced convergence rates appearing in the case of uniform mesh refinement, we also consider adaptive refinement procedures based on residual a posteriori error indicators. The huge system of space-time finite element equations is then solved by means of GMRES preconditioned by algebraic multigrid.

math.NA↗

arXiv2019

Matrix-free multigrid solvers for phase-field fracture problems

In this work, we present a framework for the matrix-free solution to a monolithic quasi-static phase-field fracture model with geometric multigrid methods. Using a standard matrix based approach within the Finite Element Method requires lots of memory, which eventually becomes a serious bottleneck. A matrix-free approach overcomes this problems and greatly reduces the amount of required memory, allowing to solve larger problems on available hardware. One key challenge is concerned with the crack irreversibility for which a primal-dual active set method is employed. Here, the Active-Set values of fine meshes must be available on coarser levels of the multigrid algorithm. The developed multigrid method provides a preconditioner for a generalized minimal residual solver. This method is used for solving the linear equations inside Newton's method for treating the overall nonlinear-monolithic discrete displacement/phase-field formulation. Several numerical examples demonstrate the performance and robustness of our solution technology. Mesh refinement studies, variations in the phase-field regularization parameter, iterations numbers of the linear and nonlinear solvers, and some parallel performances are conducted to substantiate the efficiency of the proposed solver for single fractures, multiple pressurized fractures, and a L-shaped panel test in three dimensions.

math.NA↗

arXiv2018

Two-side a posteriori error estimates for the DWR method

In this work, we derive two-sided a posteriori error estimates for the dual-weighted residual (DWR) method. We consider both single and multiple goal functionals. Using a saturation assumption, we derive lower bounds yielding the efficiency of the error estimator. These results hold true for both nonlinear partial differential equations and nonlinear functionals of interest. Furthermore, the DWR method employed in this work accounts for balancing the discretization error with the nonlinear iteration error. We also perform careful studies of the remainder term that is usually neglected. Based on these theoretical investigations, several algorithms are designed. Our theoretical findings and algorithmic developments are substantiated with some numerical tests.

math.NA↗

arXiv2018

BDDC preconditioners for a space-time finite element discretization of parabolic problems

This paper deals with balanced domain decomposition by constraints (BDDC) method for solving large-scale linear systems of algebraic equations arising from the space-time finite element discretization of parabolic initial-boundary value problems. The time is considered as just another spatial coordinate, and the finite elements are continuous and piecewise linear on unstructured simplicial space-time meshes. We consider BDDC preconditioned GMRES methods for solving the space-time finite element Schur complement equations on the interface. Numerical studies demonstrate robustness of the preconditioners to some extent.

math.NA↗

arXiv2018

Isogeometric Simulation and Shape Optimization with Applications to Electrical Machines

Future e-mobility calls for efficient electrical machines. For different areas of operation, these machines have to satisfy certain desired properties that often depend on their design. Here we investigate the use of multipatch Isogeometric Analysis (IgA) for the simulation and shape optimization of the electrical machines. In order to get fast simulation and optimization results, we use non-overlapping domain decomposition (DD) methods to solve the large systems of algebraic equations arising from the IgA discretization of underlying partial differential equations. The DD is naturally related to the multipatch representation of the computational domain, and provides the framework for the parallelization of the DD solvers.

math.NA↗

arXiv2018

Adaptive space-time isogeometric analysis for parabolic evolution problems

The paper is concerned with locally stabilized space-time IgA approximations to initial boundary value problems of the parabolic type. Originally, similar schemes (but weighted with a global mesh parameter) was presented and studied by U. Langer, M. Neumueller, and S. Moore (2016). The current work devises a localised version of this scheme and establishes coercivity, boundedness, and consistency of the corresponding bilinear form. Using these fundamental properties together with the corresponding approximation error estimates for B-splines, we show that the space-time IgA solutions generated by the new scheme satisfy asymptotically optimal a priori discretization error estimates. The adaptive mesh refinement algorithm proposed in the paper is based on a posteriori error estimates of the functional type that has been rigorously studied in earlier works by S. Repin (2002) and U. Langer, S. Matculevich, and S. Repin (2017). Numerical results presented in the second part of the paper confirm the improved convergence of global approximation errors. Moreover, these results also confirm the local efficiency of the error indicators produced by the error majorants.

math.NA↗

arXiv2018

Robust Preconditioning for Space-Time Isogeometric Analysis of Parabolic Evolution Problems

We propose and investigate new robust preconditioners for space-time Isogeometric Analysis of parabolic evolution problems. These preconditioners are based on a time parallel multigrid method. We consider a decomposition of the space-time cylinder into time-slabs which are coupled via a discontinuous Galerkin technique. The time-slabs provide the structure for the time-parallel multigrid solver. The most important part of the multigrid method is the smoother. We utilize the special structure of the involved operator to decouple its application into several spatial problems by means of generalized eigenvalue or Schur decompositions. Some of these problems have a symmetric saddle point structure, for which we present robust preconditions. Finally, we present numerical experiments confirming the robustness of our space-time IgA solver.

math.NA↗

arXiv2018

Guaranteed error control bounds for the stabilised space-time IgA approximations to parabolic problems

The paper is concerned with space-time IgA approximations of parabolic initial-boundary value problems. We deduce guaranteed and fully computable error bounds adapted to special features of IgA approximations and investigate their applicability. The derivation method is based on the analysis of respective integral identities and purely functional arguments. Therefore, the estimates do not contain mesh-dependent constants and are valid for any approximation from the admissible (energy) class. In particular, they provide computable error bounds for norms associated with stabilised space-time IgA approximations as well as imply efficient error indicators enhancing the performance of fully adaptive solvers. The last section of the paper contains a series of numerical examples where approximate solutions are recovered by IgA techniques. The mesh refinement algorithm is governed by a local error indicator generated by the error majorant. Numerical results discussed in the last section illustrate both reliability, as well as the quantitative efficiency of the error estimates presented.

math.NA↗

arXiv2017

Inexact Dual-Primal Isogeometric Tearing and Interconnecting Methods

In this paper, we investigate inexact variants of dual-primal isogeometric tearing and interconnecting methods for solving large-scale systems of linear equations arising from Galerkin isogeometric discretizations of elliptic boundary value problems. The considered methods are extensions of standard finite element tearing and interconnecting methods to isogeometric analysis. The algorithms are implemented by means of energy minimizing primal subspaces. We discuss the replacement of local sparse direct solvers by iterative methods, particularly, multigrid solvers. We investigate the incorporation of these iterative solvers into different formulations of the algorithm. Finally, we present numerical examples comparing the performance of these inexact versions.

math.NA↗

arXiv2017

A posteriori error estimates for space-time IgA approximations to parabolic initial boundary value problems

This work is concerned with a posteriori error estimates of the functional type for approximations constructed by space-time IgA scheme presented in paper by Langer, Neumueller, and Moore (2016). We consider approxima- tions in the corresponding IgA spaces based on elliptic and bounded bilinear form (associated with the spatial part). It is proved that the approximations satisfy classic a priori error estimates. Also, we deduce a posteriori error estimates for a stabilized weak formulation of the considered parabolic initial boundary value problem (I-BVP). They are derived by a general functional method and do not contain mesh dependent constants. The estimates are valid for a wide class of approximations. In particular, they imply estimates for the discrete norm of IgA approximations. Moreover, we introduce different forms of a posteriori error estimates (error majorants) and establish equivalence of majorants and energy error norm. This property justifies efficiency and reliability of a posteriori error estimates. Another important property of the estimates is their flexibility with respect to a certain amount of free parameters. Using these parameters we can obtain estimates for different error norms and minimize the respective majorant in order to find the best possible bound of the error.

math.NA↗

arXiv2016

Discontinuous Galerkin Isogeometric Analysis on Non-matching Segmentation: Error Estimates and Efficient Solvers

The Isogeometric Analysis (IgA) of boundary value problems in complex domains often requires a decomposition of the computational domain into patches such that each of which can be parametrized by the so-called geometrical mapping. In this paper, we develop discontinuous Galerkin (dG) IgA techniques for solving elliptic diffusion problems on decompositions that can include non-matching parametrizations of the interfaces, i.e., the interfaces of the adjacent patches may be not identical. The lack of the exact parametrization of the patches leads to the creation of gap and overlapping regions between the patches. This does not allow the immediate use of the classical numerical fluxes that are known in the literature. The unknown normal fluxes of the solution on the non-matching interfaces are approximated by Taylor expansions using the values of the solution computed on the boundary of the patches These approximations are used in order to build up the numerical fluxes of the final dG IgA scheme and to couple the local patch-wise discrete problems. The resulting linear systems are solved by using efficient domainecomposition methods based on the tearing and interconnecting technology. We present numerical results of a series of test problems that validate the theoretical estimates presented.

math.NA↗

arXiv2016

A Local Mesh Modification Strategy for Interface Problems with Application to Shape and Topology Optimization

We present and analyze a new finite element method for solving interface problems on a triangular grid. The method locally modifies a given triangulation such that the interfaces are accurately resolved and the maximal angle condition holds. Therefore, optimal order of convergence can be shown. Moreover, an appropriate scaling of the basis functions yields an optimal condition number of the stiffness matrix. The method is applied to an optimal design problem for an electric motor where the interface between different materials is evolving in the course of the optimization procedure.

math.NA↗

arXiv2016

Dual-Primal Isogeometric Tearing and Interconnecting solvers for multipatch dG-IgA equations

In this paper we consider a new version of the dual-primal isogeometric tearing and interconnecting (IETI-DP) method for solving large-scale linear systems of algebraic equations arising from discontinuous Galerkin (dG) isogeometric analysis of diffusion problems on multipatch domains with non-matching meshes. The dG formulation is used to couple the local problems across patch interfaces. The purpose of this paper is to present this new method and provide numerical examples indicating a polylogarithmic condition number bound for the preconditioned system and showing an incredible robustness with respect to large jumps in the diffusion coefficient across the interfaces.

math.NA↗