Searcharxiv⌕ Search

arXiv subjects

Michael Hinze

Publications and source records attributed to Michael Hinze.

At least 19 recordsLinked to original sources
arXiv2026

Combining diffuse and sharp interface methods in shape optimisation

We develop a concept for the numerical treatment of shape optimization problems based on the combination of phase field and sharp interface methods. On the one hand, phase field methods are very well suited to numerically determine the shape, size and topology of a sought domain, but on the other hand they have problems to sharpen out domains where they e.g. should develop corners. However, this is the strength of a sharp-interface approach developed in our group, which provides shape updates in the Lipschitz topology. This leads to a two-stage process that first determines an optimized shape using the phase field method. The resulting domain is the starting solution for the sharp interface shape optimization method. Both methods are discretized with the finite element method. The starting mesh for the sharp method is constructed from the finite element mesh of the optimal phase field solution using its properly post processed zero-level set. We describe this construction process in detail and investigate the performance of our method on a selection of test problems from the literature and from applications.

math.OC↗
arXiv2026

A reduced basis method for parabolic PDEs based on a space-time least squares formulation

In this work, we present a POD-greedy reduced basis method for parabolic partial differential equations (PDEs), based on the least squares space-time formulation proposed in [Hinze, Kahle, Stahl, A least-squares space-time approach for parabolic equations, 2023, arXiv:2305.03402] that assumes only minimal regularity. We extend this approach to the parameter-dependent case. The corresponding variational formulation then is based on a parameter-dependent, symmetric, uniformly coercive, and continuous bilinear form. We apply the reduced basis method to this formulation, following the well-developed techniques for parameterized coercive problems, as seen e.g. in reduced basis methods for parameterized elliptic PDEs. We present an offline-online decomposition and provide certification with absolute and relative error bounds. The performance of the method is demonstrated using selected numerical examples.

math.NA↗
arXiv2026

A Local Discontinuous Galerkin Method for Dirichlet Boundary Control Problems

In this paper, we consider control constrained $L^2-$Dirichlet boundary control of a convection-diffusion equation on a two dimensional convex polygonal domain. We discretize the control problem based on the local discontinuous Galerkin method with piecewise linear ansatz functions for the flux and potential. We derive a priori error estimates for the full as well as for the variational discrete control approximation. We present a selection of numerical results to demonstrate the performance of our approach and to underpin the theoretical findings.

math.OC↗
arXiv2026

Long-time behavior of solutions to a fluid dynamic shape optimization problem via phase-field method

We investigate the long time behavior of solutions to a shape and topology optimization problem with respect to the time-dependent Navier--Stokes equations. The sought topology is represented by a stationary phase-field that represents a smooth indicator function. The fluid equations are approximated by a porous media approach and are time-dependent. In the latter aspect, the considered problem formulation extends earlier work. We prove that if the time horizon tends to infinity, minima of the time-dependent problem converge towards minima of the corresponding stationary problem. To do so, a convergence rate with respect to the time horizon, of the values of the objective functional, is analytically derived. This allowed us to prove that the solution to the time-dependent problem converges to a phase-field, as the time horizon goes to infinity, which is proven to be a minimizer for the stationary problem. We validate our results by numerical investigation.

math.OC↗
arXiv2026

Layerwise goal-oriented adaptivity for neural ODEs: an optimal control perspective

In this work, we propose a novel layerwise adaptive construction method for neural network architectures. Our approach is based on a goal--oriented dual-weighted residual technique for the optimal control of neural differential equations. This leads to an ordinary differential equation constrained optimization problem with controls acting as coefficients and a specific loss function. We implement our approach on the basis of a DG(0) Galerkin discretization of the neural ODE, leading to an explicit Euler time marching scheme. The resulting optimization problem is solved using the Adam algorithm and a BFGS method adapted to the $H^1$ topology induced by the regularization term. Finally, we apply our method to the construction of neural networks for the classification of data sets, where we present results for a selection of well known examples from the literature.

math.OC↗
arXiv2025

A least-squares space-time approach for parabolic equations

We propose a least squares formulation for abstract parabolic equations in the natural $L^2(0,T;V^\star)\times H$ norm which only relies on natural regularity assumptions on the data of the problem. The resulting bilinear form then is symmetric, coercive and continuous. We provide two space-time Galerkin frameworks for the numerical approximation. The first one uses a conformal discretization of the underlying bilinear system and relies on the fact that the $V^*-$norm of basis functions can be evaluated exactly. The second approach is nonconforming an replaces the evaluation of the $V^*-$norm by a discrete pendant. We prove convergence for both approaches and illustrate our analytical findings by selected numerical experiments.

math.NA↗
arXiv2023

PDE constrained shape optimisation with first-order and Newton-type methods in the $W^{1,\infty}$ topology

We present a general shape optimisation framework based on the method of mappings in the $W^{1,\infty}$ topology. We propose steepest descent and Newton-like minimisation algorithms for the numerical solution of the respective shape optimisation problems. Our work is built upon previous work of the authors in (Deckelnick, Herbert, and Hinze, ESAIM: COCV 28 (2022)), where a $W^{1,\infty}$ framework for star-shaped domains is proposed. To illustrate our approach we present a selection of PDE constrained shape optimisation problems and compare our findings to results from so far classical Hilbert space methods and recent $p$-approximations.

math.OC↗
arXiv2023

Convergence of a steepest descent algorithm in shape optimisation using $W^{1,\infty}$ functions

Built upon previous work of the authors in (Deckelnick, Herbert, and Hinze, ESAIM: COCV 28 (2022)), we present a general shape optimisation framework based on the method of mappings in the $W^{1,\infty}$ topology together with a suitable finite element discretisation. For the numerical solution of the respective discrete shape optimisation problems we propose a steepest descent minimisation algorithm with Armijo-Goldstein stepsize rule. We show that the sequence generated by this descent method globally converges, and under mild assumptions also, that every accumulation point of this sequence is a stationary point of the shape functional. Moreover, for the mesh discretisation parameter tending to zero we under mild assumptions prove convergence of the discrete stationary shapes in the Hausdorff complementary metric. To illustrate our approach we present a selection of numerical examples for PDE constrained shape optimisation problems, where we include numerical convergence studies which support our analytical findings.

math.NA↗
arXiv2023

An Incremental Singular Value Decomposition Approach for Large-Scale Spatially Parallel & Distributed but Temporally Serial Data -- Applied to Technical Flows

The paper presents a strategy to construct an incremental Singular Value Decomposition (SVD) for time-evolving, spatially 3D discrete data sets. A low memory access procedure for reducing and deploying the snapshot data is presented. Considered examples refer to Computational Fluid Dynamic (CFD) results extracted from unsteady flow simulations, which are computed spatially parallel using domain decomposition strategies. The framework addresses state of the art PDE-solvers dedicated to practical applications. Although the approach is applied to technical flows, it is applicable in similar applications under the umbrella of Computational Science and Engineering (CSE). To this end, we introduce a bunch matrix that allows the aggregation of multiple time steps and SVD updates, and significantly increases the computational efficiency. The incremental SVD strategy is initially verified and validated by simulating the 2D laminar single-phase flow around a circular cylinder. Subsequent studies analyze the proposed strategy for a 2D submerged hydrofoil located in turbulent two-phase flows. Attention is directed to the accuracy of the SVD-based reconstruction based on local and global flow quantities, their physical realizability, the independence of the domain partitioning, and related implementation aspects. Moreover, the influence of lower and (adaptive) upper construction rank thresholds on both the effort and the accuracy are assessed. The incremental SVD process is applied to analyze and compress the predicted flow field around a Kriso container ship in harmonic head waves at Fn = 0.26 and ReL = 1.4E+07. With a numerical overhead of O(10%), the snapshot matrix of size O(R10E+08 x 10E+04) computed on approximately 3000 processors can be incrementally compressed by O(95%). The storage reduction is accompanied by errors in integral force and local wave elevation quantities of O(1E-02%).

cs.MS↗
arXiv2022

Two-Phase Flow Simulations of Surface Waves in Wind-Forced Conditions

The paper is devoted to two-phase flow simulations and investigates the ability of a diffusive interface Cahn-Hilliard Volume-of-Fluid model to capture the dynamics of the air-sea interface at geophysically relevant Reynolds numbers. It employs a hybrid filtered/averaging Improved Detached Eddy Simulation method to model turbulence, and utilizes a continuum model to account for surface tension if the diffuse interface is under-resolved by the grid. A numerical wind-wave tank is introduced to limit computational costs and results obtained for two wind-wave conditions are analyzed in comparison to experimental data at matched Reynolds numbers. The focus of the comparison is on both time-averaged and wave-coherent quantities, and includes pressure, velocity as well as modeled and resolved Reynolds stresses. In general, numerical predictions agree well with the experimental measurements and reproduce many wave-dependent flow features. Reynolds stresses near the water surface are found to be especially important in modulating the critical layer height. It is concluded that the diffusive interface approach proves to be a promising method for future studies of air-sea interface dynamics in geophysically relevant flows.

physics.flu-dyn↗
arXiv2022

Variational discretization of one-dimensional elliptic optimal control problems with BV functions based on the mixed formulation

We consider optimal control of an elliptic two-point boundary value problem governed by functions of bounded variation (BV). The cost functional is composed of a tracking term for the state and the BV-seminorm of the control. We use the mixed formulation for the state equation together with the variational discretization approach, where we use the classical lowest order Raviart-Thomas finite elements for the state equation. Consequently the variational discrete control is a piecewise constant function over the finite element grid. We prove error estimates for the variational discretization approach in combination with the mixed formulation of the state equation and confirm our analytical findings with numerical experiments.

math.OC↗
arXiv2021

A novel $W^{1,\infty}$ approach to shape optimisation with Lipschitz domains

This article introduces a novel method for the implementation of shape optimisation with Lipschitz domains. We propose to use the shape derivative to determine deformation fields which represent steepest descent directions of the shape functional in the $W^{1,\infty}-$ topology. The idea of our approach is demonstrated for shape optimisation of $n$-dimensional star-shaped domains, which we represent as functions defined on the unit $(n-1)$-sphere. In this setting we provide the specific form of the shape derivative and prove the existence of solutions to the underlying shape optimisation problem. Moreover, we show the existence of a direction of steepest descent in the $W^{1,\infty}-$ topology. We also note that shape optimisation in this context is closely related to the $\infty-$Laplacian, and to optimal transport, where we highlight the latter in the numerics section. We present several numerical experiments in two dimensions illustrating that our approach seems to be superior over a widely used Hilbert space method in the considered examples, in particular in developing optimised shapes with corners.

math.OC↗
arXiv2021

A Novel $p$-Harmonic Descent Approach Applied to Fluid Dynamic Shape Optimization

We introduce a novel method for the implementation of shape optimziation in fluid dynamics applications, where we propose to use the shape derivative to determine deformation fields with the help of the $p-$ Laplacian for $p > 2$. This approach is closely related to the computation of steepest descent directions of the shape functional in the $W^{1,\infty}-$ topology. Our approach is demonstrated for shape optimization related to drag-minimal free floating bodies. The method is validated against existing approaches with respect to convergence of the optimization algorithm, the obtained shape, and regarding the quality of the computational grid after large deformations. Our numerical results strongly indicate that shape optimization related to the $W^{1,\infty}$-topology -- though numerically more demanding -- seems to be superior over the classical approaches invoking Hilbert space methods, concerning the convergence, the obtained shapes and the mesh quality after large deformations, in particular when the optimal shape features sharp corners.

math.OC↗
arXiv2021

Time adaptivity in model predictive control

The core of the Model Predictive Control (MPC) method in every step of the algorithm consists in solving a time-dependent optimization problem on the prediction horizon of the MPC algorithm, and then to apply a portion of the optimal control over the application horizon to obtain the new state. To solve this problem efficiently, we propose a time-adaptive residual a-posteriori error control concept based on the optimality system of this optimal control problem. This approach not only delivers a tailored time discretization of the the prediction horizon, but also suggests a tailored length of the application horizon for the current MPC step. We apply this concept for systems governed by linear parabolic PDEs and present several numerical examples which demonstrate the performance and the robustness of our adaptive MPC control concept.

math.OC↗
arXiv2020

A space-time certified reduced basis method for quasilinear parabolic partial differential equations

In this paper, we propose a certified reduced basis (RB) method for quasilinear parabolic problems. The method is based on a space-time variational formulation. We provide a residual-based a-posteriori error bound on a space-time level and the corresponding efficiently computable estimator for the certification of the method. We use the Empirical Interpolation method (EIM) to guarantee the efficient offline-online computational procedure. The error of the EIM method is then rigorously incorporated into the certification procedure. The Petrov-Galerkin finite element discretization allows to benefit from the Crank-Nicolson interpretation of the discrete problem and to use a POD-Greedy approach to construct the reduced-basis spaces of small dimensions. It computes the reduced basis solution in a time-marching framework while the RB approximation error in a space-time norm is controlled by the estimator. Therefore the proposed method incorporates a POD-Greedy approximation into a space-time certification.

math.NA↗
arXiv2020

Adjoint Complement to the Volume-of-Fluid Method for Immiscible Flows

The paper is concerned with an adjoint complement to the Volume-of-Fluid (VoF) method for immiscible two-phase flows, e.g. air and water, which is widely used in marine engineering due to its computational efficiency. The particular challenge of the primal and the corresponding adjoint VoF-approach refers to the sharp interface treatment featuring discontinuous physical properties. Both the continuous adjoint two-phase system (integration-by-parts) and the corresponding dual compressive convection schemes (summation-by-parts) are derived for two prominent compressive convection schemes, namely the High Resolution Interface Capturing Scheme (HRIC) and Compressive Interface Capturing Scheme for Arbitrary Meshes (CICSAM). The dual scheme rigorously mirrors the primal Normalized-Variable-Diagram (NVD) stencils. Attention is restricted to steady state applications. Thus both the primal and the dual procedures are performed in pseudo time and the backward integration of the dual approach is performed around the (pseudo-temporal) converged primal field. The paper analyses the primal and adjoint equations for an engineering model problem. An analytical solution to the model problem is initially presented, which displays that the adjoint part does not offer a unique, non-trivial solution. As a remedy, an additional diffusive concentration term is introduced to the adjoint concentration equation. Numerical results obtained from the modified approach are benchmarked against the analytical solution for the model problem. Supplementary, the influence of the modification on the sensitivities obtained from simulations for the two-dimensional flow around a submerged hydrofoil are discussed. The final application refers to a shape-optimization of a generic 3D underwater vehicle and underlines a negligible influence of the free mobility parameter.

physics.flu-dyn↗
arXiv2020

Variational discretization approach applied to an optimal control problem with bounded measure controls

We consider a parabolic optimal control problem with an initial measure control. The cost functional consists of a tracking term corresponding to the observation of the state at final time. Instead of a regularization term in the cost functional, we follow an approach by E. Casas and K. Kunisch and consider a bound on the measure norm of the initial control. The variational discretization of the problem together with the optimality conditions induce maximal discrete sparsity of the initial control, i.e. Dirac measures in space. We present numerical experiments to illustrate our approach.

math.OC↗