Related papers: Perturbation theory of transfer function matrices
Geometrical stability theory is a powerful set of model-theoretic tools that can lead to structural results on models of a simple first-order theory. Typical results offer a characterization of the groups definable in a model of the theory.…
Perturbation theory plays a crucial role in sensitivity analysis, which is extensively used to assess the robustness of numerical techniques. To quantify the relative sensitivity of any problem, it becomes essential to investigate…
Marginalization -- summing a function over all assignments to a subset of its inputs -- is a fundamental computational problem with applications from probabilistic inference to formal verification. Despite its computational hardness in…
Rayleigh-Schr\"{o}dinger perturbation theory is a well-known theory in quantum mechanics and it offers useful characterization of eigenvectors of a perturbed matrix. Suppose $A$ and perturbation $E$ are both Hermitian matrices, $A^t = A +…
Let $G$ be an $N \times N$ real matrix whose entries are independent identically distributed standard normal random variables $G_{ij} \sim \mathcal{N}(0,1)$. The eigenvalues of such matrices are known to form a two-component system…
The structured $\varepsilon$-stability radius is introduced as a quantity to assess the robustness of transient bounds of solutions to linear differential equations under structured perturbations of the matrix. This applies to general…
For an equivariant commutative ring spectrum $R$, $\pi_0 R$ has algebraic structure reflecting the presence of both additive transfers and multiplicative norms. The additive structure gives rise to a Mackey functor and the multiplicative…
A standard perturbation result states that perturbed eigenvalues and eigenprojections admit a perturbation series provided that the operator norm of the perturbation is smaller than a constant times the corresponding eigenvalue isolation…
The replica method for a quenched disordered system is considered in a perturbative field theory. Since correction in a finite-order perturbation is given in a polynomial of the replica number $n$, the zero-replica limit $n \to 0$ is…
In this paper, we investigate condition numbers of eigenvalue problems of matrix polynomials with nonsingular leading coefficients, generalizing classical results of matrix perturbation theory. We provide a relation between the condition…
We revisit the relative perturbation theory for invariant subspaces of positive definite matrix pairs. As a prototype model problem for our results we consider parameter dependent families of eigenvalue problems. We show that new estimates…
We study transfer learning for matrix completion in a Missing Not-at-Random (MNAR) setting that is motivated by biological problems. The target matrix $Q$ has entire rows and columns missing, making estimation impossible without side…
The mutually commuting $1\times n$ fused single and double-row transfer matrices of the critical six-vertex model are considered at roots of unity $q=e^{i\lambda}$ with crossing parameter $\lambda=\frac{(p'-p)\pi}{p'}$ a rational fraction…
We study the spectral properties of the transfer matrix for a gonihedric random surface model on a three-dimensional lattice. The transfer matrix is indexed by generalized loops in a natural fashion and is invariant under a group of motions…
We study the arithmetic of monoids of regular elements of commutative rings with zero-divisors. Our focus is on Krull rings and on some of their generalizations (such as weakly Krull rings and C-rings). We establish sufficient conditions…
Polynomial based methods have recently been used in several works for mitigating the effect of stragglers (slow or failed nodes) in distributed matrix computations. For a system with $n$ worker nodes where $s$ can be stragglers, these…
An $r$-matrix is a matrix with symbols in $\{0,1,\ldots,r-1\}$. A matrix is simple if it has no repeated columns. Let ${\cal F}$ be a finite set of $r$-matrices. Let $\hbox{forb}(m,r,{\cal F})$ denote the maximum number of columns possible…
Trust-region subproblem (TRS) is an important problem arising in many applications such as numerical optimization, Tikhonov regularization of ill-posed problems, and constrained eigenvalue problems. In recent decades, extensive works focus…
The transfer operator for $\Gamma_0(N)$ and trivial character $\chi_0$ possesses a finite group of symmetries generated by permutation matrices $P$ with $P^2=id$. Every such symmetry leads to a factorization of the Selberg zeta function in…
Linear structural equation models are multivariate statistical models encoded by mixed graphs. In particular, the set of covariance matrices for distributions belonging to a linear structural equation model for a fixed mixed graph $G=(V,…