arXiv subjects

Maximilian Köhler

Publications and source records attributed to Maximilian Köhler.

5 recordsLinked to original sources

arXiv2026

Efficient Quantile-Resolved Hosting Capacity Assessment on Nodal Level for Low-Voltage Grids

Hosting capacity - the maximum additional capacity a network can accommodate without violating operational limits - is a key metric in distribution system planning and operation. Decisions on grid reinforcements and the deployment of flexibility management require not only the worst-case HC but also an understanding of the distribution of HC under different likelihoods in load and generation patterns. Quantile-resolved HC distributions provide this view by expressing HC as a function of an acceptable operational limit exceedance likelihood. Monte Carlo sampling is the established approach for computing such distributions but demands large computational resources. Approximations sacrifice either accuracy, the ability to capture uncertainty correlations, or scalability when assessing real-world networks. This paper introduces a computationally efficient method for calculating distributions for quantile-resolved HC. It uses a representation of load samples as multivariate normal distribution, propagated through a linearized power flow model. This allows for leveraging a re-parametrized AC-OPF problem for each hosting capacity quantile. Benchmarking against Monte Carlo-based methods on realistic LV networks demonstrates that the proposed method achieves comparable accuracy with a mean deviation of approx. 3%, while reducing computational time by orders of magnitude. For the exemplary networks the computational time decreases from 11 min to 2 s, and 38 h to 50 s, respectively. The method's scalability is also suitable for recalculation in 15-minute cycles encountered in DSO practice for e.g., real-time grid management.

eess.SY↗

arXiv2025

Quasiconvex relaxation of planar Biot-type energies and the role of determinant constraints

We derive the quasiconvex relaxation of the Biot-type energy density $\lVert\sqrt{\operatorname{D}φ^T \operatorname{D}φ}-I_2\rVert^2$ for planar mappings $φ\colon\mathbb{R}^2\to \mathbb{R}^2$ in two different scenarios. First, we consider the case $\operatorname{D}φ\in\textrm{GL}^+(2)$, in which the energy can be expressed as the squared Euclidean distance $\operatorname{dist}^2(\operatorname{D}φ,\textrm{SO}(2))$ to the special orthogonal group $\textrm{SO}(2)$. We then allow for planar mappings with arbitrary $\operatorname{D}φ\in\mathbb{R}^{2\times 2}$; in the context of solid mechanics, this lack of determinant constraints on the deformation gradient would allow for self-interpenetration of matter. We demonstrate that the two resulting relaxations do not coincide and compare the analytical findings to numerical results for different relaxation approaches, including a rank-one sequential lamination algorithm, trust-region FEM calculations of representative microstructures and physics-informed neural networks.

math.AP↗

arXiv2024

Hierarchical Rank-One Sequence Convexification for the Relaxation of Variational Problems with Microstructures

This paper presents an efficient algorithm for the approximation of the rank-one convex hull in the context of nonlinear solid mechanics. It is based on hierarchical rank-one sequences and simultaneously provides first and second derivative information essential for the calculation of mechanical stresses and the computational minimization of discretized energies. For materials, whose microstructure can be well approximated in terms of laminates and where each laminate stage achieves energetic optimality with respect to the current stage, the approximate envelope coincides with the rank-one convex envelope. Although the proposed method provides only an upper bound for the rank-one convex hull, a careful examination of the resulting constraints shows a decent applicability in mechanical problems. Various aspects of the algorithm are discussed, including the restoration of rotational invariance, microstructure reconstruction, comparisons with other semi-convexification algorithms, and mesh independency. Overall, this paper demonstrates the efficiency of the algorithm for both, well-established mathematical benchmark problems as well as nonconvex isotropic finite-strain continuum damage models in two and three dimensions. Thereby, for the first time, a feasible concurrent numerical relaxation is established for an incremental, dissipative large-strain model with relevant applications in engineering problems.

cs.CE↗

arXiv2023

Multidimensional rank-one convexification of incremental damage models at finite strains

This paper presents computationally feasible rank-one relaxation algorithms for the efficient simulation of a time-incremental damage model with nonconvex incremental stress potentials in multiple spatial dimensions. While the standard model suffers from numerical issues due to the lack of convexity, the relaxation by rank-one convexification prevents non-existence of minimizers and mesh dependence of the solutions of finite element discretizations. By the combination, modification and parallelization of the underlying convexification algorithms, the novel approach becomes computationally feasible. A descent method and a Newton scheme enhanced by step-size control prevent stability issues related to local minima in the energy landscape and the computation of derivatives. Numerical techniques for the construction of continuous derivatives of the approximated rank-one convex envelope are discussed. A series of numerical experiments demonstrates the ability of the computationally relaxed model to capture softening effects and the mesh independence of the computed approximations. An interpretation in terms of microstructural damage evolution is given, based on the rank-one lamination process.

cs.CE↗

arXiv2022

Evolving Microstructures in Relaxed Continuum Damage Mechanics for Strain Softening

A new relaxation approach is proposed which allows for the description of stress- and strain-softening at finite strains. The model is based on the construction of a convex hull replacing the originally non-convex incremental stress potential which in turn represents damage in terms of the classical $(1-D)$ approach. This convex hull is given as the linear convex combination of weakly and strongly damaged phases and thus, it represents the homogenization of a microstructure bifurcated in the two phases. As a result thereof, damage evolves in the convexified regime mainly by an increasing volume fraction of the strongly damaged phase. In contrast to previous relaxed incremental formulations in Gürses and Miehe [16] and Balzani and Ortiz [2], where the convex hull has been kept fixated after construction, here, the strongly damaged phase is allowed to elastically unload upon further loading. At the same time, its volume fraction increases nonlinearly within the convexified regime. Thus, strain-softening in the sense of a decreasing stress with increasing strain can be modeled. The major advantage of the proposed approach is that it ensures mesh-independent structural simulations without the requirement of additional length-scale related parameters or nonlocal quantities, which simplifies an implementation using classical material subroutine interfaces. In this paper, focus is on the relaxation of one-dimensional models for fiber damage which are combined with a microsphere approach to allow for the description of three-dimensional fiber dispersions appearing in fibrous materials such as soft biological tissues. Several numerical examples are analyzed to show the overall response of the model and the mesh-independence of resulting structural calculations.

cs.CE↗