Related papers: Inverse Eigenvalue Problem of Cell Matrices

Consider an n by n matrix x_ij, and consider the quantity || x_{i,pi(i)} ||_X where X is a symmetric sequence space as a random variable where the permutation pi is chosen randomly. This was considered by Kwapien and Schutt, and we extend…

In this note, we present an algorithm that yields many new methods for constructing doubly stochastic and symmetric doubly stochastic matrices for the inverse eigenvalue problem. In addition, we introduce new open problems in this area that…

This paper is concerned with inverse spectral problems for higher-order ($n > 2$) ordinary differential operators. We develop an approach to the reconstruction from the spectral data for a wide range of differential operators with either…

The inverse eigenvalue problem of a graph $G$ aims to find all possible spectra for matrices whose $(i,j)$-entry, for $i\neq j$, is nonzero precisely when $i$ is adjacent to $j$. In this work, the inverse eigenvalue problem is completely…

A discrete Schr\"odinger operator of a graph $G$ is a real symmetric matrix whose $i,j$-entry, $i \neq j$, is negative if $\{i,j\}$ is an edge and zero if it is not an edge, while diagonal entries can be any real numbers. The discrete…

The poses of $m$ robotics in $n$ time points may be represented by an $m \times n$ dual quaternion matrix. In this paper, we study the spectral theory of dual quaternion matrices. We introduce right and left eigenvalues for square dual…

We consider the self-adjoint Dirac operators on a finite interval with summable matrix-valued potentials and general boundary conditions. For such operators, we study the inverse problem of reconstructing the potential and the boundary…

We consider the inverse eigenvalue problem for entanglement witnesses, which asks for a characterization of their possible spectra (or equivalently, of the possible spectra resulting from positive linear maps of matrices). We completely…

We review the properties of eigenvectors for the graph Laplacian matrix, aiming at predicting a specific eigenvalue/vector from the geometry of the graph. After considering classical graphs for which the spectrum is known, we focus on…

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 suggest that the spectral properties near zero virtuality of three dimensional QCD, follow from a Hermitean random matrix model. The exact spectral density is derived for this family of random matrix models both for even and odd number…

Consider a symmetric matrix $A(v)\in\RR^{n\times n}$ depending on a vector $v\in\RR^n$ and satisfying the property $A(\alpha v)=A(v)$ for any $\alpha\in\RR\backslash{0}$. We will here study the problem of finding $(\lambda,v)\in\RR\times…

The inverse eigenvalue problem of a given graph $G$ is to determine all possible spectra of real symmetric matrices whose off-diagonal entries are governed by the adjacencies in $G$. Barrett et al. introduced the Strong Spectral Property…

For a given graph $G$, we aim to determine the possible realizable spectra for a generalized (or sometimes referred to as a weighted) Laplacian matrix associated with $G$. This new specialized inverse eigenvalue problem is considered for…

We find the eigenvalues and eigenvectors of the n by n matrix with (i,j) entry \binom(i-1,n-j), establishing a conjecture of Peele and Stanica. Curiously, the eigenvectors can be chosen to form a matrix which is its own inverse.

We present a matrix version of a known method of constructing common eigenvectors of two diagonalizable commuting matrices, thus enabling their simultaneous diagonalization. The matrices may have simple eigenvalues of multiplicity greater…

We present a new algorithm for solving an eigenvalue problem for a real symmetric arrowhead matrix. The algorithm computes all eigenvalues and all components of the corresponding eigenvectors with high relative accuracy in $O(n^{2})$…

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 consider the inverse problem of finding matrix valued edge or nodal quantities in a graph from measurements made at a few boundary nodes. This is a generalization of the problem of finding resistors in a resistor network from voltage and…

We consider an inverse spectral problem on a quantum graph associated with the square lattice. Assuming that the potentials on the edges are compactly supported and symmetric, we show that the Dirichlet-to-Neumann map for a boundary value…