Related papers: Realizing Sule\u{i}manova spectra via permutative …
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…
We prove the sufficiency of the Linear Superposition Principle for linear trees, which characterizes the spectra achievable by a real symmetric matrix whose underlying graph is a linear tree. The necessity was previously proven in 2014.…
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]…
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…
Identifying the collection of scalars that represent a non-negative matrix's eigenvalues is known as the non-negative inverse eigenvalue problem (NIEP). Conditions for the existence of a non-negative matrix with a certain spectrum are…
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 inverse eigenvalue problem for real symmetric matrices of the form 0 0 0 . 0 0 * 0 0 0 . 0 * * 0 0 0 . * * 0 . . . . . . . 0 0 * . 0 0 0 0 * * . 0 0 0 * * 0 . 0 0 0 is solved. The solution is shown to be unique. The problem is also…
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 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…
Let $A$ be a nonnegative symmetric $ 5 \times 5 $ matrix with eigenvalues $ \lambda_1 \geq \lambda_2 \geq \lambda_3 \geq \lambda_4 \geq \lambda_5 $. We show that if $ \sum_{i=1}^{5} \lambda_{i} \geq \frac{1}{2} \lambda_1 $ then $ \lambda_3…
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…
We consider eigenvalue condition numbers and backward errors for a class of symmetric nonlinear eigenvalue problems with eigenvector nonlinearities. For both of these quantities, we derive explicit and computable expressions that can be…
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…
We present a real symmetric tri-diagonal matrix of order $n$ whose eigenvalues are $\{2k \}_{k=0}^{n-1}$ which also satisfies the additional condition that its leading principle submatrix has a uniformly interlaced spectrum, $\{2l + 1…
In this paper, we consider a problem for the first order Dirac differential equations system with spectral parameter dependent in boundary condition. The asymptotic behaviors of eigenvalues, eigenfunctions and normalizing numbers of this…
We consider a class of generally non-self-adjoint eigenvalue problems which are nonlinear in the solution as well as in the eigenvalue parameter ("doubly" nonlinear). We prove a bifurcation result from simple isolated eigenvalues of the…
The main of this work is to use the unit lower triangular matrices for solving inverse eigenvalue problem of nonnegative matrices and present the easier method to solve this problem.
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…
In this note, we solve an inverse spectral problem for a class of finite band symmetric matrices. We provide necessary and sufficient conditions for a matrix valued function to be a spectral function of the operator corresponding to a…
Let $M$ be a square matrix and let $p(t)$ be a monic polynomial of degree $n$. Let $Z$ be a set of $n\times n$ matrices. The multiplicative inverse eigenvalue problem asks for the construction of a matrix in $Z$ such that the product matrix…