Related papers: The Horn Problem for Real Symmetric and Quaternion…

In this work, we study the spectral properties of matrix Hamiltonians generated by linearizing the nonlinear Schr\"odinger equation about soliton solutions. By a numerically assisted proof, we show that there are no embedded eigenvalues for…

Computing the eigenvectors and eigenvalues of a perturbed matrix can be remarkably difficult when the unperturbed matrix has repeated eigenvalues. In this work we show how the limiting eigenvectors and eigenvalues of a symmetric matrix…

We study moments of characteristic polynomials of truncated Haar distributed matrices from the three classical compact groups O(N), U(N) and Sp(2N). For finite matrix size we calculate the moments in terms of hypergeometric functions of…

In the first part of the paper, we discuss eigenvalue problems of the form -w"+Pw=Ew with complex potential P and zero boundary conditions at infinity on two rays in the complex plane. We give sufficient conditions for continuity of the…

The spectra of signed matrices have played a fundamental role in social sciences, graph theory, and control theory. In this work, we investigate the computational problems of identifying symmetric signings of matrices with natural spectral…

A real square matrix is Perron-like if it has a real eigenvalue $s$, called the principal eigenvalue of the matrix, and $\mbox{Re}\,\mu<s$ for any other eigenvalue $\mu$. Nonnegative matrices and symmetric ones are typical examples of this…

This paper introduces a method for computing eigenvalues and eigenvectors of a generalized Hermitian, matrix eigenvalue problem. The work is focused on large scale eigenvalue problems, where the application of a direct inverse is out of…

We show that the authors of the commented paper draw their conclusions from the eigenvalues of truncated Hamiltonian matrices that do not converge as the matrix dimension increases. In one of the studied examples the authors missed the real…

Given two real symmetric matrices, their eigenvalue configuration is the relative arrangement of their eigenvalues on the real line. In this paper, we consider the following problem: given two parametric real symmetric matrices and an…

The singular values of products of standard complex Gaussian random matrices, or sub-blocks of Haar distributed unitary matrices, have the property that their probability distribution has an explicit, structured form referred to as a…

Products and sums of random matrices have seen a rapid development in the past decade due to various analytical techniques available. Two of these are the harmonic analysis approach and the concept of polynomial ensembles. Very recently, it…

Inspired by the quantum computing algorithms for Linear Algebra problems [HHL,TaShma] we study how the simulation on a classical computer of this type of "Phase Estimation algorithms" performs when we apply it to solve the Eigen-Problem of…

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…

We prove a conjecture made by the first author: given an n-body central configuration X_0 in the euclidean space R^{2p}, let Im F be the set of ordered real p-tuples {\nu_1,\nu_2,...,\nu_p} such that {\pm i\nu_1,\pm i\nu_2,...,\pm i\nu_p}…

We study the convergence properties of a pair of learning algorithms (learning with and without memory). This leads us to study the dominant eigenvalue of a class of random matrices. This turns out to be related to the roots of the…

While dealing in [1] with the supersymmetry of a tridiagonal Hamiltonian H, we have proved that its partner Hamiltonian H(+) also have a tridiagonal matrix representation in the same basis and that the polynomials associated with the…

I review aspects of work done in collaboration with A. Zee and R. Scalettar \cite{fz1,fz2,fsz} on complex non-hermitean random matrices. I open by explaining why the bag of tools used regularly in analyzing hermitean random matrices cannot…

We calculate the autocorrelation functions (or shifted moments) of the characteristic polynomials of matrices drawn uniformly with respect to Haar measure from the groups U(N), O(2N) and USp(2N). In each case the result can be expressed in…

We consider the hermitian random matrix model with external source and general polynomial potential, when the source has two distinct eigenvalues but is otherwise arbitrary. All such models studied so far have a common feature: an…

We study complex eigenvalues of large $N\times N$ symmetric random matrices of the form ${\cal H}=\hat{H}-i\hat{\Gamma}$, where both $\hat{H}$ and $\hat{\Gamma}$ are real symmetric, $\hat{H}$ is random Gaussian and $\hat{\Gamma}$ is such…