Related papers: Computing the nearest $\Omega$-admissible descript…
We study computational methods for computing the distance to singularity, the distance to the nearest high index problem, and the distance to instability for linear differential-algebraic systems (DAEs) with dissipative Hamiltonian…
We adapt the notion of quasi-Hermition group to the pairs $(G,H)$ of discrete group $G$ and its subgroup $H$. We show that a quasi-Hermitian pair is amenable in the sense of Eymard.
Many manifestly non-Hermitian Hamiltonians (typically, PT-symmetric complex anharmonic oscillators) possess a strictly real, "physical" bound-state spectrum. This means that they are (quasi-)Hermitian with respect to a suitable non-standard…
We study the approximation of functions that map a Euclidean domain $\Omega\subset \mathbb{R}^{d}$ into an $n$-dimensional Riemannian manifold $(M,g)$ minimizing an elliptic, semilinear energy in a function set $H\subset W^{1,2}(\Omega,M)$.…
The adiabatic approximation in open systems is formulated through the effective Hamiltonian approach. By introducing an ancilla, we embed the open system dynamics into a non-Hermitian quantum dynamics of a composite system, the adiabatic…
Given a relatively compact set $\Omega \subseteq \mathbb{R}$ of Lebesgue measure $|\Omega|$ and $\varepsilon > 0$, we show the existence of a set $\Lambda \subseteq \mathbb{R}$ of uniform density $D (\Lambda) \leq (1+\varepsilon) |\Omega|$…
We deal with Calder\'on's problem in a layered anisotropic medium $\Omega\subset\mathbb{R}^n$, $n\geq 3$, with complex anisotropic admittivity $\sigma=\gamma A$, where $A$ is a known Lipschitz matrix-valued function. We assume that the…
We study level statistics in ensembles of integrable $N\times N$ matrices linear in a real parameter $x$. The matrix $H(x)$ is considered integrable if it has a prescribed number $n>1$ of linearly independent commuting partners $H^i(x)$…
We study the problem of finding the nearest $\Omega$-stable matrix to a certain matrix $A$, i.e., the nearest matrix with all its eigenvalues in a prescribed closed set $\Omega$. Distances are measured in the Frobenius norm. An important…
We consider quantum systems consisting of a linear chain of n harmonic oscillators coupled by a nearest neighbour interaction of the form $-q_r q_{r+1}$ ($q_r$ refers to the position of the $r$th oscillator). In principle, such systems are…
Let $ \Omega \subset R^d $ have finite positive Lebesgue measure, and let $ \mathcal{L}^{2}(\Omega) $ be the corresponding Hilbert space of $ \mathcal{L}^{2} $-functions on $ \Omega $. We shall consider the exponential functions $…
A wide class of matrix pencils connected with dissipative Hamiltonian descriptor systems is investigated. In particular, the following properties are shown: all eigenvalues are in the closed left half plane, the nonzero finite eigenvalues…
We define the notion of admissible pair for an algebra $A$, consisting on a couple $(\Gamma,R)$, where $\Gamma$ is a quiver and $R$ a unital, splitted and factorizable representation of $\Gamma$, and prove that the set of admissible pairs…
Shaping the reachable set of a dynamical system is a fundamental challenge in control design, with direct implications for both performance and safety. This paper considers the problem of selecting the optimal input matrix for a linear…
In ${\cal PT}-$symmetric quantum mechanics one of the most characteristic mathematical features of the formalism is the explicit Hamiltonian-dependence of the physical Hilbert space of states ${\cal H}={\cal H}(H)$. Some of the most…
A graph is Hamiltonian if it contains a cycle passing through every vertex. One of the cornerstone results in the theory of random graphs asserts that for edge probability $p \gg \frac{\log n}{n}$, the random graph $G(n,p)$ is…
In this paper, we study approximate Hadamard matrices, that is, well-conditioned $n\times n$ matrices with all entries in $\{\pm1\}$. We show that the smallest-possible condition number goes to $1$ as $n\to\infty$, and we identify some…
Matrices are typically considered over fields or rings. Motivated by applications in parametric differential equations and data-driven modeling, we suggest to study matrices with entries from a Hilbert space and present an elementary theory…
Given a set $S$ of $n$ points in $\mathbb{R}^d$, the Closest Pair problem is to find a pair of distinct points in $S$ at minimum distance. When $d$ is constant, there are efficient algorithms that solve this problem, and fast approximate…
We study the problem of determining whether a prescribed eigenpair $(\lambda,x)$ can be made an exact eigenpair of a nonnegative Hankel matrix through the smallest possible structured perturbation. The task reduces to check the feasibility…