Searcharxiv⌕ Search

arXiv subjects

André-Alexander Zepernick

Publications and source records attributed to André-Alexander Zepernick.

2 recordsLinked to original sources

Uncertainty quantification for stationary and time-dependent PDEs subject to Gevrey regular random domain deformations

We study uncertainty quantification for partial differential equations subject to domain uncertainty. We parameterize the random domain using the model recently considered by Chernov and Le (2024) as well as Harbrecht, Schmidlin, and Schwab (2024) in which the input random field is assumed to belong to a Gevrey smoothness class. This approach has the advantage of being substantially more general than models which assume a particular parametric representation of the input random field such as a Karhunen-Loeve series expansion. We consider both the Poisson equation as well as the heat equation and design randomly shifted lattice quasi-Monte Carlo (QMC) cubature rules for the computation of the expected solution under domain uncertainty. We show that these QMC rules exhibit dimension-independent, essentially linear cubature convergence rates in this framework. In addition, we complete the error analysis by taking into account the approximation errors incurred by dimension truncation of the random input field and finite element discretization. Numerical experiments are presented to confirm the theoretical rates.

math.NA↗

New upper and lower bounds on the smallest singular values of nonsingular lower triangular $(0,1)$-matrices

Let $K_n$ denote the set of all nonsingular $n\times n$ lower triangular $(0,1)$-matrices. Hong and Loewy (2004) introduced the number sequence $$ c_n=\min\{λ\midλ~\text{is an eigenvalue of}~XX^{\rm T},~X\in K_n\},\quad n\in\mathbb Z_+. $$ There have been a number of attempts in the literature to obtain bounds on the numbers $c_n$ by Mattila (2015), Altinisik et al. (2016), Kaarnioja (2021), Loewy (2021), and Altinisik (2021). In this paper, improved upper and lower bounds are derived for the numbers $c_n$. By considering the characteristic polynomial corresponding to the matrix $Z_n$ satisfying $c_n=\|Z_n\|_2^{-1}$, it is shown that the second largest eigenvalue of $Z_n$ is bounded from above by $\frac45$ leading to an improved upper bound on $c_n$. On the other hand, Samuelson's inequality applied to the roots of the characteristic polynomial of $Z_n$ yields an improved lower bound. Numerical experiments demonstrate the quality of the new bounds.

math.CO↗