SearcharxivSearch

arXiv subjects

Martin Siebenborn

Publications and source records attributed to Martin Siebenborn.

At least 19 recordsLinked to original sources

Shape optimization in $W^{1,\infty}$ with geometric constraints: a study in distributed-memory systems

In this paper we present a shape optimization scheme which utilizes the alternating direction method of multipliers (ADMM) to approximate a direction of steepest descent in $W^{1,\infty}$. The followed strategy is a combination of the approaches presented in Deckelnick, Herbert, and Hinze, ESAIM: COCV 28 (2022) and Müller et al. SIAM SISC 45 (2023). This has appeared previously for relatively simple elliptic PDEs with geometric constraints which were handled using an ad-hoc projection. Here, however, the optimization problem is expanded to include geometric constraints, which are systematically fulfilled. Moreover, this results in a nonlinear system of equations, which is challenging from a computational perspective. Simulations of a fluid dynamics case study are carried out to benchmark the novel method. Results are given to show that, compared to other methods, the proposed methodology allows for larger deformations without affecting the convergence of the used numerical methods. The mesh quality is studied across the surface of the optimized obstacle, and is further compared to previous approaches which used descents in $W^{p,\infty}$. The parallel scalability is tested on a distributed-memory system to illustrate the potential of the proposed techniques in a more complex, industrial setting.

math.OC

Towards computing high-order p-harmonic descent directions and their limits in shape optimization

We present an extension of an algorithm for the classical scalar $p$-Laplace Dirichlet problem to the vector-valued $p$-Laplacian with mixed boundary conditions in order to solve problems occurring in shape optimization using a $p$-harmonic approach. The main advantage of the proposed method is that no iteration over the order $p$ is required and thus allow the efficient computation of solutions for higher orders. We show that the required number of Newton iterations remains polynomial with respect to the number of grid points and validate the results by numerical experiments considering the deformation of shapes. Further, we discuss challenges arising when considering the limit of these problems from an analytical and numerical perspective, especially with respect to a change of sign in the source term.

math.OC

Application of p-Laplacian relaxed steepest descent to shape optimization in two-phase flows

The paper is concerned with the minimal drag problem in shape optimization of merchant ships exposed to turbulent two-phase flows. Attention is directed to the solution of Reynolds Averaged Navier-Stokes equations using a Finite Volume method. Central aspects are the use of a p-Laplacian relaxed steepest descent direction and the introduction of crucial technical constraints to the optimization procedure, i.e. the center of buoyancy and the displacement of the underwater hull. The example included refers to the frequently investigated Kriso container ship (KCS).

math.OC

A Scalable Algorithm for Shape Optimization with Geometric Constraints in Banach Spaces

This work develops an algorithm for PDE-constrained shape optimization based on Lipschitz transformations. Building on previous work in this field, the $p$-Laplace operator is utilized to approximate a descent method for Lipschitz shapes. In particular, it is shown how geometric constraints are algorithmically incorporated avoiding penalty terms by assigning them to the subproblem of finding a suitable descent direction. A special focus is placed on the scalability of the proposed methods for large scale parallel computers via the application of multigrid solvers. The preservation of mesh quality under large deformations, where shape singularities have to be smoothed or generated within the optimization process, is also discussed. It is shown that the interaction of hierarchically refined grids and shape optimization can be realized by the choice of appropriate descent directions. The performance of the proposed methods is demonstrated for energy dissipation minimization in fluid dynamics applications.

math.OC

Fluid dynamic shape optimization using self-adapting nonlinear extension operators with multigrid preconditioners

In this article we propose a scalable shape optimization algorithm which is tailored for large scale problems and geometries represented by hierarchically refined meshes. Weak scalability and grid independent convergence is achieved via a combination of multigrid schemes for the simulation of the PDEs and quasi Newton methods on the optimization side. For this purpose a self-adapting, nonlinear extension operator is proposed within the framework of the method of mappings. This operator is demonstrated to identify critical regions in the reference configuration where geometric singularities have to arise or vanish. Thereby the set of admissible transformations is adapted to the underlying shape optimization situation. The performance of the proposed method is demonstrated for the example of drag minimization of an obstacle within a stationary, incompressible Navier-Stokes flow.

math.OC

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

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

Mesh quality preserving shape optimization using nonlinear extension operators

In this article, we propose a shape optimization algorithm which is able to handle large deformations while maintaining a high level of mesh quality. Based on the method of mappings we introduce a nonlinear extension operator, which links a boundary control to domain deformations, ensuring admissibility of resulting shapes. The major focus is on comparisons between well-established approaches involving linear-elliptic operators for the extension and the effect of additional nonlinear advection on the set of reachable shapes. It is moreover discussed how the computational complexity of the proposed algorithm can be reduced. The benefit of the nonlinearity in the extension operator is substantiated by several numerical test cases of stationary, incompressible Navier-Stokes flows in 2d and 3d.

math.OC

A continuous perspective on modeling of shape optimal design problems

In this article we consider shape optimization problems as optimal control problems via the method of mappings. Instead of optimizing over a set of admissible shapes a reference domain is introduced and it is optimized over a set of admissible transformations. The focus is on the choice of the set of transformations, which we motivate from a function space perspective. In order to guarantee local injectivity of the admissible transformations we enrich the optimization problem by a nonlinear constraint. The approach requires no parameter tuning for the extension equation and can naturally be combined with geometric constraints on volume and barycenter of the shape. Numerical results for drag minimization of Stokes flow are presented.

math.OC

Parallel 3d shape optimization for cellular composites on large distributed-memory clusters

Skin modeling is an ongoing research area that highly benefits from modern parallel algorithms. This article aims at applying shape optimization to compute cell size and arrangement for elastic energy minimization of a cellular composite material model for the upper layer of the human skin. A gradient-penalized shape optimization algorithm is employed and tested on the distributed-memory cluster Hazel Hen, HLRS, Germany. The performance of the algorithm is studied in two benchmark tests. First, cell structures are optimized with respect to purely geometric aspects. The model is then extended such that the composite is optimized to withstand applied deformations. In both settings, the algorithm is investigated in terms of weak and strong scalability. The results for the geometric test reflect Kelvin's conjecture that the optimal space-filling design of cells with minimal surface is given by tetrakaidecahedrons. The PDE-constrained test case is chosen in order to demonstrate the influence of the deformation gradient penalization on fine inter-cellular channels in the composite and its influence on the multigrid convergence. A scaling study is presented for up to 12,288 cores and 3 billion DoFs.

physics.comp-ph

A shape optimization algorithm for cellular composites

We propose and investigate a mesh deformation technique for PDE constrained shape optimization. Introducing a gradient penalization to the inner product for linearized shape spaces, mesh degeneration can be prevented within the optimization iteration allowing for the scalability of employed solvers. We illustrate the approach by a shape optimization for cellular composites with respect to linear elastic energy under tension. The influence of the gradient penalization is evaluated and the parallel scalability of the approach demonstrated employing a geometric multigrid solver on hierarchically distributed meshes.

math.OC

A Multigrid Preconditioner for Tensor Product Spline Smoothing

Uni- and bivariate data smoothing with spline functions is a well established method in nonparametric regression analysis. The extension to multivariate data is straightforward, but suffers from exponentially increasing memory and computational complexity. Therefore, we consider a matrix-free implementation of a geometric multigrid preconditioned conjugate gradient method for the regularized least squares problem resulting from tensor product B-spline smoothing with multivariate and scattered data. The algorithm requires a moderate amount of memory and is therefore applicable also for high-dimensional data. Moreover, for arbitrary but fixed dimension, we achieve grid independent convergence which is fundamental to achieve algorithmic scalability.

math.NA

Optimum Experimental Design for Interface Identification Problems

The identification of the interface of an inclusion in a diffusion process is considered. This task is viewed as a parameter identification problem in which the parameter space bears the structure of a shape manifold. A corresponding optimum experimental design (OED) problem is formulated in which the activation pattern of an array of sensors in space and time serves as experimental condition. The goal is to improve the estimation precision within a certain subspace of the infinite dimensional tangent space of shape variations to the manifold, and to find those shape variations of best and worst identifiability. Numerical results for the OED problem obtained by a simplicial decomposition algorithm are presented.

math.OC

A shape optimization algorithm for interface identification allowing topological changes

In this work we investigate a combination of classical PDE constrained optimization methods and a rounding strategy based on shape optimization for the identification of interfaces. The goal is to identify radioactive regions in a groundwater flow represented by a control that is either active or inactive. We use a relaxation of the binary problem on a coarse grid as initial guess for the shape optimization with higher resolution. The result is a computationally cheap method that does not have to perform large shape deformations. We demonstrate that our algorithm is moreover able to change the topology of the initial guess.

math.OC

Algorithmic aspects of multigrid methods for optimization in shape spaces

We examine the interaction of multigrid methods and shape optimization in appropriate shape spaces. Our aim is a scalable algorithm for application on supercomputers, which can only be achieved by mesh-independent convergence. The impact of discrete approximations of geometrical quantities, like the mean curvature, on a multigrid shape optimization algorithm with quasi-Newton updates is investigated. For the purpose of illustration, we consider a complex model for the identification of cellular structures in biology with minimal compliance in terms of elasticity and diffusion equations.

math.OC

Efficient PDE constrained shape optimization based on Steklov-Poincaré type metrics

Recent progress in PDE constrained optimization on shape manifolds is based on the Hadamard form of shape derivatives, i.e., in the form of integrals at the boundary of the shape under investigation, as well as on intrinsic shape metrics. From a numerical point of view, domain integral forms of shape derivatives seem promising, which rather require an outer metric on the domain surrounding the shape boundary. This paper tries to harmonize both points of view by employing a Steklov-Poincaré type intrinsic metric, which is derived from an outer metric. Based on this metric, efficient shape optimization algorithms are proposed, which also reduce the analytical labor, so far involved in the derivation of shape derivatives.

math.OC

Computational comparison of surface metrics for PDE constrained shape optimization

We compare surface metrics for shape optimization problems with constraints, consisting mainly of partial differential equations (PDE), from a computational point of view. In particular, classical Laplace-Beltrami type based metrics are compared with Steklov-Poincaré type metrics. The test problem is the minimization of energy dissipation of a body in a Stokes flow. We therefore set up a quasi-Newton method on appropriate shape manifolds together with an augmented Lagrangian framework, in order to enable a straightforward integration of geometric constraints for the shape. The comparison is focussed towards convergence behavior as well as effects on the mesh quality during shape optimization.

math.OC

Structured inverse modeling in parabolic diffusion processess

Often, the unknown diffusivity in diffusive processes is structured by piecewise constant patches. This paper is devoted to efficient methods for the determination of such structured diffusion parameters by exploiting shape calculus. A novel shape gradient is derived in parabolic processes. Furthermore quasi-Newton techniques are used in order to accelerate shape gradient based iterations in shape space. Numerical investigations support the theoretical results.

math.OC