Tootfinder

Was kann man noch alles so mit den Rohdaten des Marktstammdatenregisters machen?
Man kann berechnen, wie viele #Balkonkraftwerke pro Jahr gebaut wurden.
#Balkonsolar #Solarenergie

UK price inflation was 30% below the US in 2021 because of energy excises https://www.sciencedirect.com/science/article/pii/S0140988325004402 @…

Zubau (netto) der Leistung von Balkonkraftwerken in #Deutschland.
Hoffe, es stimmt. Wer Langeweile hat, kann ja mal nachrechnen. 😆

#Balkonsolar #Energiewende

Convergence of adaptive boundary element methods driven by functional a posteriori error estimates
Alexander Freiszlinger, Dirk Pauly, Dirk Praetorius
https://arxiv.org/abs/2506.10499

Convergence of adaptive boundary element methods driven by functional a posteriori error estimates
The recent work [Kurz et al., Numer. Math., 147 (2021)] proposed functional a posteriori error estimates for boundary element methods (BEMs) together with a related adaptive mesh-refinement strategy. Unlike most a posteriori BEM error estimators, the proposed functional error estimators cover Galerkin as well as collocation BEM and, more importantly, do not control the error in the integral density on the boundary, but the error of the potential approximation in the domain, which is of greater …

Hab bisschen mit 17 GB #MStR-Daten rumgespielt.
Kann das mal jemand nachrechnen? 🤔 🤪
#Balkonkraftwerk #Photovoltaik

from my link log —
Faster remainder by multiplication, with applications to compilers and software libraries.
https://arxiv.org/abs/1902.01961
saved 2021-05-23

Faster Remainder by Direct Computation: Applications to Compilers and Software Libraries
On common processors, integer multiplication is many times faster than integer division. Dividing a numerator n by a divisor d is mathematically equivalent to multiplication by the inverse of the divisor (n / d = n x 1/d). If the divisor is known in advance---or if repeated integer divisions will be performed with the same divisor---it can be beneficial to substitute a less costly multiplication for an expensive division. Currently, the remainder of the division by a constant is computed from…

Finite $s$-geodesic transitive graphs under certain girths
Jun-Jie Huang
https://arxiv.org/abs/2506.05803 https://arxiv.org/pdf/2506.…

Finite $s$-geodesic transitive graphs under certain girths
For an integer $s\geq1$ and a graph $Γ$, a path $(u_0, u_1, \ldots, u_{s})$ of vertices of $Γ$ is called an {\em $s$-geodesic} if it is a shortest path from $u_0$ to $u_{s}$. We say that $Γ$ is {\em $s$-geodesic transitive} if, for each $i\leq s$, $Γ$ has at least one $i$-geodesic, and its automorphism group is transitive on the set of $i$-geodesics. In 2021, Jin and Praeger [J. Combin. Theory Ser. A 178 (2021) 105349] have studied $3$-geodesic transitive graphs of girth $5$ or $6$, and the…