Related papers: On Pseudospectra of Matrix Polynomials and their B…
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…
The boundary of a numerical range of a finite matrix is always a nice curve (algebraic, closed and simple), but the equation it satisfies is often very complicated. We will show that, furthermore, there is no hope of describing these curves…
Distance matrices are matrices whose elements are the relative distances between points located on a certain manifold. In all cases considered here all their eigenvalues except one are non-positive. When the points are uncorrelated and…
A matrix polynomial is a polynomial in a complex variable $\lambda$ with coefficients in $n \times n$ complex matrices. The spectral curve of a matrix polynomial $P(\lambda)$ is the curve $\{ (\lambda, \mu) \in \mathbb{C}^2 \mid…
We discuss some extensions and refinements of the variance bounds for both real and complex numbers. The related bounds for the eigenvalues and spread of a matrix are also derived here.
We prove several results about the multiplicity of the first Steklov eigenvalues on compact surfaces with boundary. We improve some bounds on the multiplicity, especially for the first eigenvalue, and we prove they are sharp on some…
This paper is the last in a series of three papers which investigate pseudoholomorphic strips in the symplectisation of a three dimensional closed contact manifold with a mixed boundary condition. We will prove a compactness and an…
This note presents absolute bounds on the size of the coefficients of the characteristic and minimal polynomials depending on the size of the coefficients of the associated matrix. Moreover, we present algorithms to compute more precise…
We present a hierarchy of tractable relaxations to obtain lower bounds on the minimum value of a polynomial over a constraint set defined by polynomial equations. In contrast to previous convex relaxation techniques for this problem, our…
Inspired by a Blaschke's work about analytic convex surfaces, we study {\em shadow boundaries} of Riemannian submanifolds $M$, which are defined by a parallel vector field along $M$. Since a shadow boundary is just a closed subset of $M$,…
In this paper, we define the adjacency matrix of a semigraph. We give the conditions for a matrix to be semigraphical and give an algorithm to construct a semigraph from the semigraphical matrices. We derive lower and upper bounds for…
We give some properties of skew spectrum of a graph, especially, we answer negatively a problem concerning the skew characteristic polynomial and matching polynomial in [M. Cavers et al., Skew-adjacency matrices of graphs, Linear Algebra…
In the paper, a simple condition guaranteing the finiteness property for a bounded set of matrices is presented. Given a bounded set S of real or complex matrices, it is shown that existence of a sequence of matrix products such that the…
Conditionspectrum measures the computational stability of solving a linear system. In this paper, ten theorems involving {\epsilon}-conditionspectrum are presented. All these theorems generalize a well known eigenvalue theorem and…
This paper is concerned with the spectral properties of matrices associated with linear filters for the estimation of the underlying trend of a time series. The interest lies in the fact that the eigenvectors can be interpreted as the…
We study some spectral properties of a matrix that is constructed as a combination of a Laplacian and an adjacency matrix of simple graphs. The matrix considered depends on a positive parameter, as such we consider the implications in…
For a given complex square matrix $A$ with constant row sum, we establish two new eigenvalue inclusion sets. Using these bounds, first we derive bounds for the second largest and smallest eigenvalues of adjacency matrices of $k$-regular…
When a randomness is introduced at the level of real matrix elements, depending on its particular realization, a pair of eigenvalues can appear as real or form a complex conjugate pair. We show that in the limit of large matrix size the…
We obtain sequences of inclusion sets for the spectrum, essential spectrum, and pseudospectrum of banded, in general non-normal, matrices of finite or infinite size. Each inclusion set is the union of the pseudospectra of certain…
This review presents an account of the major works done on spectra of adjacency matrices drawn on networks and the basic understanding attained so far. We have divided the review under three sections: (a) extremal eigenvalues, (b) bulk part…