相关论文: On the location of eigenvalues of matrix polynomia…

We consider the set $\mathcal{M}_n(\mathbb{Z}; H)$ of $n\times n$-matrices with integer elements of size at most $H$ and obtain upper and lower bounds on the number of distinct irreducible characteristic polynomials which correspond to…

It is known that a matrix polynomial with unitary matrix coefficients has its eigenvalues in the annular region $\frac{1}{2} < |\lambda| < 2$. We prove in this short note that under certain assumptions, matrix polynomials with either doubly…

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$,…

In this paper we bring to light an unprecedented property of the eigenvalues of a matrix A with the eigenvalues and eigenvectors of a submatrix of A. This property can be used, through the technique developed here, to determine some of…

If a single particle obeys non-relativistic QM in R^d and has the Hamiltonian H = - Delta + f(r), where f(r)=sum_{i = 1}^{k}a_ir^{q_i}, 2\leq q_i < q_{i+1}, a_i \geq 0$, then the eigenvalues E = E_{n\ell}^{(d)}(\lambda) are given…

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…

The notion of root polynomials of a polynomial matrix $P(\lambda)$ was thoroughly studied in [F. Dopico and V. Noferini, Root polynomials and their role in the theory of matrix polynomials, Linear Algebra Appl. 584:37--78, 2020]. In this…

We consider square matrices over $\mathbb{C}$ satisfying an identity relating their eigenvalues and the corresponding eigenvectors re-proved and discussed by Denton, Parker, Tao and Zhang, called the eigenvector-eigenvalue identity. We…

The standard approach for finding eigenvalues and eigenvectors of matrix polynomials starts by embedding the coefficients of the polynomial into a matrix pencil, known as linearization. Building on the pioneering work of Nakatsukasa and…

In this article we give bounds for the eigenvalues of a matrix, which can be seen as a common generalization of meet and join matrices and therefore also as a generalization of both GCD and LCM matrices. Although there are some results…

A rational matrix is a matrix-valued function $R(\lambda): \mathbb{C} \rightarrow M_p$ such that $R(\lambda) = \begin{bmatrix} r_{ij}(\lambda) \end{bmatrix}_{p\times p}$, where $r_{ij}(\lambda)$ are scalar complex rational functions in…

Consider an $n\times n$ matrix polynomial $P(\lambda)$ and a set $\Sigma$ consisting of $k \le n$ distinct complex numbers. In this paper, a (weighted) spectral norm distance from $P(\lambda)$ to the matrix polynomials whose spectra include…

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…

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…

In this paper, we consider the different eigenvalue condition numbers for matrix polynomials used in the literature and we compare them. One of these condition numbers is a generalization of the Wilkinson condition number for the standard…

For an algebraically closed field $K$ of characteristic zero and a non-singular matrix $A\in \mbox{GL}_n(K)$, a semi-invariant polynomial of $A$ is defined to be a polynomial $p(x)=p(x_1,\dots,x_n)$ with coefficients in $K$ such that…

The paper presents methods of eigenvalue localisation of regular matrix polynomials, in particular, stability of matrix polynomials is investigated. For this aim a stronger notion of hyperstability is introduced and widely discussed. Matrix…

We derive inclusion regions for the eigenvalues of matrix polynomials expressed in a general polynomial basis, which can lead to significantly better results than traditional bounds. We present several applications to engineering problems.

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…

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.