Related papers: Inverse Eigenvalue Problem of Cell Matrices

We consider the class of bounded symmetric Jacobi matrices $J$ with positive off-diagonal elements and complex diagonal elements. With each matrix $J$ from this class, we associate the spectral data, which consists of a pair $(\nu,\psi)$.…

The still-unsolved problem of determining the set of eigenvalues realized by $n$-by-$n$ doubly stochastic matrices, those matrices with row sums and column sums equal to $1$, has attracted much attention in the last century. This problem is…

The magnetic inverse source problem of reconstructing the positions and currents of very long parallel conductors is considered in a two-dimensional situation, with applications to power line measurements. The input data is the magnetic…

The inverse problem for the differential operator pencil with complex periodic potential and discontinuous coefficients on the axis is studied. Main characteristics of the fundamental solutions are investigated, the spectrum of the operator…

We study the inverse problem of recovering a tree graph together with the weights on its edges (equivalently a metric tree) from the knowledge of the Dirichlet-to-Neumann matrix associated with the Laplacian. We prove an explicit formula…

A $2n\times 2n$ real matrix $A$ is said to be a Hamiltonian matrix if $A^{T}J+JA=0$, where $J=\left( \begin{array}{cc} 0 & I_{n} \\ -I_{n} & 0\\ \end{array} \right)$. Hamiltonian matrices appear in many areas of applications, such as linear…

We prove that the inverse of a positive-definite matrix can be approximated by a weighted-sum of a small number of matrix exponentials. Combining this with a previous result [OSV12], we establish an equivalence between matrix inversion and…

In this work, we study the inverse spectral problem, using the Weyl matrix as the input data, for the matrix Schrodinger operator on the half-line with the boundary condition being the form of the most general self-adjoint. We prove the…

We consider the direct and inverse spectral problems for Dirac operators that are generated by the differential expressions $$ \mathfrak t_q:=\frac{1}{i}[I&0 0&-I]\frac{d}{dx}+[0&q q^*&0] $$ and some separated boundary conditions. Here $q$…

The eigenvector-eigenvalue identity relates the eigenvectors of a Hermitian matrix to its eigenvalues and the eigenvalues of its principal submatrices in which the jth row and column have been removed. We show that one-dimensional arrays of…

The theory of inverse scattering is developed to study the initial-value problem for the modified matrix Korteweg-de Vries (mmKdV) equation with the $2m\times2m$ $(m\geq 1)$ Lax pairs under the nonzero boundary conditions at infinity. In…

Inverse spectral problem for a self-adjoint differential operator, which is the sum of the operator of the third derivative on a finite interval and of the operator of multiplication by a real function (potential), is solved. Closed system…

A problem that is frequently encountered in a variety of mathematical contexts, is to find the common invariant subspaces of a single, or set of matrices. A new method is proposed that gives a definitive answer to this problem. The key idea…

We prove that the point process of the eigenvalues of real or complex non-Hermitian matrices $X$ with independent, identically distributed entries is hyperuniform: the variance of the number of eigenvalues in a subdomain $\Omega$ of the…

Let $G$ be a connected graph on $n$ vertices and $d_{ij}$ be the length of the shortest path between vertices $i$ and $j$ in $G$. We set $d_{ii}=0$ for every vertex $i$ in $G$. The squared distance matrix $\Delta(G)$ of $G$ is the $n\times…

In a polydiagonal subspace of the Euclidean space, certain components of the vectors are equal (synchrony) or opposite (anti-synchrony). Polydiagonal subspaces invariant under a matrix have many applications in graph theory and dynamical…

We derive the exact form of the eigenvalue spectra of correlation matrices derived from a set of time-shifted, finite Brownian random walks (time-series). These matrices can be seen as random, real, asymmetric matrices with a special…

For every $2n\times 2n$ real positive definite matrix $A,$ there exists a real symplectic matrix $M$ such that $M^TAM=\diag(D,D),$ where $D$ is the $n\times n$ positive diagonal matrix with diagonal entries $d_1(A)\le \cdots\le d_n(A).$ The…

We present a new algorithm for solving an eigenvalue problem for a real symmetric matrix which is a rank-one modification of a diagonal matrix. The algorithm computes each eigenvalue and all components of the corresponding eigenvector with…

This paper deals with differential pencils possessing a term depending on the unknown function with a fixed argument. We deduce the so called main equation together with its fine structure for the spectral problem. Then, according to the…