SearcharxivSearch

arXiv subjects

Bernhard Klaassen

Publications and source records attributed to Bernhard Klaassen.

6 recordsLinked to original sources

Accelerating gas-network feasibility screening with a physics-informed graph neural network surrogate

Large-scale gas-network scenario evaluation is a computational bottleneck in integrated energy-system planning, particularly when gas infrastructure interacts with power, heat, hydrogen, and sector-coupling pathways. Conventional nonlinear hydraulic solvers provide reliable feasibility assessment but are costly for stochastic screening, whereas unconstrained learning-based surrogates may produce hydraulically infeasible states. This study develops a physics-informed graph neural network surrogate for steady-state gas-network simulation and feasibility screening. The model uses an edge-centric architecture to predict pipe-level squared-pressure differences and flows. A differentiable projection layer enforces nodal mass conservation on predicted flows, while a Laplacian reconstruction maps edge pressure differences to topologically consistent nodal pressures. The framework is evaluated on GasLib-134, GasLib-135, and GasLib-582 using stochastically generated operating scenarios. On the meshed 582-node benchmark trained with 5000 scenarios, the surrogate achieves a pressure mean absolute error of 1.05~bar, corresponding to 1.3\% of the realized pressure range, with $R^2 = 0.981$. Projected-flow predictions reach $R^2 = 0.972$, and mass-balance residuals are reduced to numerical precision, on the order of $10^{-5}$--$10^{-4}$~Nm$^3$/s. Compared with the MYNTS reference solver, inference is reduced from seconds to milliseconds, with the largest benchmark evaluated in less than 40~ms. Loadability and out-of-distribution stress-test evaluations demonstrate robust feasibility screening under high-load conditions, while strongly localized demand concentrations are identified as cases requiring solver-based verification near feasibility limits. The framework provides a physically constrained planning accelerator for high-volume scenario screening and prioritization.

cs.CE

From carbon management strategies to implementation: Modeling and physical simulation of CO2 pipeline infrastructure -- a case study for Germany

Carbon capture and storage or utilization (CCUS) will play an important role to achieve climate neutrality in many economies. Pipelines are widely regarded as the most efficient means of CO2 transport; however, they are currently non-existent. Policy-makers and companies need to develop large-scale infrastructure under substantial uncertainty. Methods and analyses are needed to support pipeline planning and strategy development. This paper presents an integrated method for designing CO2 pipeline networks by combining energy system scenarios with physical network simulation. Using Germany as a case study in a projection to the year 2045, we derive spatially highly resolved CO2 balances to develop a dense-phase CO2 pipeline topology that follows existing gas pipeline corridors. The analyzed system includes existing sites for cement and lime production, waste incineration, carbon users, four coastal CO2 hubs, and border crossing points. We then apply the multiphysical network simulator MYNTS to assess the technical feasibility of this network. We determine pipeline diameters, pump locations, and operating conditions that ensure stable dense-phase transport. The method explicitly accounts for elevation and possible impurities.The results indicate that a system of about 7000 km pipeline length and a mixed normed diameter of DN700 on main corridors and of DN500/DN400 on branches presents a feasible solution to connect most sites. Investment costs for the optimized pipeline system are calculated to be about 17 billion Euros. The method provides a reproducible framework and is transferable to other countries and to European scope.

math.OC

Old problem revisited: Which equilateral convex polygons tile the plane?

We present a simplified proof of a forty-year-old result concerning the tiling of the plane with equilateral convex polygons. Our approach is based on a theorem by M. Rao, who used an exhaustive computer search to confirm the completeness of the well-known list of fifteen pentagon types. Assuming the validity of Rao's result, we provide a concise and mainly geometric proof of a tiling theorem originally due to Hirschhorn and Hunt. Finally, a possible connection to quasicrystals is sketched.

math.MG

Forcing nonperiodic tilings with one tile using a seed

The so-called "einstein problem" (a pun playing with the famous scientist's name and the German term "ein Stein" for "one stone") asks for a simply connected prototile only allowing nonperiodic tilings without need of any matching rule. So far, researchers come only close to this demand by defining decorated prototiles forcing nonperiodicity of any generated tiling using matching rules. In this paper a class of spiral tilings (and one non-spiral example) is linked to a weaker form of the einstein problem where one or several seed tiles are used. Furthermore, the classical types of matching rules are listed and some new types are discussed.

math.MG

Is the spiral effect psychological?

In 2017 a definition of spiral tilings was given, thereby answering a question posed by Grünbaum and Shephard in the late 1970s. The author had the pleasure to discuss the topic via e-mail with Branko Grünbaum in his 87th year. During this correspondence the question arose whether a spiral structure (given a certain definition of it) could be recognized automatically or whether "to some extent, at least, the spiral effect is psychological", as Grünbaum and Shephard had conjectured in 1987 (see exercise section of chapter 9.5 in "Tilings and Patterns"). In this paper, an algorithm for automatic detection of such a tiling's spiral structure and its first implementation results will be discussed. Finally, the definitions for several types of spiral tilings are refined based on this investigation.

math.MG

Rotationally Symmetric Tilings with Convex Pentagons and Hexagons

In contrast to many known results concerning periodic tilings of the Euclidean plane with pentagons, here tilings with rotational symmetry are investigated. A certain class of convex pentagons is introduced. It can be shown that for any given symmetry type $\mathbf{C}_{n}$ or $\mathbf{D}_{n}$ there exists a monohedral tiling generated by a pentagon from this class. For $n>1$ each of these tilings is also a spiral tiling with $n$ arms. As a byproduct it follows that the same holds for convex hexagons.

math.MG