Related papers: When is the Resolvent Like a Rank One Matrix?

In numerical analysis it is often necessary to estimate the condition number $CN(T)=||T||_{} \cdot||T^{-1}||_{}$ and the norm of the resolvent $||(\zeta-T)^{-1}||_{}$ of a given $n\times n$ matrix $T$. We derive new spectral estimates for…

For $a,\alpha>0$ let $E(a,\alpha)$ be the set of all compact operators $A$ on a separable Hilbert space such that $s_n(A)=O(\exp(-an^\alpha))$, where $s_n(A)$ denotes the $n$-th singular number of $A$. We provide upper bounds for the norm…

We compute an asymptotic formula for the supremum of the resolvent norm ($\zeta$ -T ) -1 over |$\zeta$| $\ge$ 1 and contractions T acting on an n-dimensional Hilbert space, whose spectral radius does not exceed a given r $\in$ (0, 1). We…

Let $B$ and $C$ be square complex matrices. The differential equation \begin{equation*} x''(t)+Bx'(t)+Cx(t)=f(t) \end{equation*} is considered. A solvent is a matrix solution $X$ of the equation $X^2+BX+C=\mathbf0$. A pair of solvents $X$…

For a prime $p$ and a matrix $A \in \mathbb{Z}^{n \times n}$, write $A$ as $A = p (A \,\mathrm{quo}\, p) + (A \,\mathrm{rem}\, p)$ where the remainder and quotient operations are applied element-wise. Write the $p$-adic expansion of $A$ as…

We study the resolvent \[ G^z = \left(\frac{1}{n}XX^T - zI_p\right)^{-1}, \qquad z\in\mathbb C,\ \Im(z)>0, \] where $X=(x_1,\ldots,x_n)\in\mathcal M_{p,n}$ is a random matrix with independent, but not necessarily identically distributed,…

Let $A$ be a real $n\times n$ matrix and $z,b\in \mathbb R^n$. The piecewise linear equation system $z-A\vert z\vert = b$ is called an \textit{absolute value equation}. We consider two solvers for this problem, one direct, one…

Subtracting a critical rank-one approximation from a matrix always results in a matrix with a lower rank. This is not true for tensors in general. Motivated by this, we ask the question: what is the closure of the set of those tensors for…

We study the $\epsilon$-pseudospectra $\sigma_\epsilon(A)$ of square matrices $A \in \mathbb{C}^{N \times N}$. We give a complete characterization of the $\epsilon$-pseudospectrum of any $2 \times 2$ matrix and describe the asymptotic…

We investigate the relation between the spectrum of a non-normal matrix and the norm of its resolvent. We provide spectral estimates for the resolvent of matrices whose largest singular value is bounded by $1$ (so-called Hilbert space…

Let $A$ be a square complex matrix and $z$ a complex number. The distance, with respect to the spectral norm, from $A$ to the set of matrices which have $z$ as an eigenvalue is less than or equal to the distance from $z$ to the spectrum of…

The rank of an n x n matrix A is equal to the size of its largest square submatrix with a nonzero determinant, and it can be computed in O(n^2.37) time. Analogously, the size of the largest square submatrix with nonzero permanent is defined…

In this paper we study the joint/generalized spectral radius of a finite set of matrices in terms of its rank-one approximation by singular value decomposition. In the first part of the paper, we show that any finite set of matrices with at…

For an $n\times n$ positive definite symmetric matrix $Z$ with $Z_{ii} = 1$ for all $i$, we show that there exists a set of vectors $V_Z\subset \mathbb{R}^n$ such that the radius $R$ of the circumsphere of $V_Z$ satisfies ${\rm Mag}\ Z =…

Suppose that A is a C*-algebra for which A is isomorphic to A tensor Z, where Z is the Jiang-Su algebra: a unital, simple, stably finite, separable, nuclear, infinite dimensional C*-algebra with the same Elliott invariant as the complex…

We characterize optimal rank-1 matrix approximations with Hankel or Toeplitz structure with regard to two different norms, the Frobenius norm and the spectral norm, in a new way. More precisely, we show that these rank-1 matrix…

Given a normal matrix $A$ and an arbitrary square matrix $B$ (not necessarily of the same size), what relationships between $A$ and $B$, if any, guarantee that $B$ is also a normal matrix? We provide an answer to this question in terms of…

The problem of expressing a specific polynomial as the determinant of a square matrix of affine-linear forms arises from algebraic geometry, optimisation, complexity theory, and scientific computing. Motivated by recent developments in this…

Let $A$ be an $n\times n$ random symmetric matrix with independent identically distributed subgaussian entries of unit variance. We prove the following large deviation inequality for the rank of $A$: for all $1\leq k\leq c\sqrt{n}$,…

Let $A$ be an $n\times n$ random matrix with independent, identically distributed mean 0, variance 1 subgaussian entries. We prove that $$ \mathbb{P}(A\text{ has distinct singular values})\geq 1-e^{-cn} $$ for some $c>0$, confirming a…