Related papers: Inverse Spectral Problems for Linked Vibrating Sys…

Eigenvalue and eigenvector perturbation theory is a fundamental topic in several disciplines, including numerical linear algebra, quantum physics, and related fields. The central problem is to understand how the eigenvalues and eigenvectors…

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…

Random matrix theory allows one to deduce the eigenvalue spectrum of a large matrix given only statistical information about its elements. Such results provide insight into what factors contribute to the stability of complex dynamical…

We study the following inverse graph-theoretic problem: how many vertices should a graph have given that it has a specified value of some parameter. We obtain asymptotic for the minimal number of vertices of the graph with the given number…

We prove, under a certain representation theoretic assumption, that the set of real symmetric matrices, whose eigenvalues satisfy a linear matrix inequality, is itself a spectrahedron. The main application is that derivative relaxations of…

Let G be an undirected graph on n vertices and let S(G) be the set of all real symmetric n x n matrices whose nonzero off-diagonal entries occur in exactly the positions corresponding to the edges of G. The inverse inertia problem for G…

Let $G$ be a graph on $n \ge 3$ vertices, whose adjacency matrix has eigenvalues $\lambda_1 \ge \lambda_2 \ge \dots \ge \lambda_n$. The problem of bounding $\lambda_k$ in terms of $n$ was first proposed by Hong and was studied by Nikiforov,…

Let $\mathbf{f}=(f\_1,\ldots,f\_m)$ and $\mathbf{g}=(g\_1,\ldots,g\_m)$ be two sets of $m\geq 1$ nonlinear polynomials over $\mathbb{K}[x\_1,\ldots,x\_n]$ ($\mathbb{K}$ being a field). We consider the computational problem of finding -- if…

We consider eigenvalue condition numbers and backward errors for a class of symmetric nonlinear eigenvalue problems with eigenvector nonlinearities. For both of these quantities, we derive explicit and computable expressions that can be…

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…

Motivated by the nodal distribution universality conjecture for discrete operators on graphs and by the spectral analysis of their maximal abelian covers, we consider a family of Hermitian matrices $h_{\alpha}$ obtained by varying the…

This work provides a complete characterization of the solutions of a linear interpolation problem for vector polynomials. The interpolation problem consists in finding n scalar polynomials such that an equation involving a linear…

Under the mild trace-norm assumptions we show that the eigenvalues of a generic (non Hermitian) complex perturbation of a Jacobi matrix sequence (not necessarily real) are still distributed as the real-valued function $2\cos t$ on…

A conference matrix of order $n$ is an $n\times n$ matrix $C$ with diagonal entries $0$ and off-diagonal entries $\pm 1$ satisfying $CC^\top=(n-1)I$. If $C$ is symmetric, then $C$ has a symmetric spectrum $\Sigma$ (that is,…

Motivated by recent results in the statistical physics of spin glasses, we study the recovery of a sparse vector $\mathbf{x}_0\in \mathbb{S}^{n-1}$, $\|\mathbf{x}_0\|_{\ell_0} = k<n$, from $m$ quadratic measurements of the form $…

We consider the Dirichlet-to-Neumann map $\Lambda$ on a cylinder-like Lorentzian manifold related to the wave equation related to the metric $g$, a magnetic field $A$ and a potential $q$. We show that we can recover the jet of $g,A,q$ on…

We critically discuss the problem of finding the $\lambda$-index $\mathcal{N}(\lambda)\in [0,1,\ldots,N]$ of a real symmetric matrix $\mathbf{M}$, defined as the number of eigenvalues smaller than $\lambda$, using the entries of…

All graphs considered are simple and undirected. The Inverse Eigenvalue Problem of a Graph $G$ (IEP-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$. A…

For a fixed quadratic polynomial $\mathfrak{p}$ in $n$ non-commuting variables, and $n$ independent $N\times N$ complex Ginibre matrices $X_1^N,\dots, X_n^N$, we establish the convergence of the empirical spectral distribution of $P^N…

We consider nonnormal matrix-valued dynamical systems with discrete time. For an eigenvalue of matrix, the number of times it appears as a root of the characteristic polynomial is called the algebraic multiplicity. On the other hand, the…