A numerical method for solving inverse eigenvalue problems
A numerical method for solving inverse eigenvalue problems
Based on QR-like decomposition with column pivoting, a new and efficient numerical method for solving symmetric matrix inverse eigenvalue problems is proposed, which is suitable for both the distinct and multiple eigenvalue cases. A locally quadratic convergence analysis is given. Some numerical experiments are presented to illustrate our results.
An inverse eigenvalue problem for damped gyroscopic second-order systems.
Explicit solution for an infinite dimensional generalized inverse eigenvalue problem.
Extremal inverse eigenvalue problem for matrices described by a connected unicyclic graph
In this paper, we deal with the construction of symmetric matrix whose corresponding graph is connected and unicyclic using some pre-assigned spectral data. Spectral data for the problem consist of the smallest and the largest eigenvalues of each leading principal submatrices. Inverse eigenvalue problem (IEP) with this set of spectral data is generally known as the extremal IEP. We use a standard scheme of labeling the vertices of the graph, which helps in getting a simple relation between the characteristic...
Inverse eigenvalue problem for constructing a kind of acyclic matrices with two eigenpairs
We investigate an inverse eigenvalue problem for constructing a special kind of acyclic matrices. The problem involves the reconstruction of the matrices whose graph is an -centipede. This is done by using the st and th eigenpairs of their leading principal submatrices. To solve this problem, the recurrence relations between leading principal submatrices are used.
Inverse eigenvalue problem of unitary Hessenberg matrices.
On the inverse eigenvalue problem for a special kind of acyclic matrices
We study an inverse eigenvalue problem (IEP) of reconstructing a special kind of symmetric acyclic matrices whose graph is a generalized star graph. The problem involves the reconstruction of a matrix by the minimum and maximum eigenvalues of each of its leading principal submatrices. To solve the problem, we use the recurrence relation of characteristic polynomials among leading principal minors. The necessary and sufficient conditions for the solvability of the problem are derived. Finally, a...
Pseudoinverse formulation of Rayleigh-Schrödinger perturbation theory for the symmetric matrix eigenvalue problem.
The robust pole assignment problem for second-order systems.
Two inverse eigenproblems for symmetric doubly arrow matrices.