Related papers: Eigenvalue location of certain matrix polynomials

Let ({\lambda}, v) be a known real eigenpair of a square real matrix A. In this paper it is shown how to locate the other eigenvalues of A in terms of the components of v. The obtained region is a union of Gershgorin discs of the second…

In this paper, we find bounds for the eigenvalues of matrix polynomials. In particular, we find generalizations of Cauchy's classical Theorem for distribution of eigenvalues of matrix polynomial.

A procedure for counting the number of eigenvalues of a matrix in a region surrounded by a closed curve is presented. It is based on the application of the residual theorem. The quadrature is performed by evaluating the principal argument…

We develop several methods, based on the geometric relationship between the eigenspaces of a matrix and its adjoint, for determining whether a square matrix having distinct eigenvalues is unitarily equivalent to a complex symmetric matrix.…

We describe algorithms for computing eigenpairs (eigenvalue--eigenvector) of a complex $n\times n$ matrix $A$. These algorithms are numerically stable, strongly accurate, and theoretically efficient (i.e., polynomial-time). We do not…

We investigate the problem of determining the zeros of quaternionic polynomials using matrix method. In a recent paper, Dar et al. \cite{RD} proved that the zeros of a quaternionic polynomial and the left eigenvalues of the corresponding…

We consider the empirical eigenvalue distribution of an $m\times m$ principal submatrix of an $n\times n$ random unitary matrix distributed according to Haar measure. For $n$ and $m$ large with $\frac{m}{n}=\alpha$, the empirical spectral…

For bounded domains, eigenvalues and eigenfunctions of double layer potentials are considered. The aim of this paper is to establish some relationships between eigenvalues, eigenfunctions and the geometry of domain boundaries.

In this paper we consider the eigenvalue problem consisting of the equation -u" = \la r u, \quad \text{on $(-1,1)$}, where $r \in C^1[-1,1], \ r>0$ and $\la \in \R$, together with the multi-point boundary conditions u(\pm 1) =…

The localization phenomenon for periodic unitary transition operators on a Hilbert space consisting of square summable functions on an integer lattice with values in a complex vector space, which is a generalization of the discrete-time…

We discuss the solution of eigenvalue problems associated with partial differential equations that can be written in the generalized form $\m{A}x=\lambda\m{B}x$, where the matrices $\m{A}$ and/or $\m{B}$ may depend on a scalar parameter.…

Let $f=(f_1,\ldots,f_n)$ be a system of $n$ complex homogeneous polynomials in $n$ variables of degree $d$. We call $\lambda\in\mathbb{C}$ an eigenvalue of $f$ if there exists $v\in\mathbb{C}^n\backslash\{0\}$ with $f(v)=\lambda v$,…

We describe algorithms for computing eigenpairs (eigenvalue-eigenvector pairs) of a complex $n\times n$ matrix $A$. These algorithms are numerically stable, strongly accurate, and theoretically efficient (i.e., polynomial-time). We do not…

This note is an introduction to the properties of stable polynomials in several variables with real or complex coefficients. These polynomials are defined in terms of where the polynomial is non-vanishing. We do not cover well-known topics…

The ordered eigenvalues define a Lipschitz map on the real vector space of Hermitian $d \times d$ matrices. We prove that this map acts continuously, but not uniformly continuously, by superposition on the Sobolev spaces $W^{1,q}$, for all…

This paper is devoted to the study of eigenvalue region of the doubly stochastic matrices which are also permutative, that is, each row of such a matrix is a permutation of any other row. We call these matrices as permutative doubly…

We give an $O(n)$ time and space algorithm for constructing a diagonal matrix congruent to A+xI, where A is the adjacency matrix of a cograph and $x\in \mathbb{R}$. Applications include determining the number of eigenvalues of a cograph's…

In the last decade matrix polynomials have been investigated with the primary focus on adequate linearizations and good scaling techniques for computing their eigenvalues and eigenvectors. In this article we propose a new method for…

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…

Given a ternary homogeneous polynomial, the fixed points of the map from $\mathbb{P}^2$ to itself defined by its gradient are called its eigenpoints. We focus on cubic polynomials, and analyze configurations of eigenpoints that admit one or…