All Questions

Is there a good analytic upper bound on the largest eigenvalue of a real symmetric n*n matrix with all main diagonal entries strictly positive, all other entries <=0 with typically many of them ...

I have the following problem: I need to find the fastest way to calculate the eigenvalues of a matrix that is the product of two Toeplitz matrices. $B = A U$. The first is a regular Toeplitz matrix $A$...

Given $A \in \mathsf{M}_n(\mathbb{C})$ (no special structure) is it (generally) faster to compute its eigenvalues or the coefficients of its characteristic polynomial? References/insights would be ...

An Exceptional point generally occurs in eigenvalue problems in which the matrix is dependent on some parameter(s). The particular point in which the eigenvalues become degenerate for the parameter(s) ...

Let $Q=(q_{j,k})_{1\le j,k\le N}$ be a (Hermitian) $N\times N$ matrix with complex-valued entries. The matrix $Q$ is given numerically and the absolute error on each entry is bounded above by a (small)...