Solvability and Stability of the Inverse Problem for the Quadratic Differential Pencil

The inverse spectral problem for the second-order differential pencil with quadratic dependence on the spectral parameter is studied. We obtain sufficient conditions for the global solvability of the inverse problem, prove its local solvability and stability. The problem is considered in the general case of complex-valued pencil coefficients and arbitrary eigenvalue multiplicities. Studying local solvability and stability, we take the possible splitting of multiple eigenvalues under a small perturbation of the spectrum into account. Our approach is constructive. It is based on the reduction of the non-linear inverse problem to a linear equation in the Banach space of infinite sequences. The theoretical results are illustrated by numerical examples.

Ordered multiplicity inverse eigenvalue problem for graphs on six vertices

For a graph $G$, we associate a family of real symmetric matrices, $\mathcal{S}(G)$, where for any $M \in \mathcal{S}(G)$, the location of the nonzero off-diagonal entries of $M$ is governed by the adjacency structure of $G$. The ordered multiplicity Inverse Eigenvalue Problem of a Graph (IEPG) is concerned with finding all attainable ordered lists of eigenvalue multiplicities for matrices in $\mathcal{S}(G)$. For connected graphs of order six, we offer significant progress on the IEPG, as well as a complete solution to the ordered multiplicity IEPG. We also show that while $K_{m,n}$ with $\min(m,n)\ge 3$ attains a particular ordered multiplicity list, it cannot do so with arbitrary spectrum.

Spectral theory for self-adjoint quadratic eigenvalue problems - a review

Many physical problems require the spectral analysis of quadratic matrix polynomials $M\lambda^2+D\lambda +K$, $\lambda \in \mathbb{C}$, with $n \times n$ Hermitian matrix coefficients, $M,\;D,\;K$. In this largely expository paper, we present and discuss canonical forms for these polynomials under the action of both congruence and similarity transformations of a linearization and also $\lambda$-dependent unitary similarity transformations of the polynomial itself. Canonical structures for these processes are clarified, with no restrictions on eigenvalue multiplicities. Thus, we bring together two lines of attack: (a) analytic via direct reduction of the $n \times n$ system itself by $\lambda$-dependent unitary similarity and (b) algebraic via reduction of $2n \times 2n$ symmetric linearizations of the system by either congruence (Section 4) or similarity (Sections 5 and 6) transformations which are independent of the parameter $\lambda$. Some new results are brought to light in the process. Complete descriptions of associated canonical structures (over $\mathbb{R}$ and over $\mathbb{C}$) are provided -- including the two cases of real symmetric coefficients and complex Hermitian coefficients. These canonical structures include the so-called sign characteristic. This notion appears in the literature with different meanings depending on the choice of canonical form. These sign characteristics are studied here and connections between them are clarified. In particular, we consider which of the linearizations reproduce the (intrinsic) signs associated with the analytic (Rellich) theory (Sections 7 and 9).

Catalogue of the Star graph eigenvalue multiplicities

The Star graph $$S_n$$Sn, $$n\geqslant 2$$n⩾2, is the Cayley graph over the symmetric group $$\mathrm {Sym}_n$$Symn generated by transpositions $$(1~i),\,2\leqslant i \leqslant n$$(1i),2⩽i⩽n. This set of transpositions plays an important role in the representation theory of the symmetric group. The spectrum of $$S_n$$Sn contains all integers from $$-(n-1)$$-(n-1) to $$n-1$$n-1, and also zero for $$n\geqslant 4$$n⩾4. In this paper we observe methods for getting explicit formulas of eigenvalue multiplicities in the Star graphs $$S_n$$Sn, present such formulas for the eigenvalues $$\pm (n-k)$$±(n-k), where $$2\leqslant k \leqslant 12$$2⩽k⩽12, and finally collect computational results of all eigenvalue multiplicities for $$n\leqslant 50$$n⩽50 in the catalogue.