Related papers: On one inverse problem
Hermitian linear matrix pencils are ubiquitous in control theory, operator systems, semidefinite optimization, and real algebraic geometry. This survey reviews the fundamental features of the matricial solution set of a linear matrix…
This note deals with the direct and inverse spectral analysis for a class of infinite band symmetric matrices. This class corresponds to operators arising from difference quations with usual and inner boundary conditions. We give a…
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…
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.
In applications of linear algebra including nuclear physics and structural dynamics, there is a need to deal with uncertainty in the matrices. We focus on matrices that depend on a set of parameters $\omega$ and we are interested in the…
The inverse eigenvalue problem of a graph studies the real symmetric matrices whose off-diagonal pattern is prescribed by the adjacencies of the graph. The strong spectral property (SSP) is an important tool for this problem. This note…
We describe an algorithm to compute the extremal eigenvalues and corresponding eigenvectors of a symmetric matrix by solving a sequence of Quadratic Binary Optimization problems. This algorithm is robust across many different classes of…
We consider a quadratic operator pencil with a small periodic perturbation multiplied by the spectral parameter. It is motivated, in particular, by a one-dimensional Klein-Gordon equation with a time-parity-symmetric perturbation. We study…
Square matrices of the form $\widetilde{\mathbf{A}} =\mathbf{A} + \mathbf{e}D \mathbf{f}^*$ are considered. An explicit expression for the inverse is given, provided $\widetilde{\mathbf{A}}$ and $D$ are invertible with…
In the last decades the Moore-Penrose pseudoinverse has found a wide range of applications in many areas of Science and became a useful tool for physicists dealing, for instance, with optimization problems, with data analysis, with the…
We establish a Sturm{Liouville theorem for quadratic operator pencils counting their unstable real roots, with applications to stability of waves. Such pencils arise, for example, in reduction of eigenvalue systems to higher-order scalar…
We describe algorithms for computing eigenpairs (eigenvalue--eigenvector) of a complex $n\times n$ matrix $A$. These algorithms are numerically stable, strongly accurate, and theoretically efficient (i.e., polynomial-time). We do not…
For a large class of linear neutral type systems the problem of eigenvalues and eigenvectors assignment is investigated, i.e. finding the system which has the given spectrum and almost all, in some sense, eigenvectors.
Generalized eigenvalue problems involving a singular pencil may be very challenging to solve, both with respect to accuracy and efficiency. While Part I presented a rank-completing addition to a singular pencil, we now develop two…
We present a spectral theory of hypergraphs that closely parallels Spectral Graph Theory. A number of recent developments building upon classical work has led to a rich understanding of "hyperdeterminants" of hypermatrices, a.k.a.…
The inverse eigenvalue problem studies the possible spectra among matrices whose off-diagonal entries have their zero-nonzero patterns described by the adjacency of a graph $G$. In this paper, we refer to the $i$-nullity pair of a matrix…
The inverse problem of spectral analysis for the non-self-adjoint matrix Sturm-Liouville operator on a finite interval is investigated. We study properties of the spectral characteristics for the considered operator, and provide necessary…
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 scattering problem for Sturm-Liouville operators on the line with a matrix transfer condition at the origin is considered. We show that the transfer matrix can be reconstructed from the eigenvalues and reflection coefficient. In…
A number of theoretical and computational problems for matrix polynomials are solved by passing to linearizations. Therefore a perturbation theory results for linearizations need to be related back to matrix polynomials. In this paper we…