4
votes
2answers
174 views

Is there an easy way to tell if all eigenvalues of a unitary or self-adjoint matrix only have eigenvalues of multiplicity two?

I am interested in a class of $2n\times 2n$ unitary matrices with complex entries (if you prefer, we can replace "unitary" with "self-adjoint"). I know that all the eigenvalues of matrices in this ...
3
votes
1answer
114 views

Alike looking matrices imply convergence of eigenvalues?

This is a question about convergence of eigenvalues which essentially came up in studying the spectrum of St.-Liouville operators. We want to look at matrices that agree in most of their entries and ...
2
votes
1answer
86 views

Comparison of the smallest eigenvalues of two tridiagonal matrices

Let $n\geq2$ be an integer and $E_{ii}$ for an integer $2\leq i\leq n$ be the $n\times n$-matrix with its $ii$-entry equal to 1 and remaining entries equal zero. Furthermore, let ...
1
vote
1answer
66 views

Maximising a Rayleigh quotient over a subspace

Let $M\in\mathbb{R}^{n\times n}$ be symmetric positive definite and consider a matrix $Q\in\mathbb{R}^{n\times m}$ ($m<n$) with orthonormal columns ($Q^TQ=I$). I'm interested in finding an exact ...
2
votes
0answers
115 views

Algorithms to compute largest gap between smallest nonzero eigenvalues of sparse symmetric matrix

I am looking mainly for implementations but also for theoretical algorithms to compute gaps between smallest positive eigenvalues of symmetric, singular matrix or real numbers. To be precise, I want ...
2
votes
3answers
246 views

LU decomposition

Consider a $N \times N$ symmetric real matrix $A$: $A_{ij} = (\sum_{k=1}^N n_{ik}) \delta_{ij} - n_{ij}$, where $n_{ij}$ is a real symmetric matrix whose elements are equal to $1$ or $0$. $A$ has one ...
0
votes
0answers
90 views

How could I prove this equality for eigenvalues of Laplacian matrix?

I would be glad if you have some comments that how I could prove following statement. Suppose that graph $G =(N, E)$ be given. The the following program computes the $k$-smallest eigenvalues of the ...
7
votes
1answer
718 views

Frobenius-Perron eigenvalue and eigenvector of sum of two matrices

Suppose that I have two positive matrices, $A$, and $B$, and I know their Frobenius-Perron eigenvalues ($\lambda_A$, $\lambda_B$) and eigenvectors ($v_A$, $v_B$). I'm interested in what I can say ...
5
votes
1answer
209 views

Separating the spectrum of a Hermitian matrix

Given Hermitian matrix $A$, I would like to perturbate it so that its eigenvalues become well-separated. Specifically, let $A$ be some Hermitian matrix, and let $G$ be a Gaussian matrix, with each ...
2
votes
1answer
154 views

When is there a solution to these coupled eigenvalue equations?

I am trying to find the fixed point of a dynamical system, which requires solving two coupled eigenvalue-like equations. These equations are, in general, overconstrained. I'd like to have a simple ...
2
votes
0answers
268 views

eigenvalues of a symmetric tridiagonal matrix with zero diagonals

I was investigating a problem and came up with the following symmetric tridiagonal matrix (with zero diagonal elements): $$ \left(\begin{array}{cccccc} 0 & a & 0 & \ldots & 0 \\ a ...
2
votes
2answers
149 views

Is my use of the eigendecomposition correct here?

I'm exploring different techniques to efficiently solve some matrix equations. My situation is that I have a matrix $\textbf{H} = \textbf{J}^T \textbf{J}$, where $\textbf{J}$ is a matrix with no ...
-1
votes
1answer
207 views

Upper bound on iterations count for power iteration algorithm

I'm stuck trying to get upper bound on iterations count for power iteration algroithm for finding first eigenvalue of adjacency matrix $A$ given tolerance value. I've tried to figure something out ...
0
votes
2answers
223 views

Eigenvalues of an amplification matrix

Let $A$ and $B$ square real matrices. I know that the matrix $A+B$ has 1 as eigenvalue of multiplicity 1 and the others eigenvalues have their modulus <1. Can we say something about the eigenvalues ...
3
votes
1answer
573 views

Connection between eigenvalues of matrix and its Laplacian.

Hello! There are two definitions of graph spectrum: 1) Eigenvalues of adjacency matrix $A$. 2) Eigenvalues of Laplacian of adjacency matrix ($L$). Different sources offer different properties based ...
1
vote
0answers
378 views

Eigenvalue problem for symmetric block tridiagonal matrices?

Is there a procedure to find the eigenvalues of $\textbf{M}$? ‎ $$\begin{eqnarray} ‎\textbf{M}=\left[‎ ‎\begin {array}{ccccc}‎ ‎\textbf{A} & \textbf{B} & & &\\‎ ...