Searcharxiv⌕ Search

arXiv subjects

Simon Pfeil

Publications and source records attributed to Simon Pfeil.

2 recordsLinked to original sources

Skew Zero Forcing Matroids

Matroid theory and skew zero forcing (SZF) in graphs are both topics of mathematical interest, but very little is known about their overlap. When a matroid arises from a graph in the traditional way, the edges of the graph correspond with the elements of the matroid. However, the SZF color change rule for graphs can be viewed as a closure operator on the vertices of a graph. As such, when a matroid arises from a graph via SZF, the vertices of the graph correspond with the elements of the matroid. We call such a matroid SZF-realizable. Notably, unlike the traditional method of obtaining a matroid from a graph, skew zero forcing in a graph does not always give rise to a matroid. This paper establishes fundamental results in graph and matroid theory with respect to (1) which matroids are SZF-realizable, and (2) what kinds of graphs do and do not give rise to SZF matroids. The main result of the paper focuses on cycle matroids of outerplanar graphs.

math.CO↗

Stabilized finite elements for the solution of the Reynolds equation considering cavitation

The Reynolds equation, combined with the Elrod algorithm for including the effect of cavitation, resembles a nonlinear convection-diffusion-reaction (CDR) equation. Its solution by finite elements is prone to oscillations in convection-dominated regions, which are present whenever cavitation occurs. We propose a stabilized finite-element method that is based on the variational multiscale method and exploits the concept of orthogonal subgrid scales. We demonstrate that this approach only requires one additional term in the weak form to obtain a stable method that converges optimally when performing mesh refinement.

math.NA↗