SearcharxivSearch

arXiv subjects

Lukas Novak

Publications and source records attributed to Lukas Novak.

6 recordsLinked to original sources

Uncertainty Quantification of Engineering Structures by Polynomial Chaos Expansion and Multivariate Active Learning

In many engineering applications, a single high-fidelity model produces multiple quantities of interest (QoIs) under the same input parameters, e.g. finite element models of complex physical systems. To alleviate the high computational cost of direct model evaluations, surrogate models are widely used to construct efficient approximations of model responses. Naturally, the accuracy of surrogates strongly depends on the quality of the experimental design (ED). However, a single ED may not provide an adequate representation for all outputs simultaneously, especially when different outputs exhibit varying sensitivities to the input variables. A straightforward solution is to perform separate sampling for each output, but this results in increased sampling complexity and computational cost. From a statistical perspective, such an approach also ignores potential correlations among all outputs and may compromise data consistency. To address this issue, an adaptive sequential sampling method for constructing polynomial chaos expansion surrogate models is generalized for vector valued QoIs. The method sequentially selects new samples from a candidate pool based on their local contribution to the output variance, while balancing distance-based exploration of the input space and exploitation of aggregated variance information across all outputs. Its performance is compared with non-sequential Latin Hypercube Sampling through several numerical examples from engineering problems. Numerical results demonstrate that the proposed strategy improves both surrogate accuracy and stability, and provides a more reliable estimation of second-order statistics.

cs.LG

Twists arising from torsion points

Let $p$ be a prime number, $K$ a number field that contains the $p$-th root of unity $\zeta_p$, $d$ a $p$-power-free integer and $L=K(\sqrt[p]{d})$. Let $E/K$ be an elliptic curve with full $p$-torsion and $S,T \in E(K)[p]$ be the generators. Define the cocycle $\xi_d : \operatorname{Gal}(\overline{K}/K) \to E$ by \[ \xi_d (\sigma)= \begin{cases} O, & \text{if } \sigma(\sqrt[p]{d})=\sqrt[p]{d}, \newline kS, & \text{if } \sigma(\sqrt[p]{d})=\zeta_p^k\sqrt[p]{d}, \end{cases} \] and denote by $H_S^d$ the twist of $E$ corresponding to the cocycle $\xi_d$. In this paper we construct generators $z$ and $w$ of the function field $K(H_S^d)$ and give a model of the twist \[ H_S^d\,:\, \alpha_{1}z^p+\alpha_2z^{p-2}w+\dotso+\alpha_{\frac{p+1}{2}}zw^{\frac{p-1}{2}}+\beta w^p+\gamma=0.\] We also obtain that the twist $H_S^d$ is everywhere locally solvable only for finitely many integers $d$.

math.NT

Murmurations of Mestre-Nagao sums

This paper investigates the detection of the rank of elliptic curves with ranks 0 and 1, employing a heuristic known as the Mestre-Nagao sum \[ S(B) = \frac{1}{\log{B}} \sum_{\substack{p<B \\ \textrm{good reduction}}} \frac{a_p(E)\log{p}}{p}, \] where $a_p(E)$ is defined as $p + 1 - \#E(\mathbb{F}_p)$ for an elliptic curve $E/\mathbb{Q}$ with good reduction at prime $p$. This approach is inspired by the Birch and Swinnerton-Dyer conjecture. Our observations reveal an oscillatory behavior in the sums, closely associated with the recently discovered phenomena of murmurations of elliptic curves. Surprisingly, this suggests that in some cases, opting for a smaller value of $B$ yields a more accurate classification than choosing a larger one. For instance, when considering elliptic curves with conductors within the range of $[40\,000,45\,000]$, the rank classification based on $a_p$'s with $p < B = 3\,200$ produces better results compared to using $B = 50\,000$. This phenomenon finds partial explanation in the recent work of Zubrilina.

math.NT

Quadratic twists of genus one curves

For a given irreducible and monic polynomial $f(x) \in \mathbb{Z}[x]$ of degree $4$, we consider the quadratic twists by square-free integers $q$ of the genus one quartic ${H\, :\, y^2=f(x)}$ \[ H_q \, :\, qy^2=f(x). \] We say that a curve $C$ is everywhere locally soluble (ELS) if it has a solution in $\mathbb{R}$ and in $\mathbb{Q}_p$ for every prime $p$ (i.e. if $C(\mathbb{R})\neq \emptyset$ and $C(\mathbb{Q}_p)\neq \emptyset$ for all primes $p$). Let $L=\{q\in \mathbb{N} :\, q \text{ is square-free and } H_q \text{ is ELS}\}$ denote the set of positive square-free integers $q$ for which $H_q$ is everywhere locally soluble. For a real number $x$ let ${L(x)= \#\{q\in L:\, q<x\}}$ be the number of elements in $L$ that are less then $x$. Furthermore, let us denote with \[ F(s)=\sum_{n \in L} \frac{1}{n^s} \] the corresponding Dirichlet's series of the set $L$. In this paper, we obtain that \[ L(x) = c_f \frac{x}{(\ln{x})^{m}}+O\left(\frac{x}{(\ln{x})^\alpha}\right) \] for some constants $c_f$, $m$ and $\alpha$ only depending on $f$ such that $m<\alpha \leq 1+m$. We also express the Dirichlet's series $F(s)$ via Dedekind's zeta functions of certain number fields.

math.NT

UQpy v4.1: Uncertainty Quantification with Python

This paper presents the latest improvements introduced in Version 4 of the UQpy, Uncertainty Quantification with Python, library. In the latest version, the code was restructured to conform with the latest Python coding conventions, refactored to simplify previous tightly coupled features, and improve its extensibility and modularity. To improve the robustness of UQpy, software engineering best practices were adopted. A new software development workflow significantly improved collaboration between team members, and continous integration and automated testing ensured the robustness and reliability of software performance. Continuous deployment of UQpy allowed its automated packaging and distribution in system agnostic format via multiple channels, while a Docker image enables the use of the toolbox regardless of operating system limitations.

cs.SE

Optimisation Of Pressure Sewer Operation

The paper deals with the new control method developed for the pressure sewer systems. This method eliminates the disadvantages of currently common used on-off regulation. The major disadvantage is a transition of inconstancies of the effluent production into the sewage system. The propose method is primarily based on the principle of an allocation of the drawing off into the given time slots. This control method is further improved by the extended modules provide higher level of the optimization (learning mode and emergent drawing off). Proposed method is able to decrease of the standard deviation of pumping even by 80%.

eess.SY