Mini-Workshop: Adaptive Methods for Control Problems Constrained by Time-Dependent PDEs

Optimization problems constrained by time-dependent PDEs (Partial Differential Equations) are challenging from a computational point of view: even in the simplest case, one needs to solve a system of PDEs coupled globally in time and space for the unknown solutions (the state, the costate and the control of the system). Typical and practically relevant examples are the control of nonlinear heat equations as they appear in laser hardening or the thermic control of flow problems (Boussinesq equations). Specifically for PDEs with a long time horizon, conventional time-stepping methods require an enormous storage of the respective other variables. In contrast, adaptive methods aim at distributing the available degrees of freedom in an a-posteriori-fashion to capture singularities and are, therefore, most promising

Mini-Workshop: Efficient and Robust Approximation of the Helmholtz Equation

The accurate and efficient treatment of wave propogation phenomena is still a challenging problem. A prototypical equation is the Helmholtz equation at high wavenumbers. For this equation, Babuška & Sauter showed in 2000 in their seminal SIAM Review paper that standard discretizations must fail in the sense that the ratio of true error and best approximation error has to grow with the frequency. This has spurred the development of alternative, non-standard discretization techniques. This workshop focused on evaluating and comparing these different approaches also with a view to their applicability to more general wave propagation problems

A New Domain Decomposition Method for the Compressible Euler Equations

In this work we design a new domain decomposition method for the Euler equations in 2 dimensions. The basis is the equivalence via the Smith factorization with a third order scalar equation to whom we can apply an algorithm inspired from the Robin-Robin preconditioner for the convection-diffusion equation. Afterwards we translate it into an algorithm for the initial system and prove that at the continuous level and for a decomposition into 2 sub-domains, it converges in 2 iterations. This property cannot be preserved strictly at discrete level and for arbitrary domain decompositions but we still have numerical results which confirm a very good stability with respect to the various parameters of the problem (mesh size, Mach number, ....).Comment: Submitte

A numerical algorithm based on probing to find optimized transmission conditions

Optimized Schwarz Methods (OSMs) are based on optimized transmission conditions along the interfaces between the subdomains. Optimized transmission conditions are derived at the theoretical level, using techniques developed in the last decades. The hypothesis behind these analyses are quite strong, so that the applicability of OSMs is still limited. In this manuscript, we present a numerical algorithm to obtain optimized transmission conditions for any given problem at hand. This algorithm requires few subdomain solves to be performed in an offline phase. This additional cost is usually negligible due to the resulting faster convergence, even in a single-query context.Comment: 8 pages, 9 figure

hp-adaptive discontinuous Galerkin solver for elliptic equations in numerical relativity

A considerable amount of attention has been given to discontinuous Galerkin methods for hyperbolic problems in numerical relativity, showing potential advantages of the methods in dealing with hydrodynamical shocks and other discontinuities. This paper investigates discontinuous Galerkin methods for the solution of elliptic problems in numerical relativity. We present a novel hp-adaptive numerical scheme for curvilinear and non-conforming meshes. It uses a multigrid preconditioner with a Chebyshev or Schwarz smoother to create a very scalable discontinuous Galerkin code on generic domains. The code employs compactification to move the outer boundary near spatial infinity. We explore the properties of the code on some test problems, including one mimicking Neutron stars with phase transitions. We also apply it to construct initial data for two or three black holes

Nonlinear Preconditioning: How to use a Nonlinear Schwarz Method to Precondition Newton's Method

For linear problems, domain decomposition methods can be used directly as iterative solvers, but also as preconditioners for Krylov methods. In practice, Krylov acceleration is almost always used, since the Krylov method finds a much better residual polynomial than the stationary iteration, and thus converges much faster. We show in this paper that also for non-linear problems, domain decomposition methods can either be used directly as iterative solvers, or one can use them as preconditioners for Newton's method. For the concrete case of the parallel Schwarz method, we show that we obtain a preconditioner we call RASPEN (Restricted Additive Schwarz Preconditioned Exact Newton) which is similar to ASPIN (Additive Schwarz Preconditioned Inexact Newton), but with all components directly defined by the iterative method. This has the advantage that RASPEN already converges when used as an iterative solver, in contrast to ASPIN, and we thus get a substantially better preconditioner for Newton's method. The iterative construction also allows us to naturally define a coarse correction using the multigrid full approximation scheme, which leads to a convergent two level non-linear iterative domain decomposition method and a two level RASPEN non-linear preconditioner. We illustrate our findings with numerical results on the Forchheimer equation and a non-linear diffusion problem

Space-Time Domain Decomposition Methods for Diffusion Problems in Mixed Formulations

This paper is concerned with global-in-time, nonoverlapping domain decomposition methods for the mixed formulation of the diffusion problem. Two approaches are considered: one uses the time-dependent Steklov-Poincar\'e operator and the other uses Optimized Schwarz Waveform Relaxation (OSWR) based on Robin transmission conditions. For each method, a mixed formulation of an interface problem on the space-time interfaces between subdomains is derived, and different time grids are employed to adapt to different time scales in the subdomains. Demonstrations of the well-posedness of the subdomain problems involved in each method and a convergence proof of the OSWR algorithm are given for the mixed formulation. Numerical results for 2D problems with strong heterogeneities are presented to illustrate the performance of the two methods