Related papers: A Resolvent Criterion for Normality
We give a new proof for an equality of certain max-min and min-max approximation problems involving normal matrices. The previously published proofs of this equality apply tools from matrix theory, (analytic) optimization theory and…
Spectral clustering is a technique that clusters elements using the top few eigenvectors of their (possibly normalized) similarity matrix. The quality of spectral clustering is closely tied to the convergence properties of these principal…
In the first part of this paper, the main concern is with smoothness properties of the boundary of the pseudospectrum of a matrix polynomial. In the second part, results are obtained concerning the number of connected components of…
A seminal result due to Wall states that if $x$ is normal to a given base $b$ then so is $rx+s$ for any rational numbers $r,s$ with $r\neq 0$. We show that a stronger result is true for normality with respect to the continued fraction…
W.E. Roth (1952) proved that the matrix equation $AX-XB=C$ has a solution if and only if the matrices $\left[\begin{matrix}A&C\\0&B\end{matrix}\right]$ and $\left[\begin{matrix}A&0\\0&B\end{matrix}\right]$ are similar. A. Dmytryshyn and B.…
In this short note, we propose to extend differentiability (with respect to a multidimensional parameter) of a normalized eigenfunction associated to the simple, dominating eigenvalue of the weighted transfer operator for a uniformly…
Consider an $n \times n$ matrix polynomial $P(\lambda)$. An upper bound for a spectral norm distance from $P(\lambda)$ to the set of $n \times n$ matrix polynomials that have a given scalar $\mu\in\mathbb{C}$ as a multiple eigenvalue was…
The conditions determining that two triangles are congruent play a basic role in planimetry. By comparing not congruent triangles with respect to given sets of corresponding elements it is important to discover if they have any common…
Let $A$ and $B$ be two -non necessarily bounded- normal operators. We give new conditions making their product normal. We also generalize a result by Deutsch et al on normal products of matrices.
This paper establishes a variant of Stewart's theorem (Theorem~6.4 of Stewart, {\em SIAM Rev.}, 15:727--764, 1973) for the singular subspaces associated with the SVD of a matrix subject to perturbations. Stewart's original version uses both…
The standard theorem for regular stochastic matrices is generalized to matrices with no sign restriction on the entries. The condition that column sums be equal to 1 is kept, but the regularity condition is replaced by a condition on the…
We give an efficient algorithm which can obtain a relative error approximation to the spectral norm of a matrix, combining the power iteration method with some techniques from matrix reconstruction which use random sampling.
A new sufficient condition for a list of real numbers to be the spectrum of a symmetric doubly stochastic matrix is presented; this is a contribution to the classical spectral inverse problem for symmetric doubly stochastic matrices that is…
Almost-commuting matrices with respect to the normalized Hilbert-Schmidt norm are considered. Normal almost commuting matrices are proved to be near commuting.
In quant-ph/0205017 v1 Chen, Wu and Yang formulated a necessary separability criterion based on a realignment method for matrices. This note is to point out that this criterion is identical to the necessary cross norm criterion previously…
In 2003, van Dam and Haemers posed a fundamental question in spectral graph theory: does there exist a ``sensible'' matrix whose spectrum determines a random graph up to isomorphism? This paper introduces the class of {\em natural graph…
In this paper we investigate the spectral norm for circulant matrices, whose entries are modified Fibonacci numbers and Lucas numbers. We obtain the identity estimations for the spectral norms. Some numerical test results are listed to…
It is known that any symmetric matrix $M$ with entries in $\R[x]$ and which is positive semi-definite for any substitution of $x\in\R$, has a Smith normal form whose diagonal coefficients are constant sign polynomials in $\R[x]$. We…
We investigate conditions for "simultaneous normalizability" of a family of reduced schemes, i.e., the normalization of the total space normalizes, fiber by fiber, each member of the family. The main result (under more general conditions)…
The normalized distance Laplacian matrix $\mathcal{D}^{\mathcal{L}}(G)$ of a graph $G$ is a natural generalization of the normalized Laplacian matrix, arising from the matrix of pairwise distances between vertices rather than the adjacency…