Skip to main content

All Questions

Filter by
Sorted by
Tagged with
8 votes
1 answer
358 views

Eigenvalues of a certain combinatorially defined matrix

Let $A_n$ be the matrix whose rows and columns are indexed by pairs $(i,j)$ with $1\leq i,j\leq n$ and $i\neq j$ (so $A$ is an $n(n-1)\times n(n-1)$ matrix), whose $((i,j),(k,l))$-entry is 0 if $i=k$ ...
Richard Stanley's user avatar
-5 votes
1 answer
86 views

Why is the second order correction to energy zero for a fully degenerate eigensystem? [closed]

Consider the system given by, $$ H|n\rangle = E|n\rangle$$ where: $H$ is the hamiltonian. $|n\rangle$ is the eigenstate. $E$ is the energy of the eigenstate. Using degenerate perturbation theory and ...
user544899's user avatar
0 votes
0 answers
46 views

max eigenvalue and schatten-1 norm of depolarizing channel acting on trace-0 Hermitian matrix

Denote $\mathcal{H}^n$ as the $n-$dimension Hermitian matrices. Depolarizing channel $\Delta_p:\mathcal{H}^2\to\mathcal{H}^2$ is defined as $\Delta_p(A)=p\text{ tr }(A)~I/2+(1-p)A$ where $A\in \...
qmww987's user avatar
  • 91
1 vote
3 answers
257 views

Eigenvalues of positive matrices in $\mathrm{SL}(d,\mathbb{Z})$

Let $A\in\operatorname{SL}(d,\mathbb{Z})$ be an irreducible positive matrix, i. e. $A=(a_{i,j})_{1\leq i,j\leq d}$ with $a_{i,j}\in\mathbb{Z}_{>0}$. From the Perron-Frobenius theorem, we know that $...
Yi SHI's user avatar
  • 11
4 votes
2 answers
587 views

Is this function injective?

For all given ordered lists $$\mathcal A=\big\{\{a_\mu\mid\mu=1,\cdots,N\}\mid\forall\mu,\nu> \mu,\ a_\mu > a_\nu\big\},$$ the function on the quotient space $$ G_\mu(a+\mathbb R: \mathcal A / \...
Gnaphalium's user avatar
0 votes
0 answers
28 views

Constructing random graphs with given eigenvalues and eigenvectors

In Linial's presentation on SOME PROBLEMS AND RESULTS IN THE GEOMETRY OF GRAPHS, on slide 7, some relations of properties of graphs to the eigenvalues of their adjacency matrix are listed, e.g. if $G$...
Manfred Weis's user avatar
  • 13.2k
0 votes
0 answers
15 views

Change in two spectral deviations due to edge deletion in a signed graph

Prove (or disprove) the following. Let $\Sigma=(G,\sigma)$ be a given signed graph. If $\lambda_1\ge\lambda_2\ge\cdots\ge \lambda_n$ and $\mu_1\ge\mu_2\ge\cdots \ge \mu_n$ are the eigenvalues of the ...
shahulhameed's user avatar
2 votes
1 answer
158 views

The relationship between a matrix and its coefficient matrix decomposed in Pauli matrix

For a dimension-$4$ Hermitian matrix $A$, denote pauli matrices $\{I,X,Y,Z\}$ as $\{\sigma_0,\sigma_1,\sigma_2,\sigma_3\}$ respectively. The pauli matrices form a basis of the matrix space if we take ...
qmww987's user avatar
  • 91
2 votes
1 answer
172 views

Diagonalize almost symmetric tridiagonal matrix

I begin with an $n \times n$ real symmetric tridiagonal matrix. However, I replace the non-zero elements in the first and last rows with zeros, so it is no longer symmetric $$M = \begin{bmatrix} 0 &...
Peter A's user avatar
  • 151
4 votes
1 answer
103 views

When do the nonzero eigenvalues of a directed graph Laplacian have the same absolute value?

Question: Let $G$ be a strongly connected directed graph on $n$ vertices with Laplacian $L(G)$. Then $L(G)$ has one zero eigenvalue $\lambda_1=0$ and $n-1$ nonzero eigenvalues $\lambda_2,\ldots,\...
Aditya Bandekar's user avatar
15 votes
1 answer
649 views

On minimal eigenvalue

Is it true that $\min\left(\lambda_{\min}(M_{12}),\lambda_{\min}(M_{13}),\lambda_{\min}(M_{23})\right) \le \frac{7}{20}$ where $M_{ij}$ is the matrix obtained by selecting the entries at the ...
Jasmine's user avatar
  • 178
7 votes
4 answers
557 views

Reference request: "Higher order eigentuples" as generalized eigenvectors?

I stumbled upon a cute generalization of the eigenvalue problem and would like to know if anybody has seen something like this and can provide references. The eigenvalue problem for a square matrix $M$...
Dirk's user avatar
  • 12.7k
0 votes
0 answers
22 views

Eigenvalues of Composition of Hadamard Operations of Low Rank Matrices

I am interested in the eigenvalues of $$ee^T \oslash (aa^T - a^{\odot2}(a^{\odot2})^T )^{\odot \frac{1}{2}},$$ where $a \in \mathbb{R}^n$ and $e$ is the vector with all entries equal to one. Can we ...
gandalfbalrogslayer's user avatar
0 votes
0 answers
77 views

Eigenvalues of N×N correlation matrices as N tends to infinity

I want to find a 𝑁×𝑁 positive definite correlation matrix, which ensures that as 𝑁 goes to infinity, only a finite number of eigenvalues remain non-zero, while the rest eigenvalues approach zero. ...
Zywoo_biu's user avatar
0 votes
1 answer
131 views

Function of eigenvalues of Laplacian matrix

Let $G$ be a simple $n$-vertex graph and let $\mu_n\geq\mu_{n-1}\geq\dots\geq\mu_1$ be the eigenvalues of its Laplacian matrix, how can I find a function $$f(\mu_1,\mu_2,\dots\mu_n) \text{ such that } ...
David's user avatar
  • 53
3 votes
1 answer
87 views

Low rank perturbation of non-Hermitian $A$, where all eigenvalues are real

Suppose $A,E$ are Hermitian $(n \times n)$-matrices and $E$ is of low rank. There are well known results bounding the difference in spectra of $A$ and $A+E$. For example the Eigenvalue Interlacing ...
Ben Deitmar's user avatar
  • 1,295
1 vote
0 answers
64 views

Reference request for non-banded Toeplitz matrix

I want to know references that treat the property of eigenvalues and eigenstates of the non-banded Toeplitz matrix. I mean for example, the Toeplitz matrix $A$ whose matrix element is given by $A_{ij}=...
hos's user avatar
  • 11
0 votes
0 answers
32 views

Eliminating nullity for enhanced non-singularity

If we have an $n\times n$ matrix $A$ with entries either $0$ or $1$, where all diagonal entries are $0$ and the rank is $k<n$, can we reach full rank by changing exactly $n-k$ zero off-diagonal ...
ABB's user avatar
  • 4,058
0 votes
2 answers
397 views

How to show the following matrix has eigenvalues $-d,-d+1,...,d$?

Consider the following $(2d+1)\times (2d+1)$ matrix: $$ A = \begin{pmatrix} 0 &\frac{2d}{2} & 0 &0 & \cdots &0 & 0 \\ \frac{1}{2} & 0 & \frac{2d-1}{2} &0& \...
Quokka's user avatar
  • 25
1 vote
1 answer
48 views

Iteration matrix representation with complex conjugate operator

I am studying the convergence of a particular class of radial power flows, whose goal is to obtain the voltage solution for a given electric grid, i.e., a complex vector $\mathbf{V}$ that gives the ...
ElectricPhysiscist's user avatar
2 votes
0 answers
81 views

Given a low-rank symmetric positive semidefinite matrix and a basis of its nullspace, is there a fast way to get the nonzero eigenvalues?

I have a (possibly dense) $k\times k$ real matrix $L = AA^T + B^T B$, a type of combinatorial Laplacian (self-adjoint, symmetric, positive semidefinite) of rank $(k-n)$ and possibly repeated nonzero ...
BenJones's user avatar
0 votes
1 answer
91 views

Matrix quantization and effect on singular values

Let $A$ and $B$ be an $N\times n$ matrix with $n\le N$, and let $\sigma_1(X),\dots \sigma_n(X)$ denote the singular values of $X\in \{A,B\}$. Do we have upper and lower bounds for $$ \| \sigma_i(A)-\...
ABIM's user avatar
  • 5,405
1 vote
0 answers
152 views

Eigenvalues of an Infinite Matrix - No Diagonal Dominance

I was wondering if anyone could help me or point me to resources to find the eigenvalue of the following infinite matrix: $g_{ij}=\text{exp}\left(\frac{-i j}{2}\right)$. Most resources I have found ...
Ellio's user avatar
  • 11
1 vote
0 answers
112 views

Perron-Frobenius theorem to positive delay differential equations

The Perron-Frobenius theorem is that the largest eigenvalue (in modulus) of a non-negative matrix is real (and simple) and corresponds to a non-negative eigenvector. It is applicable to the positive ...
IscoBerlin's user avatar
1 vote
0 answers
125 views

Transforming nilpotency into diagonalizability [closed]

We designate the $k$-th standard vector as $e_k$ in $\mathbb{C}^n$. We consider the backward shift operator, denoted as $T: \mathbb{C}^n \to \mathbb{C}^n$, which is defined as follows: $Te_1=0$ and $...
ABB's user avatar
  • 4,058
2 votes
1 answer
198 views

Eigenvectors and eigenvalues of a symmetric matrix and its entry-wise absolute value

The modulus of matrices is meant componentwise in the following. Let $H$ be a sqaure matrix that satisfies the following assumptions: $H$ is real-valued, symmetric, and positive-definite.. $H$ is ...
keisuke murota's user avatar
2 votes
0 answers
424 views

Functional continuity of eigenvalues?

We have the following theorems! Corollary VI.1.6 [Bhatia: Matrix Analysis]: Let $a_j(t)$, where $1\leq j \leq n$ be continuous complex valued functions defined on an interval $I$. Then there exists ...
VSP's user avatar
  • 233
6 votes
2 answers
254 views

Eigenvalues of polynomials of two matrices

In this question, the matrices are square and real and the polynomials have real coefficients, but feel free to mention other fields if that is interesting. Let $\chi(M)$ denote the characteristic ...
Brendan McKay's user avatar
0 votes
0 answers
99 views

Efficient method to determine minimum eigenvalue of $2 \times 2$ block diagonal matrix

Suppose $H$ is a $2 \times 2$ block-diagonal symmetric matrix in $\mathbb{R}^{2^N \times 2^N} $. That is $$ H = \begin{pmatrix} A_1 & 0 & \cdots & 0\\ 0 & A_2 & \cdots & 0 \\ ...
KAJ226's user avatar
  • 131
0 votes
0 answers
83 views

When is the sum of matrices (circulant + [super upper triangular]) not diagonalizable?

By the circulant matrix $C \in M_n(\mathbb{R})$, we mean that $$ C = \left[\begin{array}{c|c|c|c} e_n & e_1 & \cdots & e_{n-1} \end{array}\right] $$ where $e_1,\dots,e_n$ are the standard ...
ABB's user avatar
  • 4,058
2 votes
1 answer
133 views

Is the sum of the circulant matrix with a super upper triangular matrix diagonalizable?

By the circulant matrix $C$ in $M_n(\mathbb{R})$, we mean that $$C=[e_n|e_1|\cdots|e_{n-1}]$$ where $e_1,\cdots,e_n$ are the standard basis vectors in $\mathbb{R}^n$. It is well-known that $$C=\...
ABB's user avatar
  • 4,058
0 votes
0 answers
74 views

Computing the eigenvalues of $A+E$ where $A$ is an upper triangular matrix whose diagonal entries are all zero and $E$ is a rank one matrix

Let us consider the backward-shift matrix $B=(b_{ij})\in M_n(\mathbb{R})$ whose entries are given by $b_{k,k+1}=1$ and the other entries are all 0. We also consider $X=(x_{ij})\in M_n(\mathbb{R})$ ...
ABB's user avatar
  • 4,058
1 vote
1 answer
198 views

Directed graph whose adjacency matrix admits only 0 as eigenvalue

Let $G$ be a directed graph and let $P_i$ be its vertices. Let $A$ be the corresponding adjacency matrix of $G$, i.e. $a_{i,j}=1$ if and only if there is a directed edge from $P_i$ to $P_j$, ($a_{i,...
ABB's user avatar
  • 4,058
11 votes
2 answers
1k views

Is the eigenvalue map open?

The eigenvalue map in question is $\sigma: {\mathfrak gl}(\mathbb{C}, n) \to S_n \backslash \mathbb{C}^n$, from $n$ by $n$ complex matrices to $\mathbb{C}^n$ vectors modulo permutation of entries by $...
Lucas Seco's user avatar
  • 1,123
0 votes
1 answer
310 views

Eigenvalues of $\operatorname{diag}({\bf v}) - {\bf v} {\bf v}^\top - \alpha({\bf v} - {\bf w})({\bf v} - {\bf w})^\top$

Given vectors ${\bf v}, {\bf w} \in [0,1]^n$ , where $n \in \mathbb{N} \setminus \{0\}$, and $\alpha > 0$, I would like to find the eigenvalues of the following matrix. $$\operatorname{diag}({\bf v}...
CereIssou's user avatar
1 vote
0 answers
223 views

Fastest algorithm for finding the closest semi-definite matrix?

Given a real-valued, symmetric matrix $A \in \mathbb{R}^{n \times n}$, I'm interested in finding the closest positive semi-definite matrix $X^*\in \mathbb{R}^{n \times n}$: $$ X^* = \mathop{\text{...
Alec Jacobson's user avatar
5 votes
2 answers
721 views

Matrices with same eigenvalues

This question is a more precise version of this question. Let's assume we have the matrix $$\left( \begin{array}{ccccc} 0 & a & 0 & 0 & 0 \\ f & 0 & b & 0 & 0 \\ 0 &...
António Borges Santos's user avatar
3 votes
1 answer
309 views

Eigenvalues two-fold degenerate

Consider the matrix $$A:=\left( \begin{array}{cccc} 0 & a & 0 & 0 \\ f & 0 & b & 0 \\ 0 & e & 0 & c \\ 0 & 0 & d & 0 \\ \end{array} \right)$$ I ...
António Borges Santos's user avatar
1 vote
0 answers
179 views

QR algorithm for eigenvalues and eigenvectors of large symmetric matrices

I am trying to write a QR algorithm in Python for eigenvectors and eigenvalues finding for large symmetric matrices, My initial thought was to use Householder transformation with a Wilkinson shift ...
Daniel Belaish's user avatar
1 vote
1 answer
136 views

Matrix transformation that always works?

Consider the matrix $$A_2:= \begin{pmatrix} a & b_1 \\ b_2 & a\end{pmatrix}.$$ Let $\sigma_2 = \begin{pmatrix} 0 & i \\ -i & 0 \end{pmatrix}$, then $$\sigma_2 A_2 \sigma_2 = \begin{...
António Borges Santos's user avatar
0 votes
0 answers
205 views

Prove that sum of eigenvalues of the inverse of an nxn correlation matrix A is greater than or equal to n

I stuck on this question and here is my thoughts: So we have a nxn correlation matrix A with eigenvalues: λ_1,λ_2,...,λ_n 1.According to the property of correlation matrix, (λ_1)+(λ_2) + ... + (λ_n) = ...
ux__'s user avatar
  • 1
1 vote
0 answers
138 views

Generalized eigenvalues of block matrix

Let $A, D \in \mathbb{R}^{n\times n}$ be symmetric matrices and consider the following matrix pencil $$ \begin{pmatrix} -I & A+\lambda I \\ A+\lambda I & -D \\ \end{pmatrix} $$ If we already ...
bernard's user avatar
  • 205
0 votes
1 answer
224 views

Faulty algorithm for simultaneous diagonalization?

I found a simple algorithm for simultaneous diagonalization of two commuting matrices (Nordgren - Simultaneous Diagonalization and SVD of Commuting Matrices), which seemed to be well-founded. For ...
TobiR's user avatar
  • 103
1 vote
0 answers
114 views

Higher dimensional Cauchy interlacing theorem

If $A$ is a Hermitian matrix and $A_j$ the principal minor with the $j$ row and column deleted and $\phi_A(x)$ the characteristic polynomial. The Cauchy interlacing iheorem states that the roots of $\...
CHUAKS's user avatar
  • 1,362
2 votes
1 answer
299 views

Eigenvalues of a specific matrix

I have a block matrix $$M=\begin{bmatrix} I_0& I_1& \cdots& I_1\\ I_2& I_0& \ddots& \vdots\\ \vdots& \ddots& \...
Young Q's user avatar
  • 43
0 votes
0 answers
107 views

The eigenstructure of the symmetric tridiagonal matrix whose entries are $a_{kk}=\cos\frac{k\pi}{n+1}$ and $$a_{1,2}=\cdots=a_{n-1,n}=1$$

Suppose that $A=(a_{kl})_{k,l=1}^n$ is a symmetric tri-diagonal matix in $M_n(\mathbb{R})$ whose diagonal entries are $a_{kk}=\cos\frac{k\pi}{n+1}$ and $$a_{1,2}=\cdots=a_{n-1,n}=1$$ Any approach to ...
ABB's user avatar
  • 4,058
0 votes
0 answers
124 views

Eigenvectors of the symmetric tridiagonal matrices whose entries above the diagonal are all the same

Let us consider the real symmetric tridiagonal matrix $T=(t_{kl})$ in $M_n(\mathbb{R})$ with $$t_{1,2}=t_{2,3}=\cdots=t_{n-1,n}=1$$ How can we compute the eigenvectors of $T$?
ABB's user avatar
  • 4,058
2 votes
1 answer
75 views

The eigenvalues of the product $WD$ for some particular matrices

Let $D$ be a diagonal matrix in $M_{2n}(\mathbb{R})$ such that $D^2=I$ and Trace$(D)$=0 Suppose that $e_k$s are the standard vectors in $\mathbb{R}^{2n}$, that is $$e_k=(0,\cdots 0,1,0,\cdots,0)^t$$...
ABB's user avatar
  • 4,058
0 votes
1 answer
75 views

The spectrum of the product $JA$ where $J=I_n\oplus (-I_n)$

Let $A$ be a real symmetric matrix in $M_{2n}(\mathbb{R})$with $A^2=I_{2n}$. Suppose that the Schur decomposition of $A$ is given by $A=\Lambda^t D \Lambda$. Let us consider the following matrix. $$...
ABB's user avatar
  • 4,058
4 votes
1 answer
187 views

largest eigenvalue of the difference between two quadratic forms

Let $U,V\in\mathbb{R}^{4\times n}$ such that $UU^T=VV^T=I$, and $A\in\mathbb{R}^{n\times n}$ be an Hermitian matrix. Is it true that $$\sqrt{\lambda_{\text{max}}\left(\left(UAU^T-VAV^T\right)^2\right)}...
Student88's user avatar
  • 503

1
2 3 4 5
9