相关论文: Non-negative persymmetric realizability of certain…
The nonnegative inverse eigenvalue problem (NIEP) asks which lists of $n$ complex numbers (counting multiplicity) occur as the eigenvalues of some $n$-by-$n$ entry-wise nonnegative matrix. The NIEP has a long history and is a known hard…
The longstanding nonnegative inverse eigenvalue problem (NIEP) is to determine which multisets of complex numbers occur as the spectrum of an entry-wise nonnegative matrix. Although there are some well-known necessary conditions, a solution…
We say that a list of complex numbers is "realisable" if it is the spectrum of some (entrywise) nonnegative matrix. The Nonnegative Inverse Eigenvalue Problem (NIEP) is the problem of characterising all realisable lists. Although the NIEP…
The nonnegative inverse eigenvalue problem (NIEP) is shown to be solvable by the reality condition, spectrum equal to its conjugate, as well as by a finite union and intersection of polynomial inequalities. It is also shown that the…
We study the bisymmetric nonnegative inverse eigenvalue problem (BNIEP). This problem is the problem of finding the necessary and sufficient conditions on a list of $n$ complex numbers to be a spectrum of an $n \times n$ bisymmetric…
A list of complex numbers is realizable if it is the spectrum of a nonnegative matrix. In 1949 Suleimanova posed the nonnegative inverse eigenvalue problem (NIEP): the problem of determining which lists of complex numbers are realizable.…
The problem of determining necessary and sufficient conditions for a set of real numbers to be the eigenvalues of a symmetric nonnegative matrix is called the symmetric nonnegative inverse eigenvalue problem (SNIEP). In this paper we solve…
We give sufficient conditions of the nonnegative inverse eigenvalue problem (NIEP) for normal centrosymmetric matrices. These sufficient conditions are analogous to the sufficient conditions of the NIEP for normal matrices given by Xu [16]…
Given a list of complex numbers \sigma:=(\lambda_1,\lambda_2,...,\lambda_m), we say that {\sigma} is realisable if {\sigma} is the spectrum of some (entrywise) nonnegative matrix. The Nonnegative Inverse Eigenvalue Problem (or NIEP) is the…
We say that a list of real numbers is "symmetrically realisable" if it is the spectrum of some (entrywise) nonnegative symmetric matrix. The Symmetric Nonnegative Inverse Eigenvalue Problem (SNIEP) is the problem of characterising all…
The nonnegative inverse eigenvalue problem (NIEP) is to characterize the spectra of entrywise nonnegative matrices. A finite multiset of complex numbers is called realizable if it is the spectrum of an entrywise nonnegative matrix. Monov…
Our focus is upon {\it irreducible} nonnegative $n$-by-$n$ matrix realizations of nonnegatively realizable spectra or, equivalently, characteristic polynomials. After giving some general background, we make some useful new observations and…
A square matrix of order n with $n\geq 2$ is called permutative matrix when all its rows (up to the frst one) are permutations of precisely its frst row. In this paper recalling spectral results for partitioned into $2$-by-$2$ symmetric…
Over the past decades, transformations between different classes of eigenvalue problems have played a central role in the development of numerical methods for eigenvalue computations. One of the most well-known and successful examples of…
We present and compare three constructive methods for realizing non-real spectra with three nonzero elements in the nonnegative inverse eigenvalue problem. We also provide some necessary conditions for realizability and numerical examples.…
This paper is concerned with the nonnegative inverse eigenvalue problem of finding a nonnegative matrix such that its spectrum is the prescribed self-conjugate set of complex numbers. We first reformulate the nonnegative inverse eigenvalue…
The study of solving the inverse eigenvalue problem for nonnegative matrices has been around for decades. It is clear that an inverse eigenvalue problem is trivial if the desirable matrix is not restricted to a certain structure. Provided…
The symmetric nonnegative inverse eigenvalue problem (SNIEP) asks which sets of numbers (counting multiplicities) can be the eigenvalues of a symmetric matrix with nonnegative entries. While examples of such matrices are abundant in linear…
We present a method to linearize, without approximation, a specific class of eigenvalue problems with eigenvector nonlinearities (NEPv), where the nonlinearities are expressed by scalar functions that are defined by a quotient of linear…
In this paper, linearly structured partial polynomial inverse eigenvalue problem is considered for the $n\times n$ matrix polynomial of arbitrary degree $k$. Given a set of $m$ eigenpairs ($1 \leqslant m \leqslant kn$), this problem…