TY - INPR A1 - Giesselmann, Jan A1 - Egger, Herbert T1 - Stability and asymptotic analysis for instationary gas transport via relative energy estimates N2 - We consider the transport of gas in long pipes and pipeline networks for which the dynamics are dominated by friction at the pipe walls. The governing equations can be formulated as an abstract dissipative Hamiltonian system which allows us to derive perturbation bounds by means of relative energy estimates. As particular consequences, we obtain stability with respect to initial conditions and model parameters and quantitative estimates in the high friction limit. Our results are established in detail for the flow in a single pipe and through the energy-based modelling they naturally generalize also to pipe networks. KW - gas transport on networks KW - asymptotic limits KW - hyperbolic balance laws KW - relative energy estimates KW - singular perturbations Y1 - 2020 ER - TY - INPR A1 - Disser, Yann A1 - Klimm, Max A1 - Weckbecker, David T1 - Fractionally Subadditive Maximization under an Incremental Knapsack Constraint N2 - We consider the problem of maximizing a fractionally subadditive function under a knapsack constraint that grows over time. An incremental solution to this problem is given by an order in which to include the elements of the ground set, and the competitive ratio of an incremental solution is defined by the worst ratio over all capacities relative to an optimum solution of the corresponding capacity. We present an algorithm that finds an incremental solution of competitive ratio at most $\max\{3.293\sqrt{M},2M\}$, under the assumption that the values of singleton sets are in the range $[1,M]$, and we give a lower bound of $\max\{2.449,M\}$ on the attainable competitive ratio. In addition, we establish that our framework captures potential-based flows between two vertices, and we give a tight bound of 2 for the incremental maximization of classical flows with unit capacities. Y1 - 2021 ER - TY - JOUR A1 - Pfetsch, Marc E. A1 - Schmitt, Andreas T1 - A Generic Optimization Framework for Resilient Systems N2 - This paper addresses the optimal design of resilient systems, in which components can fail. The system can react to failures and its behavior is described by general mixed integer nonlinear programs, which allows for applications to many (technical) systems. This then leads to a three-level optimization problem. The upper level designs the system minimizing a cost function, the middle level represents worst-case failures of components, i.e., interdicts the system, and the lowest level operates the remaining system. We describe new inequalities that characterize the set of resilient solutions and allow to reformulate the problem. The reformulation can then be solved using a nested branch-and-cut approach. We discuss several improvements, for instance, by taking symmetry into account and strengthening cuts. We demonstrate the effectiveness of our implementation on the optimal design of water networks, robust trusses, and gas networks, in comparison to an approach in which the failure scenarios are directly included into the model. Y1 - 2021 ER - TY - INPR A1 - Domschke, Pia A1 - Hiller, Benjamin A1 - Lang, Jens A1 - Mehrmann, Volker A1 - Morandin, Riccardo A1 - Tischendorf, Caren T1 - Gas Network Modeling: An Overview N2 - With this overview we want to provide a compilation of different models for the description of gas flow in networks in order to facilitate the introduction to the topic. Special attention is paid to the hierarchical structure inherent to the modeling, and the detailed description of individual components such as valves and compressors. Also included are network model classes based on purely algebraic relations, and energy-based port-Hamiltonian models. A short overview of basic numerical methods and concepts for the treatment of hyperbolic balance equations is also given. We do not claim completeness and refer in many places to the existing literature. The idea of a model catalog came to us in the context of the application for the CRC/Transregio 154 ``Mathematical modeling, simulation and optimization using the example of gas networks''. The present English translation is an extension from [P. Domschke, B. Hiller, J. Lang, and C. Tischendorf. Modellierung von Gasnetzwerken: Eine Übersicht. Preprint, TRR 154, 2017]. At this point we would like to thank the DFG for its support. Y1 - 2021 ER - TY - INPR A1 - Grimm, Veronika A1 - Nowak, Daniel A1 - Schewe, Lars A1 - Schmidt, Martin A1 - Schwartz, Alexandra A1 - Zöttl, Gregor T1 - A Tractable Multi-Leader Multi-Follower Peak-Load-Pricing Model with Strategic Interaction N2 - While single-level Nash equilibrium problems are quite well understood nowadays, less is known about multi-leader multi-follower games. However, these have important applications, e.g., in the analysis of electricity and gas markets, where often a limited number of firms interacts on various subsequent markets. In this paper, we consider a special class of two-level multi-leader multi-follower games that can be applied, e.g., to model strategic booking decisions in the European entry-exit gas market. For this nontrivial class of games, we develop a solution algorithm that is able to compute the complete set of Nash equilibria instead of just individual solutions or a bigger set of stationary points. Additionally, we prove that for this class of games, the solution set is finite and provide examples for instances without any Nash equilibria in pure strategies. We apply the algorithm to a case study in which we compute strategic booking and nomination decisions in a model of the European entry-exit gas market system. Finally, we use our algorithm to provide a publicly available test library for the considered class of multi-leader multi-follower games. This library contains problem instances with different economic and mathematical properties so that other researchers in the field can test and benchmark newly developed methods for this challenging class of problems. KW - Game theory KW - Nash-Cournot equilibria KW - Multi-leader multi-follower game KW - Peak-load pricing Y1 - 2020 U6 - https://doi.org/10.1007/s10107-021-01708-0 ER - TY - JOUR A1 - Egger, Herbert A1 - Philippi, Nora T1 - A hybrid discontinuous Galerkin method for transport equations on networks JF - Finite Volumes for Complex Applications IX - Methods, Theoretical Aspects, Examples N2 - We discuss the mathematical modeling and numerical discretization of 5 transport problems on one-dimensional networks. Suitable coupling conditions are derived that guarantee conservation of mass across network junctions and dissipation of a mathematical energy which allows us to prove existence of unique solutions. We then consider the space discretization by a hybrid discontinuous Galerkin method which provides a suitable upwind mechanism to handle the transport prob10 lem and allows to incorporate the coupling conditions in a natural manner. In addition, the method inherits mass conservation and stability of the continuous problem. Order optimal convergence rates are established and illustrated by numerical tests. Y1 - 2020 ER - TY - JOUR A1 - Egger, Herbert A1 - Philippi, Nora T1 - On the transport limit of singularly perturbed convection-diffusion problems on networks N2 - We consider singularly perturbed convection-diffusion equations on one-dimensional networks (metric graphs) as well as the transport problems arising in the vanishing diffusion limit. Suitable coupling condition at inner vertices are derived that guarantee conservation of mass as well as dissipation of a mathematical energy which allows us to prove stability and well-posedness. For single intervals and appropriately specified initial conditions, it is well-known that the solutions of the convection-diffusion problem converge to that of the transport problem with order O(sqrt(eps)) in the L1(L2)- norm with diffusion eps -> 0. In this paper, we prove a corresponding result for problems on one-dimensional networks. The main difficulty in the analysis is that the number and type of coupling conditions changes in the singular limit which gives rise to additional boundary layers at the interior vertices of the network. Since the values of the solution at these network junctions are not known a-priori, the asymptotic analysis requires a delicate choice of boundary layer functions that allows to handle these interior layers. Y1 - 2020 ER - TY - JOUR A1 - Schuster, Michael A1 - Strauch, Elisa A1 - Gugat, Martin A1 - Lang, Jens T1 - Probabilistic Constrained Optimization on Flow Networks N2 - Uncertainty often plays an important role in dynamic flow problems. In this paper, we consider both, a stationary and a dynamic flow model with uncertain boundary data on networks. We introduce two different ways how to compute the probability for random boundary data to be feasible, discussing their advantages and disadvantages. In this context, feasible means, that the flow corresponding to the random boundary data meets some box constraints at the network junctions. The first method is the spheric radial decomposition and the second method is a kernel density estimation. In both settings, we consider certain optimization problems and we compute derivatives of the probabilistic constraint using the kernel density estimator. Moreover, we derive necessary optimality conditions for the stationary and the dynamic case. Throughout the paper, we use numerical examples to illustrate our results by comparing them with a classical Monte Carlo approach to compute the desired probability. KW - Probabilistic Constraints KW - Flow Networks KW - Gas Networks KW - Spheric Radial Decomposition KW - Kernel Density Estimator Y1 - 2020 U6 - https://doi.org/https://doi.org/10.1007/s11081-021-09619-x VL - Optimization and Engineering ER - TY - JOUR A1 - Gugat, Martin A1 - Giesselmann, Jan T1 - Boundary feedback stabilization of a semilinear model for the flow in star-shaped gas networks N2 - The flow of gas through a pipeline network can be modelled by a coupled system of 1-d quasilinear hyperbolic equations. In this system, the influence of certain source terms that model friction effects is essential. Often for the solution of control problems it is convenient to replace the quasilinear model by a simpler semilinear model. In this paper, we analyze the behavior of such a semilinear model on a star-shaped network. The model is derived from the diagonal form of the quasilinear model by replacing the eigenvalues by the sound speed multiplied by 1 or -1 respectively. Thus in the corresponding eigenvalues the influence of the gas velocity is neglected, which is justified in the applications since it is much smaller than the sound speed in the gas. For a star-shaped network of horizontal pipes for suitable coupling conditions we present boundary feedback laws that stabilize the system state exponentially fast to a position of rest for sufficiently small initial data. We show the exponential decay of the $H^1$-norm for arbitrarily long pipes. This is remarkable since in general even for linear systems, for certain source terms the system can become exponentially unstable if the space interval is too long. Our proofs are based upon observability inequalities for the $L^2$ and the $H^1$-norm. Y1 - 2020 U6 - https://doi.org/10.1051/cocv/2021061 CY - ESAIM:COCV ER - TY - INPR A1 - Egger, Herbert A1 - Giesselmann, Jan A1 - Philippi, Nora A1 - Kunkel, Teresa T1 - An asymptotic-preserving discretization scheme for gas transport in pipe networks N2 - We consider the simulation of barotropic flow of gas in long pipes and pipe networks. Based on a Hamiltonian reformulation of the governing system, a fully discrete approximation scheme is proposed using mixed finite elements in space and an implicit Euler method in time. Assuming the existence of a smooth subsonic solution bounded away from vacuum, a full convergence analysis is presented based on relative energy estimates. Particular attention is paid to establishing error bounds that are uniform in the friction parameter. As a consequence, the method and results also cover the parabolic problem arising in the asymptotic large friction limit. The error estimates are derived in detail for a single pipe, but using appropriate coupling conditions and the particular structure of the problem and its discretization, the main results directly generalize to pipe networks. Numerical tests are presented for illustration. Y1 - 2021 ER - TY - JOUR A1 - Joormann, Imke A1 - Pfetsch, Marc E. T1 - Complexity of Minimum Irreducible Infeasible Subsystem Covers for Flow Networks JF - Discrete Applied Mathematics N2 - For an infeasible network flow system with supplies and demands, we consider the problem of finding a minimum irreducible infeasible subsystem cover, i.e., a smallest set of constraints that must be dropped to obtain a feasible system. The special cases of covers which only contain flow balance constraints (node cover) or only flow bounds (arc cover) are investigated as well. We show strong NP-hardness of all three variants. Furthermore, we show that finding minimum arc covers for assignment problems is still hard and as hard to approximate as the set covering problem. However, the minimum arc cover problem is polynomially solvable for networks on cactus graphs. This leads to the development of two different fixed parameter algorithms with respect to the number of elementary cycles connected at arcs and the treewidth, respectively. The latter can be adapted for node covers and the general case. Y1 - 2018 U6 - https://doi.org/10.1016/j.dam.2018.02.025 VL - 244 SP - 124 EP - 142 ER - TY - JOUR A1 - Domschke, Pia A1 - Dua, Aseem A1 - Stolwijk, Jeroen J. A1 - Lang, Jens A1 - Mehrmann, Volker T1 - Adaptive Refinement Strategies for the Simulation of Gas Flow in Networks using a Model Hierarchy N2 - A model hierarchy that is based on the one-dimensional isothermal Euler equations of fluid dynamics is used for the simulation and optimisation of gas flow through a pipeline network. Adaptive refinement strategies have the aim of bringing the simulation error below a prescribed tolerance while keeping the computational costs low. While spatial and temporal stepsize adaptivity is well studied in the literature, model adaptivity is a new field of research. The problem of finding an optimal refinement strategy that combines these three types of adaptivity is a generalisation of the unbounded knapsack problem. A refinement strategy that is currently used in gas flow simulation software is compared to two novel greedy-like strategies. Both a theoretical experiment and a realistic gas flow simulation show that the novel strategies significantly outperform the current refinement strategy with respect to the computational cost incurred. KW - gas supply networks KW - model hierarchy KW - error estimators KW - model adaptivity KW - refinement strategies Y1 - 2017 U6 - https://doi.org/10.1553/etna_vol48s97 VL - Electronic Transactions on Numerical Analysis IS - Vol. 48 SP - 97 EP - 113 ER - TY - JOUR A1 - Hojny, Christopher A1 - Joormann, Imke A1 - Lüthen, Hendrik A1 - Schmidt, Martin T1 - Mixed-Integer Programming Techniques for the Connected Max-k-Cut Problem JF - Mathematical Programming Computation N2 - We consider an extended version of the classical Max-k-Cut problem in which we additionally require that the parts of the graph partition are connected. For this problem we study two alternative mixed-integer linear formulations and review existing as well as develop new branch-and-cut techniques like cuts, branching rules, propagation, primal heuristics, and symmetry breaking. The main focus of this paper is an extensive numerical study in which we analyze the impact of the different techniques for various test sets. It turns out that the techniques from the existing literature are not sufficient to solve an adequate fraction of the test sets. However, our novel techniques significantly outperform the existing ones both in terms of running times and the overall number of instances that can be solved. KW - Max-cut KW - Connectivity KW - Branch-and-cut KW - Mixed-integer programming Y1 - 2018 ER - TY - INPR A1 - Schmidt, Martin A1 - Hiller, Benjamin A1 - Koch, Thorsten A1 - Pfetsch, Marc A1 - Geißler, Björn A1 - Henrion, René A1 - Joormann, Imke A1 - Martin, Alexander A1 - Morsi, Antonio A1 - Römisch, Werner A1 - Schewe, Lars A1 - Schultz, Rüdiger A1 - Steinbach, Marc C. T1 - Capacity Evaluation for Large-Scale Gas Networks N2 - Natural gas is important for the energy turnaround in many countries like in Germany, where it serves as a "bridging energy" towards a fossil-free energy supply in the future. About 20% of the total German energy demand is provided by natural gas, which is transported through a complex pipeline network with a total length of about 30000 km and the efficient use of the given transport infrastructure for natural gas is of political, economic, and societal importance. As a consequence of the liberalization of the European gas market in the last decades, gas trading and transport have been decoupled. This has led to new challenges for gas transport companies, and mathematical optimization is perfectly suited for tackling many of these challenges. However, the underlying mathematical problems are by far too hard to be solved by today's general-purpose software so that novel mathematical theory and algorithms are needed. The industrial research project "ForNe: Research Cooperation Network Optimization" has been initiated and funded by Open Grid Europe in 2009 and brought together experts in mathematical optimization from seven German universities and research institutes, which cover almost the entire range of mathematical optimization: integer and nonlinear optimization as well as optimization under uncertainty. The mathematical research results have been put together in a software package that has been delivered to Open Grid Europe at the end of the project. Moreover, the research is still continuing - e.g., in the Collaborative Research Center/Transregio 154 "Mathematical Modelling, Simulation and Optimization using the Example of Gas Networks" funded by the German Research Foundation. Y1 - 2019 ER - TY - INPR A1 - Klimm, Max A1 - Pfetsch, Marc E. A1 - Raber, Rico A1 - Skutella, Martin T1 - Packing under Convex Quadratic Constraints N2 - We consider a general class of binary packing problems with a convex quadratic knapsack constraint. We prove that these problems are APX-hard to approximate and present constant-factor approximation algorithms based upon three different algorithmic techniques: (1) a rounding technique tailored to a convex relaxation in conjunction with a non-convex relaxation whose approximation ratio equals the golden ratio; (2) a greedy strategy; (3) a randomized rounding method leading to an approximation algorithm for the more general case with multiple convex quadratic constraints. We further show that a combination of the first two strategies can be used to yield a monotone algorithm leading to a strategyproof mechanism for a game-theoretic variant of the problem. Finally, we present a computational study of the empirical approximation of the three algorithms for problem instances arising in the context of real-world gas transport networks. Y1 - 2019 ER - TY - JOUR A1 - Ulbrich, Stefan A1 - Schmitt, Johann Michael A1 - Schäfer Aguilar, Paloma A1 - Moos, Michael T1 - On the numerical discretization of optimal control problems for conservation laws N2 - We analyze the convergence of discretization schemes for the adjoint equation arising in the adjoint-based derivative computation for optimal control problems governed by entropy solutions of conservation laws. The difficulties arise from the fact that the correct adjoint state is the reversible solution of a transport equation with discontinuous coefficient and discontinuous end data. We derive the discrete adjoint scheme for monotone difference schemes in conservation form. It is known that convergence of the discrete adjoint can only be expected if the numerical scheme has viscosity of order O(h^\alpha) with appropriate 0 < \alpha < 1, which leads to quite viscous shock profiles. We show that by a slight modification of the end data of the discrete adjoint scheme convergence to the correct reversible solution can be obtained also for numerical schemes with viscosity of order O(h) and with sharp shock resolution. The theoretical findings are confirmed by numerical results. Y1 - 2019 ER - TY - INPR A1 - Klimm, Max A1 - Pfetsch, Marc A1 - Raber, Rico A1 - Skutella, Martin T1 - On the Robustness of Potential-Based Flow Networks N2 - Potential-based flows provide a simple yet realistic mathematical model of transport in many real-world infrastructure networks such as, e.g., electricity, gas, or water networks, where the flow along each edge is controlled via the (difference of) potentials at its end nodes. A potential-based flow network is robust if the maximal difference of node potentials needed to satisfy a set of demands cannot increase if demands are decreased. This notion of robustness is motivated by infrastructure networks where users first make reservations for certain demands that may be larger than the actual amounts sent later on. Here node potentials correspond to physical quantities such as the pressures or the voltages and must be guaranteed to lie within a fixed range, even if the actual amounts are smaller than the previously reserved demands. Our main results are a precise characterization of such robust networks for the case of point-to-point demands via forbidden node-labeled graph minors, as well as an efficient algorithm for testing robustness. Y1 - 2019 ER - TY - INPR A1 - Habeck, Oliver A1 - Pfetsch, Marc E. T1 - Combinatorial Acyclicity Models for Potential-based Flows N2 - Potential-based flows constitute a basic model to represent physical behavior in networks. Under natural assumptions, the flow in such networks must be acyclic. The goal of this paper is to exploit this property for the solution of corresponding optimization problems. To this end, we introduce several combinatorial models for acyclic flows, based on binary variables for flow directions. We compare these models and introduce a particular model that tries to capture acyclicity together with the supply/demand behavior. We analyze properties of this model, including variable fixing rules. Our computational results show that the usage of the corresponding constraints speeds up solution times by about a factor of 3 on average and a speed-up of a factor of almost 5 for the time to prove optimality. KW - Network Optimization KW - Potential networks KW - Potential-based flows KW - acyclic flows Y1 - 2020 ER - TY - INPR A1 - Egger, Herbert A1 - Kugler, Thomas A1 - Wollner, Winnifried T1 - Numerical optimal control of instationary gas transport with control and state constraints N2 - We consider the optimal control of a nonlinear hyperbolic system of balance laws on a one-dimensional network which arises in the context of gas transport in pipeline systems. State constraints, which are required for the safe operation of the system, are incorporated by a barrier method. We discuss the well-posedness of the governing system of partial differential-algebraic equations and investigate the existence of minimizers. For the numerical solution, we then consider the approximation of the state equation by mixed finite elements in space and a particular linear implicit time integration scheme that can be interpreted as a discontinuous Galerkin approximation. We establish well- posedness of this discretization scheme and prove the existence of minimizers for the corresponding discretized optimal control problem and discuss its numerical solution by a projected Gauß-Newton method. The efficient realization of the Jacobian and Hessian of the quadratic approximations that have to be minimized in every iteration of the Gauß-Newton method can be obtained via the solution of discretized sensitivity and adjoint equations. These are obtained by formal differentiation and transposition of the Galerkin methods employed for the discretization of the state equations. All approximations obtained after discretization can thus be interpreted as functions on the continuous level and, since the functional analytic setting is not changed by the Galerkin discretization, we observe mesh independence of the resulting fully discrete methods. For illustration of our theoretical results and to demonstrate the efficiency of the proposed method, we present numerical results for two test problems that model typical situations that may arise in the daily operation of gas networks. Y1 - 2017 ER - TY - INPR A1 - Schmitt, Johann Michael A1 - Ulbrich, Stefan T1 - Optimal Boundary Control of Hyperbolic Balance Laws with State Constraints N2 - In this paper we analyze the optimal control of initial-boundary value problems for entropy solutions of scalar hyperbolic balance laws with pointwise state constraints. Hereby, we suppose that the initial and the boundary data switch between different C¹-functions at certain switching points, where the C¹ -functions and the switching points are considered as the control. For a class of cost functionals, we prove first order necessary optimality conditions for the corresponding optimal control problem with state constraints. Furthermore, we use a Moreau-Yosida type regularization to approximate the optimal control problem with state constraints. We derive optimality conditions for the regularized problems and finally prove convergence to the solution of the optimal control problem with state constraints. Y1 - 2021 ER - TY - JOUR A1 - Burlacu, Robert A1 - Egger, Herbert A1 - Groß, Martin A1 - Martin, Alexander A1 - Pfetsch, Marc A1 - Schewe, Lars A1 - Sirvent, Mathias A1 - Skutella, Martin T1 - Maximizing the storage capacity of gas networks: a global MINLP approach N2 - In this paper, we study the transient optimization of gas networks, focusing in particular on maximizing the storage capacity of the network. We include nonlinear gas physics and active elements such as valves and compressors, which due to their switching lead to discrete decisions. The former is described by a model derived from the Euler equations that is given by a coupled system of nonlinear parabolic partial differential equations (PDEs). We tackle the resulting mathematical optimization problem by a first-discretize-then-optimize approach. To this end, we introduce a new discretization of the underlying system of parabolic PDEs and prove well-posedness for the resulting nonlinear discretized system. Endowed with this discretization, we model the problem of maximizing the storage capacity as a non-convex mixed-integer nonlinear problem (MINLP). For the numerical solution of the MINLP, we algorithmically extend a well-known relaxation approach that has already been used very successfully in the field of stationary gas network optimization. This method allows us to solve the problem to global optimality by iteratively solving a series of mixed-integer problems (MIPs). Finally, we present two case studies that illustrate the applicability of our approach. KW - Mixed-Integer Nonlinear Programming KW - Transient Gas Transport Optimization KW - Storage Capacity Maximization KW - Power-to-Gas KW - First-Discretize-Then-Optimize Y1 - 2019 U6 - https://doi.org/10.1007/s11081-018-9414-5 VL - 20 SP - 543 EP - 573 ET - Optimization and Engineering ER - TY - JOUR A1 - Schneider, Moritz A1 - Lang, Jens A1 - Weiner, Rüdiger T1 - Super-Convergent Implicit-Explicit Peer Methods with Variable Step Sizes N2 - Dynamical systems with sub-processes evolving on many different time scales are ubiquitous in applications. Their efficient solution is greatly enhanced by automatic time step variation. This paper is concerned with the theory, construction and application of IMEX-Peer methods that are super-convergent for variable step sizes and A-stable in the implicit part. IMEX schemes combine the necessary stability of implicit and low computational costs of explicit methods to efficiently solve systems of ordinary differential equations with both stiff and non-stiff parts included in the source term. To construct super-convergent IMEX-Peer methods which keep their higher order for variable step sizes and exhibit favourable linear stability properties, we derive necessary and sufficient conditions on the nodes and coefficient matrices and apply an extrapolation approach based on already computed stage values. New super-convergent IMEX-Peer methods of order s + 1 for s = 2, 3, 4 stages are given as result of additional order conditions which maintain the super-convergence property independent of step size changes. Numerical experiments and a comparison to other super-convergent IMEX-Peer methods show the potential of the new methods when applied with local error control. Y1 - 2019 U6 - https://doi.org/doi:10.1016/j.cam.2019.112501 VL - J. Comput. Appl. Math. IS - 387 SP - 112501 ER - TY - JOUR A1 - Ullmann, Sebastian A1 - Müller, Christopher A1 - Lang, Jens T1 - Stochastic Galerkin Reduced Basis Methods for Parametrized Linear Convection-Diffusion-Reaction Equations N2 - We consider the estimation of parameter-dependent statistics of functional outputs of steady-state convection–diffusion–reaction equations with parametrized random and deterministic inputs in the framework of linear elliptic partial differential equations. For a given value of the deterministic parameter, a stochastic Galerkin finite element (SGFE) method can estimate the statistical moments of interest of a linear output at the cost of solving a single, 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 model equations. In this scenario, the complexity of evaluating the SGRB model for a new value of the deterministic parameter only depends on the reduced dimension. To derive an SGRB model, we project the spatial-stochastic weak solution of a parameter-dependent SGFE model onto a reduced basis generated by a proper orthogonal decomposition (POD) of 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 or diffusivity 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. Y1 - 2018 U6 - https://doi.org/doi:10.3390/fluids6080263 VL - Fluids IS - 6 SP - 263 ER - TY - JOUR A1 - Mindt, Pascal A1 - Lang, Jens A1 - Domschke, Pia T1 - Entropy-Preserving Coupling of Hierarchical Gas Models N2 - This paper is concerned with coupling conditions at junctions for transport models which differ in their fidelity to describe transient flow in gas pipelines. It also includes the integration of compressors between two pipes with possibly different models. A hierarchy of three one-dimensional gas transport models is built through the 3 × 3 polytropic Euler equations, the 2 × 2 isentropic Euler equations and a simplified version of it for small velocities. To ensure entropy preservation, we make use of the novel entropy-preserving coupling conditions recently proposed by Lang and Mindt [Netw. Heterog. Media, 13:177-190, 2018] and require the equality of the total enthalpy at the junction and that the specific entropy for pipes with outgoing flow equals the convex combination of all entropies that belong to pipes with incoming flow. We prove the existence and uniqueness of solutions to generalised Riemann problems at a junction in the neighbourhood of constant coupling functions and stationary states which belong to the subsonic region. This provides the basis for the well-posedness of certain Cauchy problems for initial data with sufficiently small total variation. Y1 - 2018 U6 - https://doi.org/doi:10.1137/19M1240034 VL - SIAM Journal on Mathematical Analysis IS - 51 SP - 4754 EP - 4775 ER - TY - JOUR A1 - Schmidt, Martin A1 - Sirvent, Mathias A1 - Wollner, Winnifried T1 - The Cost of Not Knowing Enough: Mixed-Integer Optimization with Implicit Lipschitz Nonlinearities JF - Optimization Letters N2 - It is folklore knowledge that nonconvex mixed-integer nonlinear optimization problems can be notoriously hard to solve in practice. In this paper we go one step further and drop analytical properties that are usually taken for granted in mixed-integer nonlinear optimization. First, we only assume Lipschitz continuity of the nonlinear functions and additionally consider multivariate implicit constraint functions that cannot be solved for any parameter analytically. For this class of mixed-integer problems we propose a novel algorithm based on an approximation of the feasible set in the domain of the nonlinear function---in contrast to an approximation of the graph of the function considered in prior work. This method is shown to compute approximate global optimal solutions in finite time and we also provide a worst-case iteration bound. In some first numerical experiments we show that the ``cost of not knowing enough'' is rather high by comparing our approach with the open-source global solver SCIP. This reveals that a lot of work is still to be done for this highly challenging class of problems and we thus finally propose some possible directions of future research. KW - Mixed-Integer Nonlinear Optimization, Global Optimization, Lipschitz Optimization, Gas Networks Y1 - 2018 ER - TY - INPR A1 - Beckers, Susanne A1 - Behrens, Jörn A1 - Wollner, Winnifried T1 - Duality Based Error Estimation in the Presence of Discontinuities N2 - Goal-oriented mesh adaptation, in particular using the dual-weighted residual (DWR) method, is known in many cases to produce very efficient meshes. For obtaining such meshes the (numerical) solution of an adjoint problem is needed to weight the residuals appropriately with respect to their relevance for the overall error. For hyperbolic problems already the weak primal problem requires in general an additional entropy condition to assert uniqueness of solutions; this difficulty is also reflected when considering adjoints to hyperbolic problems involving discontinuities where again an additional requirement (reversibility) is needed to select appropriate solutions. Within this article, an approach to the DWR method for hyperbolic problems based on an artificial viscosity approximation is proposed. It is discussed why the proposed method provides a well-posed dual problem, while a direct, formal, application of the dual problem does not. Moreover, we will discuss a further, novel, approach in which the forward problem need not be modified, thus allowing for an unchanged forward solution. The latter procedure introduces an additional residual term in the error estimation, accounting for the inconsistency between primal and dual problem. Finally, the effectivity of the extended error estimator, assessing the global error by a suitable functional of interest, is tested numerically; and the advantage over a formal estimator approach is demonstrated. KW - dual weighted residual, hyperbolic problems, discontinuous Galerkin, artificial viscosity Y1 - 2017 ER - TY - INPR A1 - Egger, Herbert T1 - A class of Galerkin schemes for time-dependent radiative transfer N2 - The numerical solution of time-dependent radiative transfer problems is challenging, both, due to the high dimension as well as the anisotropic structure of the underlying integro-partial differential equation. In this paper we propose a general framework for designing numerical methods for time-dependent radiative transfer based on a Galerkin discretization in space and angle combined with appropriate time stepping schemes. This allows us to systematically incorporate boundary conditions and to preserve basic properties like exponential stability and decay to equilibrium also on the discrete level. We present the basic a-priori error analysis and provide abstract error estimates that cover a wide class of methods. The starting point for our considerations is to rewrite the radiative transfer problem as a system of evolution equations which has a similar structure like first order hyperbolic systems in acoustics or electrodynamics. This analogy allows us to generalize the main arguments of the numerical analysis for such applications to the radiative transfer problem under investigation. We also discuss a particular discretization scheme based on a truncated spherical harmonic expansion in angle, a finite element discretization in space, and the implicit Euler method in time. The performance of the resulting mixed PN-finite element time stepping scheme is demonstrated by computational results. Y1 - 2017 ER - TY - INPR A1 - Egger, Herbert T1 - Enhancement of flow measurements using fluid dynamic constraints N2 - Novel experimental modalities acquire spatially resolved velocity measurements for steady state and transient flows which are of interest for engineering and biological applications. One of the drawbacks of such high resolution velocity data is their susceptibility to measurement errors. In this paper, we propose a novel filtering strategy that allows enhancement of noisy measurements to obtain reconstruction of smooth divergence free velocity and corresponding pressure fields, which together approximately comply to a prescribed flow model. The main step in our approach consists of the appropriate use of the velocity measurements in the design of a linearized flow model which can be shown to be well-posed and consistent with the true velocity and pressure fields up to measurement and modeling errors. The reconstruction procedure is formulated as a linear quadratic optimal control problem and the resulting filter has analyzable smoothing and approximation properties. We also discuss briefly the discretization of our approach by finite element methods and comment on the efficient solution of the linear optimality system by iterative solvers. The capability of the proposed method to significantly reduce data noise is demonstrated by numerical tests in which we also compare to other methods like smoothing and solenoidal filtering. Y1 - 2017 ER - TY - INPR A1 - Egger, Herbert A1 - Pietschmann, Jan-Frederik A1 - Schlottbom, Matthias T1 - On the uniqueness of nonlinear diffusion coefficients in the presence of lower order terms N2 - We consider the identification of nonlinear diffusion coefficients of the form a(t,u) or a(u) in quasi-linear parabolic and elliptic equations. Uniqueness for this inverse problem is established under very general assumptions using partial knowledge of the Dirichlet-to-Neumann map. The proof of our main result relies on the construction of a series of appropriate Dirichlet data and test functions with a particular singular behavior at the boundary. This allows us to localize the analysis and to separate the principal part of the equation from the remaining terms. We therefore do not require specific knowledge of lower order terms or initial data which allows to apply our results to a variety of applications. This is illustrated by discussing some typical examples in detail. Y1 - 2017 ER - TY - INPR A1 - Egger, Herbert T1 - A mixed variational discretization for non-isothermal compressible flow in pipelines N2 - We consider the non-isothermal flow of a compressible fluid through pipes. Starting from the full set of Euler equations, we propose a variational characterization of solutions that encodes the conservation of mass, energy, and entropy in a very direct manner. This variational principle is suitable for a conforming Galerkin approximation in space which automatically inherits the basic physical conservation laws. Three different spaces are used for approximation of density, mass flux, and temperature, and we consider a mixed finite element method as one possible choice of suitable approximation spaces. We also investigate the subsequent discretization in time by a problem adapted implicit time stepping scheme for which exact conservation of mass as well as a slight dissipation of energy and increase of entropy are proven which are due to the numerical dissipation of the implicit time discretization. The main arguments of our analysis are rather general and allow us to extend the approach with minor modification to more general boundary conditions and flow models taking into account friction, viscosity, heat conduction, and heat exchange with the surrounding medium. Y1 - 2017 ER - TY - INPR A1 - Egger, Herbert A1 - Radu, Bogdan T1 - Super-convergence and post-processing for mixed finite element approximations of the wave equation N2 - We consider the numerical approximation of acoustic wave propagation problems by mixed BDM(k+1)-P(k) finite elements on unstructured meshes. Optimal convergence of the discrete velocity and super-convergence of the pressure by one order are established. Based on these results, we propose a post-processing strategy that allows us to construct an improved pressure approximation from the numerical solution. Corresponding results are well-known for mixed finite element approximations of elliptic problems and we extend these analyses here to the hyperbolic problem under consideration. We also consider the subsequent time discretization by the Crank-Nicolson method and show that the analysis and the post-processing strategy can be generalized to the fully discrete schemes. Our proofs do not rely on duality arguments or inverse inequalities and the results therefore apply also for non-convex domains and non-uniform meshes. Y1 - 2017 ER - TY - INPR A1 - Egger, Herbert A1 - Böttcher, Anke T1 - Energy stable discretization of Allen-Cahn type problems modeling the motion of phase boundaries N2 - We study the systematic numerical approximation of a class of Allen-Cahn type problems modeling the motion of phase interfaces. The common feature of these models is an underlying gradient flow structure which gives rise to a decay of an associated energy functional along solution trajectories. We first study the discretization in space by a conforming Galerkin approximation of a variational principle which characterizes smooth solutions of the problem. Well-posedness of the resulting semi-discretization is established and the energy decay along discrete solution trajectories is proven. A problem adapted implicit time-stepping scheme is then proposed and we establish its well-posed and decay of the free energy for the fully discrete scheme. Some details about the numerical realization by finite elements are discussed, in particular the iterative solution of the nonlinear problems arising in every time-step. The theoretical results are illustrated by numerical tests which also provide further evidence for asymptotic expansions of the interface velocities derived by Alber et al. Y1 - 2017 ER - TY - INPR A1 - Giesselmann, Jan A1 - Kunkel, Teresa T1 - Identification of minimal number of measurements allowing synchronization of a nodal observer for the wave equation N2 - We study a state estimation problem for a 2x2 linear hyperbolic system on networks with eigenvalues with opposite signs. The system can be seen as a simplified model for gas flow through gas networks. For this system we construct an observer system based on nodal measurements and investigate the convergence of the state of the observer system towards the original system state. We assume that measurements are available at the boundary nodes of the network and identify the minimal number of additional measurements in the network that are needed to guarantee synchronization of the observer state towards the original system state. It turns out that for tree-shaped networks boundary measurements suffice to guarantee exponential synchronization, while for networks that contain cycles synchronization can be guaranteed if and only if at least one measurement point is added in each cycle. This is shown for a system without source term and for a system with linear friction term. Y1 - 2024 ER - TY - CHAP A1 - Börner, Pascal A1 - Pfetsch, Marc E. A1 - Ulbrich, Stefan T1 - Modeling and optimization of gas mixtures on networks N2 - This paper presents a model for the mixture of gases on networks in the stationary case. The model is based on an equation of state for the mixture, the stationary isothermal Euler equations and coupling conditions for the flow and mixture. The equation of state or pressure law is based on the change of the speed of sound in a mixture of gases. We use this model to solve stationary gas flow problems to global optimality on large networks and present computational results. Y1 - 2024 ER - TY - INPR A1 - Giesselmann, Jan A1 - Kwon, Kiwoong A1 - Lee, Min-Gi T1 - Relative entropy technique in terms of position and momentum and its application to Euler-Poisson system N2 - This paper presents a systematic study of the relative entropy technique for compressible motions of continuum bodies described as Hamiltonian flows. While the description for the classical mechanics of N particles involves a Hamiltonian in terms of position and momentum vectors, that for the continuum fluid involves a Hamiltonian in terms of density and momentum. For space dimension d≥2, the Hamiltonian functional has a non-convex dependency on the deformation gradient or placement map due to material frame indifference. Because of this, the applicability of the relative entropy technique with respect to the deformation gradient or the placement map is inherently limited. Despite these limitations, we delineate the feasible applications and limitations of the technique by pushing it to its available extent. Specifically, we derive the relative Hamiltonian identity, where the Hamiltonian takes the position and momentum field as its primary and conjugate state variables, all within the context of the referential coordinate system that describes the motion. This approach, when applicable, turns out to yield rather strong stability statements. As instances, we consider Euler-Poisson systems in one space dimension. For a specific pressureless model, we verify non-increasing L2 state differences before the formation of δ-shock. In addition, weak-strong uniqueness, stability of rarefaction waves, and convergence to the gradient flow in the singular limit of large friction are shown. Depending on the presence or absence of pressure, assumptions are made to suitably accommodate phenomena such as δ-shocks, vacuums, and shock discontinuities in the weak solutions. Y1 - 2024 ER - TY - INPR A1 - Birke, Gunnar A1 - Engwer, Christian A1 - Giesselmann, Jan A1 - May, Sandra T1 - Error analysis of a first-order DoD cut cell method for 2D unsteady advection N2 - In this work we present an a priori error analysis for solving the unsteady advection equation on cut cell meshes along a straight ramp in two dimensions. The space discretization uses a lowest order upwind-type discontinuous Galerkin scheme involving a \textit{Domain of Dependence} (DoD) stabilization to correct the update in the neighborhood of small cut cells. Thereby, it is possible to employ explicit time stepping schemes with a time step length that is independent of the size of the very small cut cells. Our error analysis is based on a general framework for error estimates for first-order linear partial differential equations that relies on consistency, boundedness, and discrete dissipation of the discrete bilinear form. We prove these properties for the space discretization involving DoD stabilization. This allows us to prove, for the fully discrete scheme, a quasi-optimal error estimate of order one half in a norm that combines the L∞-in-time L2-in-space norm and a seminorm that contains velocity weighted jumps. We also provide corresponding numerical results. KW - cut cell KW - discontinuous Galerkin method KW - DoD Stabilization KW - a priori error estimate KW - unsteady advection Y1 - 2024 ER - TY - INPR A1 - Berrens, Arne A1 - Giesselmann, Jan T1 - A posteriori error control for a finite volume scheme for a cross-diffusion model of ion transport N2 - We derive a reliable a posteriori error estimate for a cell-centered finite volume scheme approximating a cross-diffusion system modeling ion transport through nanopores. To this end we derive an abstract stability framework that is independent of the numerical scheme and introduce a suitable (conforming) reconstruction of the numerical solution. The stability framework relies on some simplifying assumption that coincide with those made in weak uniqueness results for this system. This is the first a posteriori error estimate for a cross-diffusion system. Along the way, we derive a pointwise a posteriori error estimate for a finite volume scheme approximating the diffusion equation. We conduct numerical experiments showing that the error estimator scales with the same order as the true error. KW - cross-diffusion KW - ion transport KW - finite-volume approximation KW - a posteriori error estimates KW - diffusion equation Y1 - 2025 ER - TY - CHAP A1 - Disser, Yann A1 - Griesbach, Svenja M. A1 - Klimm, Max A1 - Lutz, Annette T1 - Bicriterial Approximation for the Incremental Prize-Collecting Steiner-Tree Problem N2 - We consider an incremental variant of the rooted prize-collecting Steiner-tree problem with a growing budget constraint. While no incremental solution exists that simultaneously approximates the optimum for all budgets, we show that a bicriterial (α,μ)-approximation is possible, i.e., a solution that with budget B+α for all B∈R≥0 is a multiplicative μ-approximation compared to the optimum solution with budget B. For the case that the underlying graph is a tree, we present a polynomial-time density-greedy algorithm that computes a (χ,1)-approximation, where χ denotes the eccentricity of the root vertex in the underlying graph, and show that this is best possible. An adaptation of the density-greedy algorithm for general graphs is (γ,2)-competitive where γ is the maximal length of a vertex-disjoint path starting in the root. While this algorithm does not run in polynomial time, it can be adapted to a (γ,3)-competitive algorithm that runs in polynomial time. We further devise a capacity-scaling algorithm that guarantees a (3χ,8)-approximation and, more generally, a ((4ℓ−1)χ,(2^(ℓ+2))/(2^ℓ−1))-approximation for every fixed ℓ∈N. KW - incremental maximization KW - competitive analysis KW - prize-collecting Steiner-tree Y1 - 2024 ER - TY - JOUR A1 - Hajian, Soheil A1 - Hintermüller, Michael A1 - Ulbrich, Stefan T1 - Total variation diminishing schemes in optimal control of scalar conservation laws JF - IMA Journal of Numerical Analysis N2 - In this paper, optimal control problems subject to a nonlinear scalar conservation law are studied. Such optimal control problems are challenging both at the continuous and at the discrete level since the control-to-state operator poses difficulties as it is, e.g., not differentiable. Therefore discretization of the underlying optimal control problem should be designed with care. Here the discretize-then-optimize approach is employed where first the full discretization of the objective function as well as the underlying PDE is considered. Then, the derivative of the reduced objective is obtained by using an adjoint calculus. In this paper total variation diminishing Runge-Kutta (TVD-RK) methods for the time discretization of such problems are studied. TVD-RK methods, also called strong stability preserving (SSP), are originally designed to preserve total variation of the discrete solution. It is proven in this paper that providing an SSP state scheme, is enough to ensure stability of the discrete adjoint. However requiring SSP for both discrete state and adjoint is too strong. Also approximation properties that the discrete adjoint inherits from the discretization of the state equation are studied. Moreover order conditions are derived. In addition, optimal choices with respect to CFL constant are discussed and numerical experiments are presented. Y1 - 2017 U6 - https://doi.org/10.20347/WIAS.PREPRINT.2383 VL - 39 SP - 105 EP - 140 ER - TY - JOUR A1 - Groß, Martin A1 - Marc E., Pfetsch A1 - Schewe, Lars A1 - Schmidt, Martin A1 - Skutella, Martin T1 - Algorithmic Results for Potential-Based Flows: Easy and Hard Cases N2 - Potential-based flows are an extension of classical network flows in which the flow on an arc is determined by the difference of the potentials of its incident nodes. Such flows are unique and arise, for example, in energy networks. Two important algorithmic problems are to determine whether there exists a feasible flow and to maximize the flow between two designated nodes. We show that these problems can be solved for the single source and sink case by reducing the network to a single arc. However, if we additionally consider switches that allow to force the flow to 0 and decouple the potentials, these problems are NP-hard. Nevertheless, for particular series-parallel networks, one can use algorithms for the subset sum problem. Moreover, applying network presolving based on generalized series-parallel structures allows to significantly reduce the size of realistic energy networks. KW - Potential networks KW - Potential-based flows KW - Maximum flow problem KW - Series-parallel graphs KW - Network reduction Y1 - 2017 U6 - https://doi.org/10.1002/net.21865 VL - 73 IS - 3 SP - 303 EP - 324 ET - Networks ER - TY - JOUR A1 - Groß, Martin A1 - Pfetsch, Marc E. A1 - Skutella, Martin T1 - On the Complexity of Instationary Gas Flows N2 - We study a simplistic model of instationary gas flows consisting of a sequence of k stationary gas flows. We present efficiently solvable cases and NP-hardness results, establishing complexity gaps between stationary and instationary gas flows (already for k=2) as well as between instationary gas s-t-flows and instationary gas b-flows. Y1 - 2017 U6 - https://doi.org/10.1016/j.orl.2018.01.007 VL - 46 IS - 3 SP - 286 EP - 290 ET - Operations Research Letters ER - TY - JOUR A1 - Schmidt, Martin A1 - Sirvent, Mathias A1 - Wollner, Winnifried T1 - A Decomposition Method for MINLPs with Lipschitz Continuous Nonlinearities JF - Mathematical Programming N2 - Many mixed-integer optimization problems are constrained by nonlinear functions that do not possess desirable analytical properties like convexity or factorability or cannot even be evaluated exactly. This is, e.g., the case for problems constrained by differential equations or for models that rely on black-box simulation runs. For these problem classes, we present, analyze, and test algorithms that solve mixed-integer problems with only Lipschitz continuous nonlinearities. Our theoretical results depend on the assumptions made on the (in)exactness of function evaluations and on the knowledge of Lipschitz constants. If Lipschitz constants are known, we prove finite termination at approximate globally optimal points both for the case of exact and inexact function evaluations. If only approximate Lipschitz constants are known, we prove finite termination and derive additional conditions under which infeasibility can be detected. A computational study for gas transport problems and an academic case study show the applicability of our algorithms to real-world problems and how different assumptions on the constraint functions up- or downgrade the practical performance of the methods. KW - Mixed-Integer Nonlinear Optimization, Lipschitz Optimization, Inexact Function Evaluations, Decomposition Methods, Gas Networks Y1 - 2017 IS - 178(1) SP - 449 EP - 483 ER - TY - INPR A1 - Egger, Herbert A1 - Kugler, Thomas A1 - Liljegren-Sailer, Björn A1 - Marheineke, Nicole A1 - Mehrmann, Volker T1 - On structure preserving model reduction for damped wave propagation in transport networks N2 - We consider the discretization and subsequent model reduction of a system of partial differential-algebraic equations describing the propagation of pressure waves in a pipeline network. Important properties like conservation of mass, dissipation of energy, passivity, existence of steady states, and exponential stability can be preserved by an appropriate semi- discretization in space via a mixed finite element method and also during the further dimension reduction by structure preserving Galerkin projection which is the main focus of this paper. Krylov subspace methods are employed for the construction of the reduced models and we discuss modifications needed to satisfy certain algebraic compatibility conditions; these are required to ensure the well-posedness of the reduced models and the preservation of the key properties. Our analysis is based on the underlying infinite dimensional problem and its Galerkin approximations. The proposed algorithms therefore have a direct interpretation in function spaces; in principle, they are even applicable directly to the original system of partial differential-algebraic equations while the intermediate discretization by finite elements is only required for the actual computations. The performance of the proposed methods is illustrated with numerical tests and the necessity for the compatibility conditions is demonstrated by examples. KW - partial differential-algebraic equations KW - port-Hamiltonian systems KW - Galerkin projection Y1 - 2017 ER - TY - JOUR A1 - Habeck, Oliver A1 - Pfetsch, Marc E. A1 - Ulbrich, Stefan T1 - Global optimization of mixed-integer ODE constrained network problems using the example of stationary gas transport N2 - In this paper we propose a new approach for finding global solutions of mixed-integer nonlinear optimization problems with ordinary differential equation constraints on networks. Instead of using a first discretize then optimize approach, we combine spatial and variable branching with appropriate discretizations of the differential equations to derive relaxations of the original problem. To construct the relaxations we derive convex under- and concave over-estimators for the ODE solution operators using numerical discretization schemes. Thereby, we make use of the underlying network structure, where the solutions of the ODEs only need to be known at a finite number of points. This property enables us to adaptively refine the discretization and relaxation without introducing new variables. The incorporation into a spatial branch-and-bound process allows to compute global epsilon-optimal solutions or decide infeasibility. We prove that this algorithm terminates finitely under some natural assumptions. We then show how this approach works for the example of stationary gas transport and provide some illustrative computational examples. KW - Global Optimization KW - Mixed-Integer Nonlinear Optimization Y1 - 2017 U6 - https://doi.org/10.1137/17M1152668 VL - 29 IS - 4 SP - 2949 EP - 2985 ET - SIAM Journal of Optimization ER - TY - INPR A1 - Domschke, Pia A1 - Hiller, Benjamin A1 - Lang, Jens A1 - Tischendorf, Caren T1 - Modellierung von Gasnetzwerken: Eine Übersicht N2 - Mit dieser Übersicht wollen wir eine Zusammenstellung von unterschiedlichen Modellen zur Beschreibung des Gasflusses in Netzwerken bereitstellen, um den Einstieg in das Thema zu erleichtern. Besonderes Augenmerk wird dabei auf die der Modellierung inneliegende hierarchische Struktur und die detaillierte Beschreibung einzelner Bauteile wie Ventile und Kompressoren gelegt. Daneben finden sich ebenfalls Netzmodellklassen, die auf rein algebraische Relationen aufbauen. Am Ende geben wir einen kurzen Überblick über grundlegende numerische Verfahren und Konzepte zur Behandlung von hyperbolischen Bilanzgleichungen. Wir erheben keinen Anspruch auf Vollständigkeit und verweisen an vielen Stellen auf die bestehende Literatur. Die Idee eines Modellkataloges ist uns im Rahmen der Antragstellung zum SFB/Transregio 154 „Mathematische Modellierung, Simulation und Optimierung am Beispiel von Gasnetzwerken“ gekommen. Wir möchten an dieser Stelle die Förderung durch die DFG dankend erwähnen. KW - Euler-Gleichungen, isotherme Euler-Gleichungen, Modellhierarchie, Netzelemente Y1 - 2017 VL - 2717 ER - TY - JOUR A1 - Domschke, Pia A1 - Groß, Martin A1 - Hiller, Benjamin A1 - Hante, Falk A1 - Schewe, Lars A1 - Schmidt, Martin T1 - Mathematische Modellierung, Simulation und Optimierung von Gastransportnetzwerken JF - gwf-gas/erdgas Y1 - 2015 VL - 11 SP - 880 EP - 885 ER - TY - JOUR A1 - Schmidt, Martin A1 - Aßmann, Denis A1 - Burlacu, Robert A1 - Humpola, Jesco A1 - Joormann, Imke A1 - Kanelakis, Nikolaos A1 - Koch, Thorsten A1 - Oucherif, Djamal A1 - Pfetsch, Marc E. A1 - Schewe, Lars A1 - Schwarz, Robert A1 - Sirvent, Mathias T1 - GasLib – A Library of Gas Network Instances JF - Data N2 - The development of mathematical simulation and optimization models and algorithms for solving gas transport problems is an active field of research. In order to test and compare these models and algorithms, gas network instances together with demand data are needed. The goal of GasLib is to provide a set of publicly available gas network instances that can be used by researchers in the field of gas transport. The advantages are that researchers save time by using these instances and that different models and algorithms can be compared on the same specified test sets. The library instances are encoded in an XML format. In this paper, we explain this format and present the instances that are available in the library. KW - Gas Transport KW - Networks KW - Problem Instances KW - Mixed-Integer Nonlinear Optimization KW - GasLib Y1 - 2017 U6 - https://doi.org/10.3390/data2040040 VL - 4 IS - 2 ER - TY - JOUR A1 - Gugat, Martin A1 - Ulbrich, Stefan ED - CHEN, GOONG T1 - The isothermal Euler equations for ideal gas with source term: Product solutions, flow reversal and no blow up JF - Journal of Mathematical Analysis and Applications KW - Global classical solutions Ideal gas Bi-directional flow Transsonic flow Y1 - 2017 U6 - https://doi.org/10.1016/j.jmaa.2017.04.064 VL - 454 IS - 1 SP - 439 EP - 452 ER - TY - INPR A1 - Egger, Herbert A1 - Kugler, Thomas T1 - Uniform exponential stability of Galerkin approximations for damped wave systems N2 - We consider the numerical approximation of linear damped wave systems by Galerkin approximations in space and appropriate time-stepping schemes. Based on a dissipation estimate for a modified energy, we prove exponential decay of the physical energy on the continuous level provided that the damping is effective everywhere in the domain. The methods of proof allow us to analyze also a class of Galerkin approximations based on a mixed variational formulation of the problem. Uniform exponential stabil- ity can be guaranteed for these approximations under a general compatibility condition on the discretization spaces. As a particular example, we discuss the discretization by mixed finite element methods for which we obtain convergence and uniform error esti- mates under minimal regularity assumptions. We also prove unconditional and uniform exponential stability for the time discretization by certain one-step methods. The valid- ity of the theoretical results as well as the necessity of some of the conditions required for our analysis are demonstrated in numerical tests Y1 - 2016 ER - TY - INPR A1 - Egger, Herbert A1 - Kugler, Thomas T1 - Damped wave systems on networks: exponential stability and uniform approximations N2 - We consider a damped linear hyperbolic system modelling the propagation of pressure waves in a network of pipes. Well-posedness is established via semi-group theory and the existence of a unique steady state is proven in the absence of driving forces. Under mild assumptions on the network topology and the model parameters, we show exponential stability and convergence to equilibrium. This generalizes related results for single pipes and multi-dimensional domains to the network context. Our proof of the exponential stability estimate is based on a variational formulation of the problem, some graph theoretic results, and appropriate energy estimates. The main arguments are rather generic and can be applied also for the analysis of Galerkin approximations. Uniform exponential stability can be guaranteed for the resulting semi-discretizations under mild compatibility conditions on the approximation spaces. A particular realiza- tion by mixed finite elements is discussed and the theoretical results are illustrated by numerical tests in which also bounds for the decay rate are investigated. Y1 - 2016 ER - TY - JOUR A1 - Egger, Herbert A1 - Kugler, Thomas A1 - Strogies, Nikolai T1 - Parameter identification in a semilinear hyperbolic system JF - Inverse Problems N2 - We consider the identification of a nonlinear friction law in a one-dimensional damped wave equation from additional boundary measurements. Well-posedness of the governing semilinear hyperbolic system is established via semigroup theory and con- traction arguments. We then investigte the inverse problem of recovering the unknown nonlinear damping law from additional boundary measurements of the pressure drop along the pipe. This coefficient inverse problem is shown to be ill-posed and a varia- tional regularization method is considered for its stable solution. We prove existence of minimizers for the Tikhonov functional and discuss the convergence of the regularized so- lutions under an approximate source condition. The meaning of this condition and some arguments for its validity are discussed in detail and numerical results are presented for illustration of the theoretical findings Y1 - 2016 VL - 33 IS - 055022 ER - TY - JOUR A1 - Egger, Herbert T1 - A robust conservative mixed finite element method for compressible flow on pipe networks N2 - We consider the numerical approximation of compressible flow in a pipe net- work. Appropriate coupling conditions are formulated that allow us to derive a variational characterization of solutions and to prove global balance laws for the conservation of mass and energy on the whole network. This variational principle, which is the basis of our fur- ther investigations, is amenable to a conforming Galerkin approximation by mixed finite elements. The resulting semi-discrete problems are well-posed and automatically inherit the global conservation laws for mass and energy from the continuous level. We also consider the subsequent discretization in time by a problem adapted implicit time stepping scheme which leads to conservation of mass and a slight dissipation of energy of the full discretization. The well-posedness of the fully discrete scheme is established and a fixed-point iteration is proposed for the solution of the nonlinear systems arising in every single time step. Some computational results are presented for illustration of our theoretical findings and for demon- stration of the robustness and accuracy of the new method Y1 - 2016 ER - TY - JOUR A1 - Pfaff, Sebastian A1 - Ulbrich, Stefan T1 - Optimal Boundary Control of Nonlinear Hyperbolic Conservation Laws with Switched Boundary Data JF - SIAM Journal on Control and Optimization N2 - We consider the optimal control of initial-boundary value problems for entropy solutions of scalar hyperbolic conservation laws. In particular, we consider initial-boundary value problems where the initial and boundary data switch between different C¹-functions at certain switching points and both the functions and the switching points are controlled. We show that the control-to-state mapping is differentiable in a certain generalized sense, which implies Fréchet-differentiability with respect to the control functions and the switching points for the composition with a tracking type functional, even in the presence of shocks. We also present an adjoint-based formula for the gradient of the reduced objective functional. KW - optimal control, scalar conservation law, differentiability, adjoint state, shock sensitivity Y1 - 2016 U6 - https://doi.org/10.1137/140995799 VL - 53 IS - 3 SP - 1250 EP - 1277 ER - TY - JOUR A1 - Pfaff, Sebastian A1 - Ulbrich, Stefan T1 - Optimal Control of Nonlinear Hyperbolic Conservation Laws by On/Off-Switching JF - Optimization Methods and Software N2 - This paper studies the differentiability properties of the control-to-state mapping for entropy solutions to a scalar hyperbolic conservation law on R with respect to the switching times of an on/off-control. The switching times between on-modes and off-modes are the control variables of the considered optimization problem, where a general tracking-type functional is minimized.We investigate the differentiability of the reduced objective function, also in the presence of shocks. We show that the state y(t,·) at some observation time t depends differentiably on the switching times in a generalized sense that implies total differentiability for the composition with a tracking functional. Furthermore, we present an adjoint-based formula for the gradient of the reduced objective functional with respect to the switching times. KW - optimal control, scalar conservation law, network Y1 - 2017 U6 - https://doi.org/10.1080/10556788.2016.1236796 VL - 32 SP - 904 EP - 939 ER - TY - INPR A1 - Alldredge, Graham A1 - Frank, Martin A1 - Giesselmann, Jan T1 - On the convergence of the regularized entropy-based moment method for kinetic equations N2 - The entropy-based moment method is a well-known discretization for the velocity variable in kinetic equations which has many desirable theoretical properties but is difficult to implement with high-order numerical methods. The regularized entropy-based moment method was recently introduced to remove one of the main challenges in the implementation of the entropy-based moment method, namely the requirement of the realizability of the numerical solution. In this work we use the method of relative entropy to prove the convergence of the regularized method to the original method as the regularization parameter goes to zero and give convergence rates. Our main assumptions are the boundedness of the velocity domain and that the original moment solution is Lipschitz continuous in space and bounded away from the boundary of realizability. We provide results from numerical simulations showing that the convergence rates we prove are optimal. Y1 - 2023 U6 - https://doi.org/https://doi.org/10.5802/smai-jcm.93 VL - 9 ER - TY - INPR A1 - Gugat, Martin A1 - Giesselmann, Jan T1 - An Observer for pipeline flow with hydrogen blending in gas networks: exponential synchronization N2 - We consider a state estimation problem for gas flows in pipeline networks where hydrogen is blended into the natural gas. The flow is modeled by the quasi-linear isothermal Euler equations coupled to an advection equation on a graph. The flow through the vertices where the pipes are connected is governed by algebraic node conditions. The state is approximated by an observer system that uses nodal measurements. We prove that the state of the observer system converges to the original system state exponentially fast in the L2-norm if the measurements are exact. If measurement errors are present we show that the observer state approximates the original system state up to an error that is proportional to the maximal measurement error. The proof of the synchronization result uses Lyapunov functions with exponential weights. Y1 - 2023 ER - TY - INPR A1 - Egger, Herbert A1 - Giesselmann, Jan T1 - Regularity and long time behavior of a doubly nonlinear parabolic problem and its discretization N2 - We study a doubly nonlinear parabolic problem arising in the modeling of gas transport in pipelines. Using convexity arguments and relative entropy estimates we show uniform bounds and exponential stability of discrete approximations obtained by a finite element method and implicit time stepping. Due to convergence of the approximations to weak solutions of the problem, our results also imply regularity, uniqueness, and long time stability of weak solutions of the continuous problem. KW - gas transport KW - doubly nonlinear parabolic problems KW - relative entropy estimates KW - exponential stability KW - structure preserving discretization Y1 - 2023 ER - TY - INPR A1 - Giesselmann, Jan A1 - Krupa, Sam T1 - Theory of shifts, shocks, and the intimate connections to L2-type a posteriori error analysis of numerical schemes for hyperbolic problems N2 - In this paper, we develop reliable a posteriori error estimates for numerical approximations of scalar hyperbolic conservation laws in one space dimension. Our methods have no inherent small-data limitations and are a step towards error control of numerical schemes for systems. We are careful not to appeal to the Kruzhkov theory for scalar conservation laws. Instead, we derive novel quantitative stability estimates that extend the theory of shifts, and in particular, the framework for proving stability first developed by the second author and Vasseur. This is the first time this methodology has been used for quantitative estimates. We work entirely within the context of the theory of shifts and a-contraction, techniques which adapt well to systems. In fact, the stability framework by the second author and Vasseur has itself recently been pushed to systems [Chen-Krupa-Vasseur. Uniqueness and weak-BV stability for 2×2 conservation laws. Arch. Ration. Mech. Anal., 246(1):299--332, 2022]. Our theoretical findings are complemented by a numerical implementation in MATLAB and numerical experiments. KW - Conservation laws KW - entropy conditions KW - entropy solutions KW - shocks, KW - a posteriori error estimates Y1 - 2023 ER - TY - INPR A1 - Giesselmann, Jan A1 - Kolbe, Niklas T1 - A posteriori error analysis of a positivity preserving scheme for the power-law diffusion Keller-Segel model N2 - We study a finite volume scheme approximating a parabolic-elliptic Keller-Segel system with power law diffusion with exponent γ∈[1,3] and periodic boundary conditions. We derive conditional a posteriori bounds for the error measured in the L∞(0,T;H1(Ω)) norm for the chemoattractant and by a quasi-norm-like quantity for the density. These results are based on stability estimates and suitable conforming reconstructions of the numerical solution. We perform numerical experiments showing that our error bounds are linear in mesh width and elucidating the behaviour of the error estimator under changes of γ. KW - Keller-Segel KW - chemotaxis; KW - nonlinear diffusion KW - finite volume scheme KW - a posteriori error analysis Y1 - 2023 ER - TY - INPR A1 - Klimm, Max A1 - Pfetsch, Marc A1 - Raber, Rico A1 - Skutella, Martin T1 - Approximation of Binary Second Order Cone Programs of Packing Type N2 - This paper considers binary second order cone programs of packing type where a linear objective is optimized under m second order cone packing constraints and all decision variables are binary. We show that when m is part of the input, these problems cannot be approximated within a factor of 1/(m + 1)^(1−ε) for any ε > 0, unless P = NP. We then propose approximation algorithms based on different algorithmic principles that almost match this approximation factor: a pipage rounding technique that solves fractional relaxations of the problems and modifies the solutions so that few fractional variables remain, a greedy approach, and a randomized rounding technique. While all algorithms have similar theoretical approximation guarantees in the order of 1/m, we also test the algorithms on realistic instances that arise in the context of gas transportation networks. This empirical study reveals in particular that taking the best of the proposed algorithms produces highly competitive solutions that yield on average 96 % of the value of an optimal solution. Y1 - 2021 ER - TY - INPR A1 - Klimm, Max A1 - Pfetsch, Marc A1 - Raber, Rico A1 - Skutella, Martin T1 - Reduction of Potential-Based Flow Networks N2 - We consider potential-based flow networks with terminal nodes at which flow can enter or leave the network and physical properties such as voltages or pressures are measured and controlled. We study conditions under which such a network can be reduced to a smaller, equivalent network with the same behavior at the terminal nodes. Potential-based flow networks are widely used to model infrastructure networks such as electricity, gas, or water networks. In contrast to Kron's reduction for electrical networks, we prove that, in general, potential-based flow networks with at least three terminals cannot be reduced to smaller networks whose size only depends on the number of terminals. On the other hand, we show that it is possible to represent a special class of potential-based flow networks by a complete graph on the terminals, and we establish a characterization of networks that can be reduced to a path network. Our results build on fundamental properties of effective resistances proved in this paper, including explicit formulae for their dependence on edge resistances of the network and their metric properties. Y1 - 2021 ER - TY - INPR A1 - Giesselmann, Jan A1 - Kwon, Kiwoong T1 - A posteriori error control for a Discontinuous Galerkin approximation of a Keller-Segel model N2 - We provide a posteriori error estimates for a discontinuous Galerkin scheme for the parabolic-elliptic Keller-Segel system in 2 or 3 space dimensions. The estimates are conditional, in the sense that an a posteriori computable quantity needs to be small enough - which can be ensured by mesh refinement - and optimal in the sense that the error estimator decays with the same order as the error under mesh refinement. A specific feature of our error estimator is that it can be used to prove existence of a weak solution up to a certain time based on numerical results. KW - Keller-Segel KW - chemotaxis KW - nonlinear diffusion KW - discontinuous Galerkin scheme KW - a posteriori error analysis Y1 - 2023 ER - TY - INPR A1 - Domschke, Pia A1 - Giesselmann, Jan A1 - Lang, Jens A1 - Breiten, Tobias A1 - Mehrmann, Volker A1 - Morandin, Riccardo A1 - Hiller, Benjamin A1 - Tischendorf, Caren T1 - Gas Network Modeling: An Overview (Extended English Version) N2 - With this overview we want to provide a compilation of different models for the description of gas flow in networks in order to facilitate the introduction to the topic. Special attention is paid to the hierarchical structure inherent to the modeling, and the detailed description of individual components such as valves and compressors. Also included are network model classes based on purely algebraic relations, and energy-based port-Hamiltonian models. A short overview of basic numerical methods and concepts for the treatment of hyperbolic balance equations is also given. We do not claim completeness and refer in many places to the existing literature. Y1 - 2023 ER - TY - JOUR A1 - Lang, Jens A1 - Schmitt, Bernhard A. T1 - Implicit A-Stable Peer Triplets for ODE Constrained Optimal Control Problems N2 - This paper is concerned with the construction and convergence analysis of novel implicit Peer triplets of two-step nature with four stages for nonlinear ODE constrained optimal control problems. We combine the property of superconvergence of some standard Peer method for inner grid points with carefully designed starting and end methods to achieve order four for the state variables and order three for the adjoint variables in a first-discretize-then-optimize approach together with A-stability. The notion triplets emphasizes that these three different Peer methods have to satisfy additional matching conditions. Four such Peer triplets of practical interest are constructed. Also as a benchmark method, the well-known backward differentiation formula BDF4, which is only A(73.35)-stable, is extended to a special Peer triplet to supply an adjoint consistent method of higher order and BDF type with equidistant nodes. Within the class of Peer triplets, we found a diagonally implicit A(84)-stable method with nodes symmetric in [0,1] to a common center that performs equally well. Numerical tests with three well established optimal control problems confirm the theoretical findings also concerning A-stability. Y1 - U6 - https://doi.org/https://doi.org/10.3390/a15090310 VL - Algorithms IS - Vol. 15 ER - TY - JOUR A1 - Strelow, Erik Laurin A1 - Gerisch, Alf A1 - Lang, Jens A1 - Pfetsch, Marc E. T1 - Physics-Informed Neural Networks: A Case Study for Gas Transport Problems N2 - Physics informed neural networks have been recently proposed and offer a new promising method to solve differential equations. They have been adapted to many more scenarios and different variations of the original method have been proposed. In this case study we review many of these variations. We focus on variants that can compensate for imbalances in the loss function and perform a comprehensive numerical comparison of these variants with application to gas transport problems. Our case study includes different formulations of the loss function, different algorithmic loss balancing methods, different optimization schemes and different numbers of parameters and sampling points. We conclude that the original PINN approach with specifically chosen constant weights in the loss function gives the best results in our tests. These weights have been obtained by a computationally expensive random-search scheme. We further conclude for our test case that loss balancing methods which were developed for other differential equations have no benefit for gas transport problems, that the control volume physics informed formulation has no benefit against the initial formulation and that the best optimization strategy is the L-BFGS method. Y1 - VL - Journal of Computational Physics IS - Vol. 481 SP - 112041 ER - TY - JOUR A1 - Lang, Jens A1 - Schmitt, Bernhard A. T1 - A Stiff MOL Boundary Control Problem for the 1D Heat Equation with Exact Discrete Solution N2 - Method-of-lines discretizations are demanding test problems for stiff inte- gration methods. However, for PDE problems with known analytic solution the presence of space discretization errors or the need to use codes to compute reference solutions may limit the validity of numerical test results. To over- come these drawbacks we present in this short note a simple test problem with boundary control, a situation where one-step methods may suffer from order reduction. We derive exact formulas for the solution of an optimal boundary control problem governed by a one-dimensional discrete heat equation and an objective function that measures the distance of the final state from the target and the control costs. This analytical setting is used to compare the numeri- cally observed convergence orders for selected implicit Runge-Kutta and Peer two-step methods of classical order four which are suitable for optimal control problems. Y1 - U6 - https://doi.org/https://doi.org/10.1007/s10957-022-02154-4 VL - Journal of Optimization Theory and Applications IS - Vol. 196 SP - 1106 EP - 1118 ER - TY - INPR A1 - Lang, Jens A1 - Schmitt, Bernhard A. T1 - Implicit Peer Triplets in Gradient-Based Solution Algorithms for ODE Constrained Optimal Control N2 - It is common practice to apply gradient-based optimization algorithms to numerically solve large-scale ODE constrained optimal control problems. Gradients of the objective function are most efficiently computed by approximate adjoint variables. High accuracy with moderate computing time can be achieved by such time integration methods that satisfy a sufficiently large number of adjoint order conditions and supply gradients with higher orders of consistency. In this paper, we upgrade our former implicit two-step Peer triplets constructed in [Algorithms, 15:310, 2022] to meet those new requirements. Since Peer methods use several stages of the same high stage order, a decisive advantage is their lack of order reduction as for semi-discretized PDE problems with boundary control. Additional order conditions for the control and certain positivity requirements now intensify the demands on the Peer triplet. We discuss the construction of 4-stage methods with order pairs (4,3) and (3,3) in detail and provide three Peer triplets of practical interest. We prove convergence for s-stage methods, for instance, order s for the state variables even if the adjoint method and the control satisfy the conditions for order s-1, only. Numerical tests show the expected order of convergence for the new Peer triplets. Y1 - 2023 VL - http://arxiv.org/abs/2303.18180 ER - TY - INPR A1 - Wilka, Hendrik A1 - Lang, Jens T1 - Adaptive hp-Polynomial Based Sparse Grid Collocation Algorithms for Piecewise Smooth Functions with Kinks N2 - High-dimensional interpolation problems appear in various applications of uncertainty quantification, stochastic optimization and machine learning. Such problems are computationally expensive and request the use of adaptive grid generation strategies like anisotropic sparse grids to mitigate the curse of dimensionality. However, it is well known that the standard dimension-adaptive sparse grid method converges very slowly or even fails in the case of non-smooth functions. For piecewise smooth functions with kinks, we construct two novel hp-adaptive sparse grid collocation algorithms that combine low-order basis functions with local support in parts of the domain with less regularity and variable-order basis functions elsewhere. Spatial refinement is realized by means of a hierarchical multivariate knot tree which allows the construction of localised hierarchical basis functions with varying order. Hierarchical surplus is used as an error indicator to automatically detect the non-smooth region and adaptively refine the collocation points there. The local polynomial degrees are optionally selected by a greedy approach or a kink detection procedure. Three numerical benchmark examples with different dimensions are discussed and comparison with locally linear and highest degree basis functions are given to show the efficiency and accuracy of the proposed methods. Y1 - ER - TY - INPR A1 - Schäfer Aguilar, Paloma A1 - Ulbrich, Stefan T1 - Convergence of numerical adjoint schemes arising from optimal boundary control problems of hyperbolic conservation laws N2 - We study the convergence of discretization schemes for the adjoint equation arising in the adjoint-based derivative computation for optimal boundary control problems governed by entropy solutions of conservation laws. As boundary control we consider piecewise continuously differentiable controls with possible discontinuities at switching times, where the smooth parts as well as the switching times serve as controls. The derivative of tracking-type objective functionals with respect to the smooth controls and the switching times can then be represented by an adjoint-based formula. The main difficulties arise from the fact that the correct adjoint state is the reversible solution of a transport equation with discontinuous coefficient and boundary conditions that lead in general to discontinuous adjoints. Moreover, the solution of the adjoint equation is non-unique and the so-called reversible solution leads to the correct adjoint-based derivative representation. We study discrete adjoint schemes of monotone difference schemes in conservation form such as Engquist-Osher or Lax-Friedrichs scheme. We also allow that the state is computed by another numerical scheme satisfying certain convergence properties. We proof convergence results of the discrete adjoint to the reversible solution. Y1 - 2021 ER - TY - JOUR A1 - Giesselmann, Jan A1 - Gugat, Martin A1 - Kunkel, Teresa T1 - Observer-based data assimilation for barotropic gas transport using distributed measurements N2 - We consider a state estimation problem for gas pipeline flow modeled by the one-dimensional barotropic Euler equations. In order to reconstruct the system state, we construct an observer system of Luenberger type based on distributed measurements of one state variable. First, we show the existence of Lipschitz-continuous semi-global solutions of the observer system and of the original system for initial and boundary data satisfying smallness and compatibility conditions for a single pipe and for general networks. Second, based on an extension of the relative energy method we prove that the state of the observer system converges exponentially in the long time limit towards the original system state. We show this for a single pipe and for star-shaped networks. Y1 - 2023 U6 - https://doi.org/10.4310/CMS.240918203214 VL - 22 SP - 2271 EP - 2309 PB - Communications in Mathematical Sciences ER - TY - INPR A1 - Breitkopf, Jannik A1 - Ulbrich, Stefan T1 - A Variational Calculus for Optimal Control of the Generalized Riemann Problem for Hyperbolic Systems of Conservation Laws N2 - We develop a variational calculus for entropy solutions of the Generalized Riemann Problem (GRP) for strictly hyperbolic systems of conservation laws where the control is the initial state. The GRP has a discontinuous initial state with exactly one discontinuity and continuously differentiable (C^1) states left and right of it. The control consists of the C^1 parts of the initial state and the position of the discontinuity. Solutions of the problem are generally discontinuous since they contain shock curves. We assume the time horizon T>0 to be sufficiently small such that no shocks interact and no new shocks are generated. Moreover, we assume that no rarefaction waves occur and that the jump of the initial state is sufficiently small. Since the shock positions depend on the control, a transformation to a reference space is used to fix the shock positions. In the reference space, we prove that the solution of the GRP between the shocks is continuously differentiable from the control space to C^0. In physical coordinates, this implies that the shock curves in C^1 and the states between the shocks in the topology of C^0 depend continuously differentiable on the control. As a consequence, we obtain the differentiability of tracking type objective functionals. KW - hyperbolic systems of conservation laws, shock curves, generalized riemann problem, optimal control, variational calculus Y1 - 2025 ER - TY - INPR A1 - Schuster, Michael A1 - Strauch, Elisa A1 - Wilka, Hendrik A1 - Lang, Jens A1 - Gugat, Martin T1 - Probabilistic Robustness for Compressor Controls in Transient Pipeline Networks N2 - Uncertainty plays a crucial role in modeling and optimization of complex systems across various applications. In this paper, uncertain gas transport through pipeline networks is considered and a novel strategy to measure the robustness of deterministically computed compressor and valve controls, the probabilistic robustness, is presented. \noindent Initially, an optimal control for a deterministic gas network problem is computed such that the total control cost is minimized with respect to box constraints for the pressure. Subsequently, the model is perturbed by uncertain gas demands. The probability, that the uncertain gas pressures - based on the a priori deterministic optimal control - satisfy the box constraints, is evaluated. Moreover, buffer zones are introduced in order to tighten the pressure bounds in the deterministic scenario. Optimal controls for the deterministic scenario with buffer zones are also applied to the uncertain scenario, allowing to analyze the impact of the buffer zones on the probabilistic robustness of the optimal controls. \noindent For the computation of the probability, we apply a kernel density estimator based on samples of the uncertain pressure at chosen locations. In order to reduce the computational effort of generating the samples, we combine the kernel density estimator approach with a stochastic collocation method which approximates the pressure at the chosen locations in the stochastic space. Finally, we discuss generalizations of the probabilistic robustness check and we present numerical results for a gas network taken from the public gas library. KW - Probabilistic Robustness KW - Gas Network Control KW - Probabilistic Constrained Optimization KW - Stochastic Collocation KW - Kernel Density Estimation Y1 - 2025 ER - TY - INPR A1 - Strubberg, Lea A1 - Lutz, Annette A1 - Börner, Pascal A1 - Pfetsch, Marc A1 - Skutella, Martin A1 - Klimm, Max T1 - Valid Cuts for the Design of Potential-based Flow Networks N2 - The construction of a cost minimal network for flows obeying physical laws is an important problem for the design of electricity, water, hydrogen, and natural gas infrastructures. We formulate this problem as a mixed-integer non-linear program. Its non-convexity, due to the poten- tial flow, together with the binary variables, indicating the decision to build a connection, make these problems challenging to solve. We develop a novel class of valid inequalities on the fractional relaxations of the bi- nary variables. Further, we show that this class of inequalities can be sep- arated in polynomial for solutions to a fractional relaxation. This makes it possible to incorporate these inequalities into a branch-and-bound al- gorithm. The advantage of these inequalities is lastly demonstrated in a computational study on the design of real-world gas transport networks. KW - potential based flows KW - topology optimization KW - MINLP Y1 - 2025 ER - TY - INPR A1 - Breitkopf, Jannik A1 - Gugat, Martin A1 - Ulbrich, Stefan T1 - Existence and Optimal Boundary Control of Classical Solutions to Networks of Quasilinear Hyperbolic Systems of Balance Laws N2 - We study the existence, stability and optimal control of classical solutions of networked strictly hyperbolic systems of balance laws. Such networks arise, for instance, in the modeling of the gas dynamics in a network of gas pipelines, traffic networks, or networks of water channels. It is assumed that characteristic speeds are nonzero and do not change sign. Node conditions are stated in a general way by requiring that the boundary traces of all states adjacent to a vertex satisfy an algebraic equation. With a suitable assumption, this equation can be solved for outgoing characteristic variables as a function of the incoming ones. We prove the unique existence of a classical solution for arbitrarily large initial and boundary values on a possibly small time horizon. We derive continuity and differentiability properties of the solution operator of the quasilinear problem w.r.t. the control term located in the node conditions. Then we analyze an optimal control problem for the networked system, where the control is of boundary type. We prove the existence of optimal controls and the differentiability of the objective functional w.r.t. the controls. KW - networked systems, classical solutions, quasilinear hyperbolic systems, boundary control, conservation laws, nodal control, optimal nodal control Y1 - 2025 ER - TY - INPR A1 - Giesselmann, Jan A1 - Ranocha, Hendrik T1 - Convergence of hyperbolic approximations to higher-order PDEs for smooth solutions N2 - We prove the convergence of hyperbolic approximations for several classes of higher-order PDEs, including the Benjamin-Bona-Mahony, Korteweg-de Vries, Gardner, Kawahara, and Kuramoto-Sivashinsky equations, provided a smooth solution of the limiting problem exists. We only require weak (entropy) solutions of the hyperbolic approximations. Thereby, we provide a solid foundation for these approximations, which have been used in the literature without rigorous convergence analysis. We also present numerical results that support our theoretical findings. Y1 - 2025 ER - TY - INPR A1 - Breiten, Tobias A1 - Karsai, Attila A1 - Mehrmann, Volker A1 - Domschke, Pia A1 - Giesselmann, Jan A1 - Lang, Jens A1 - Tscherpel, Tabea A1 - Hiller, Benjamin A1 - Morandin, Riccardo A1 - Tischendorf, Caren T1 - A Catalog of Gas Network Models: PDEs, Coupling Conditions, and Numerical Schemes N2 - This document aims to provide a concise and clear introduction to the topic of gas flow modeling. We present several models for gas flow, organized into hierarchies based on complexity. We discuss in detail the modeling of individual components such as valves and compressors. Network model classes based on purely algebraic relations and energy-based port-Hamiltonian models are included, along with a brief overview of basic numerical methods for hyperbolic balance laws and port-Hamiltonian systems. We do not claim completeness and refer in many places to the existing literature. Y1 - N1 - This is an updated version of [P. Domschke, B. Hiller, J. Lang, V. Mehrmann, R. Morandin, and C. Tischendorf. Gas Network Modeling: An Overview. Preprint, TRR 154, 2021], available at: https://opus4.kobv.de/opus4-trr154/frontdoor/index/index/docId/411 ER - TY - INPR A1 - Brunk, Aaron A1 - Giesselmann, Jan A1 - Tscherpel, Tabea T1 - A posteriori existence of strong solutions to the Navier-Stokes equations in 3D N2 - Global existence of strong solutions to the three-dimensional incompressible Navier--Stokes equations remains an open problem. A posteriori existence results offer a way to rigorously verify the existence of strong solutions by ruling out blow-up on a certain time interval, using only numerical solutions. In this work we present such a result for the Navier--Stokes equations subject to periodic boundary conditions, which makes use of a version of the celebrated blow-up criterion in the critical space $L^\infty(L^3)$ by Iskauriaza, Serëgin and Shverak (2003). Our approach is based on a conditional stability estimate in $L^2$ and $L^3$. The a posteriori criterion that, if satisfied, verifies existence of strong solutions, involves only negative Sobolev norms of the residual. We apply the criterion to numerical approximations computed with mixed finite elements and an implicit Euler time discretisation. A posteriori error estimates allow us to derive a fully computable criterion without imposing any extra assumptions on the solution. While limited to short time intervals, with sufficient computational resources in principle the criterion might allow for a verification over longer time intervals than what can be achieved by theoretical means. KW - Navier-Stokes KW - blow-up KW - a posteriori estimates KW - critical space KW - reconstruction Y1 - ER - TY - JOUR A1 - Chaumet, Aidan A1 - Giesselmann, Jan T1 - Convergence Analysis of a Fully Discrete Observer for Data Assimilation of the Barotropic Euler Equations N2 - We study the convergence of a discrete Luenberger observer for the barotropic Euler equations in one dimension, for measurements of the velocity only. We use a mixed finite element method in space and implicit Euler integration in time. We use a modified relative energy technique to show an error bound comparing the discrete observer to the original system's solution. The bound is the sum of three parts: an exponentially decaying part, proportional to the difference in initial value, a part proportional to the grid sizes in space and time and a part that is proportional to the size of the measurement errors as well as the nudging parameter. The proportionality constants of the second and third parts are independent of time and grid sizes. To the best of our knowledge, this provides the first error estimate for a discrete observer for a quasilinear hyperbolic system, and implies uniform-in-time accuracy of the discrete observer for long-time simulations. KW - Data Assimilation KW - Observer KW - Relative Energy KW - Euler Equations KW - Fully Discrete Y1 - 2026 U6 - https://doi.org/10.48550/arXiv.2603.10962 ER - TY - JFULL A1 - Börner, Pascal A1 - Pfetsch, Marc E. A1 - Ulbrich, Stefan T1 - Mixing of Gases in Stationary Networks: Properties and Optimization N2 - This paper deals with the mixing of gases in stationary networks. We first derive a model and pressure law for mixing, for which there is empirical evidence for its accuracy. The model is based on the change of the speed of sound in gas mixtures. We then consider stationary gas networks. The existence result for solutions of single gas flow on networks is extended to mixtures. Further, we establish an easy to check criterion for uniqueness of solutions on the network. This results in a uniqueness proof of solutions on all networks with a mixture of natural gas and low hydrogen percentages. We then develop a solution algorithm that alternates between the solution of a single gas problem and update of the mixture ratios. In a computational study, different model variants and their impact on performance are compared. Moreover, the increased complexity of solving stationary gas transport problems with mixing is evaluated. KW - gas network optimization KW - gas mixing KW - MINLP KW - global optimization Y1 - ER -