All Questions
Tagged with eigenvector eigenvalues
133 questions
-1
votes
0
answers
81
views
Can the higher order corrections to energy be calculated the same way in degenerate perturbation theory as with non-degenerate perturbation theory?
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.
Now from non-degenerate perturbation ...
- 23
1
vote
0
answers
64
views
Eigenvalues and eigenvectors of the path Laplacian
Consider the Laplacian matrix of the path graph:
$$
L = \begin{bmatrix}
1 & -1 & 0 & \cdots & 0 & 0\\
-1 & 2 & -1 & \cdots & 0 & 0\\
0 & -1 & 2 & \...
- 11
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& \...
- 25
4
votes
1
answer
2k
views
Eigenvalues of a rank-one update of a symmetric matrix
I have a matrix $A$ $(n\times n)$ with eigenvalues $\lambda_i$, then I add another matrix to it as: $A+xx^\top$ where $x$ $(n\times 1)$ is a column vector.
and also $A=yy^\top$ with $y$ a $(n-1)$ rank ...
- 63
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.
...
2
votes
0
answers
86
views
Smallest eigenvalue of certain PD matrix decreases under sparse perturbation
Let $\omega_1<\dots<\omega_n\in\mathbb{R}$. Then, define $G\in\mathbb{C}^{n\times n}$ such that $G_{k\ell}=\frac{1}{1-i(\omega_\ell-\omega_k)}$. For example, if $n=3$ we obtain $$ G=\begin{...
- 83
2
votes
0
answers
143
views
Convergence of eigenfunctions
In their 1999 paper "Sturm-Liouville operators with singular potentials", Savchuk and Shkalikov prove the uniform resolvent convergence of an operator $L_\varepsilon \rightarrow L$ for $\...
1
vote
0
answers
183
views
Connection of eigenspace of finite Hilbert matrix and its continuous operator counterpart
I am trying to understand the connection between the eigenspace of the continuous operator
$$
H(x,y) = \frac{1}{x+y}
$$
which is nothing but the square of the Laplace operator, and its discrete ...
- 33
2
votes
1
answer
229
views
Given an eigenvalue equation (elliptic PDE) in a ball $B_R$, prove the convergence of the first nonzero $\lambda_R$ and its eigenfunction $\phi_R$
Let $H: \mathbf{R}^n \rightarrow \mathbf{R}$ be a bounded continuous function. Set
$$\tag{1}
\int_{\mathbf{R}^n}\left\{|\nabla \xi|^2+H(x) \xi^2\right\} \mathrm{d} x \geqslant 0, \quad \forall \xi \in ...
- 809
1
vote
2
answers
416
views
Eigenvectors of a non-symmetric rank-one update of a symmetric matrix
I have a matrix $A$ $(n\times n)$ with eigenvalues $\lambda_i$, then I add another matrix to it as: $A+uv^\top$ where $u$ $(n\times 1)$ and $v$ $(n\times 1)$ are column vector. Also, $A=yy^\top$ with $...
- 63
3
votes
1
answer
370
views
The eigenvalues of the matrix $\Big(\frac{1}{\cos(k-l)\frac{\pi}{n}}\Big)_{k,l=1}^n$
What are the eigenvalues/eigenvectors of the matrix $A=\Big(\frac{1}{\cos(k-l)\frac{\pi}{n}}\Big)_{k,l=1}^n$ when $n$ is odd?
- 4,058
1
vote
0
answers
238
views
Construct a permutation matrix from some eigenvectors and eigenvalues
Given $n$ orthonormal vectors $v_1, \dots, v_n \in \mathbb R^d$, where $d > n$, we can show that there are many orthogonal matrices $X$ of size $d$ such that $v_1, \dots, v_n$ are eigenvectors of $...
- 111
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,...
- 4,058
6
votes
0
answers
189
views
Measurability of eigenvalues-eigenvectors of a positive compact operator
Let $H$ be a separable Hilbert space over $\mathbb{R}$. Let ${A} = \{a\colon H\to H\,|\,a\text{ is a positive, compact linear operator}\}$.
By the spectral theorem, given $a \in A$, there are scalars $...
- 163
1
vote
0
answers
190
views
Eigenvalues/eigenfunctions of a diffusion generator
Consider the following symmetric second order diffusion operator, defined, for $\phi \in \mathcal{C}^{2,1}_c\left(\mathbb{R}\times \mathbb{R}_+\right)$, by:
$$L\phi := \lambda_1 \partial_{R_1}(R_1 \...
- 63
3
votes
2
answers
394
views
Eigenvalues and eigenvectors of non-symmetrical tridiagonal matrix
The question is the following: given a matrix
$$A=\begin{pmatrix}
1& 2 & & & & \\
1& 0& 1 & & & \\
& 1& 0& 1 & &\\
& &...
- 145
0
votes
1
answer
226
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 ...
- 103
10
votes
2
answers
473
views
Support of eigenvectors
Consider the $N$ by $N$ matrix
$$M_N= \begin{pmatrix} 1+3\lambda & -1-2\lambda & - \lambda & 0 & 0 &0 &0\\
-1-2\lambda & 2+3\lambda & -1 & -\lambda & 0 & 0 &...
- 192
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{...
0
votes
0
answers
108
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 ...
- 4,058
2
votes
1
answer
76
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$$...
- 4,058
2
votes
1
answer
1k
views
Diagonalizing a symmetric block matrix
Let us consider the matrix
$$ A = \begin{pmatrix} a & c+ib \\ c-ib& a \end{pmatrix},$$
then this matrix has eigenvalues $a\pm \sqrt{c^2+b^2}.$
Now, let us consider a block matrix
$$ A = \begin{...
- 29
0
votes
0
answers
149
views
Diagonalizing a specific case of symmetric block matrix
Let's consider the following block matrix
$$ M = \begin{pmatrix}D&A^T\\A&-D\end{pmatrix},$$
where $A$ and $D$ are $n \times n$ matrices. The diagonal matrix $D$ is defined by $D_{kk} = k \...
- 1
1
vote
2
answers
449
views
Transforming matrix to off-diagonal form
I wonder if one can write the following matrix in the form $A = \begin{pmatrix} 0 & B \\ B^* & 0 \end{pmatrix}.$
The matrix I have is of the form
$$ C = \begin{pmatrix} 0 & a & b & ...
- 536
1
vote
0
answers
137
views
What are the eigenvalues/eigenvectors of the matrix $A=\Big(\frac{1}{\cos(k-l)\frac{\pi}{n}}\Big)_{k,l=1}^{\frac{n-1}{2}}$ when $n$ is odd?
Suppose that $n$ is odd. The eigen values/eigenvectors of the skew-circulant matrix $A=\Big(\frac{1}{\cos(k-l)\frac{\pi}{n}}\Big)_{k,l=1}^n$ are successfully computed in this post.
Q. What are ...
- 4,058
0
votes
0
answers
273
views
Finding the eigenvectors of a submatrix
Let $A=(a_{kl})$ be a matrix in $M_n(\mathbb{R})$ when $n$ is even. Let $B=(b_{kl})$ be the symmetric $2n$ by $2n$ matrix whose entries are given by,
$b_{k,l}=a_{kl}$ if $1\leq k,l\leq n$.
$b_{n+k,l}=...
- 4,058
10
votes
2
answers
615
views
Lower eigenvectors of nonnegative matrices with zero trace
Let $A$ be an $N\times N$ nonnegative matrix with all diagonal entries equal to zero and such that there is $n_0$ such that all entries of $A^{n_0}$ are strictly positive. Let $\lambda_1,\ldots, \...
- 1,897
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.
$$...
- 4,058
0
votes
1
answer
363
views
Are there zero entries in the eigenvector corresponding to a simple eigenvalue?
For a real symmetric matrix $M$ and a simple eigenvalue $\lambda$, under which conditions the corresponding eigenvector has no zero entries? Perhaps, this is unconditional and one can provide a proof?
- 1
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})$ ...
- 4,058
1
vote
0
answers
293
views
Eigenvalue decomposition of normalized adjacency matrix
Let $A$ be an adjacency matrix of undirected graph $G$, where $G$ is a connected graph. The normalized adjacency matrix is defined as $\hat{A}=D^{-1/2}AD^{-1/2}$, where $D$ is degree matrix of graph $...
- 11
11
votes
1
answer
2k
views
Eigenvalues of the complement of a graph
Let $A$ and $\widetilde A$ be the adjacency matrices of a graph $G$ and of its complement, respectively.
Is there any relation between the eigenvalues of $A + \widetilde A$ and the eigenvalues of $A$ ...
- 1,269
3
votes
0
answers
47
views
What is the supremum of 1-dim Hausdorff measure of the nodal set of Neumann eigenfunction $u$ for planar convex domain
All descriptions of this question are limited to 2-dimension for simplicity. Recently, I read some papers on the nodal set of Laplacian eigenfunctions. Denote $\Sigma=\{u(x)=0\}$ be the nodal set of a ...
- 131
12
votes
2
answers
2k
views
What is known about the eigenvectors of the $2^n \times 2^n$ Hadamard matrix?
What is known about the eigenvectors of the $2^n \times 2^n$ Hadamard matrix defined recursively by $H_1=(1)$ and $$ H_N=\begin{pmatrix}H_{N/2} & H_{N/2} \\ H_{N/2} & -H_{N/2}\end{pmatrix}, $$ ...
- 1,324
13
votes
3
answers
3k
views
Differentiability of Eigenvalues - Perturbation Theory
first, I have a general question. In perturbation theory, I saw perturbations in eigenvalues and eigenvectors of square, non-symmetric matrices and the calculations were all right but no one ever ...
- 138
1
vote
0
answers
474
views
When must an eigenvector have only non-negative entries?
What would be a reasonable sufficient condition on a real symmetric matrix that would force its eigenvector with largest eigenvalue (or one of its eigenvectors with maximal eigenvalue) to have only ...
- 20.2k
1
vote
1
answer
468
views
Trace minimization for generalized eigenvalue problem
In [1], it is shown in theorem 1.2 that for symmetric $n \times n$ matrices $A$, $B$, we have
$$
\min_{Y \in Y^*} \text{tr}(Y^TAY) =
\text{tr}(X^TAX) =
\sum_{i=1}^p \lambda_i,
$$
with
$$
\text{
$X^...
- 21
8
votes
1
answer
5k
views
Eigenvectors of Kronecker Product [closed]
Conjecture If $A$ and $B$ are two complex square matrices, then every eigenvector of $A\otimes B$ is of the form $x\otimes y$, where $x$ is an eigenvector of $A$ and $y$ is an eigenvector of $B$.
...
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 ...
2
votes
1
answer
294
views
Find a way to apply the MLE on Fisher or Covariance matrix to make cross-correlations
I have 2 Fisher matrixes which represent information for the same variables (I mean columns/rows represent the same parameters in the 2 matrixes).
Now I would like to make the cross-correlations ...
1
vote
1
answer
176
views
Derivative of eigenpair with respect to matrix
Suppose that $A$ is real and symmetric matrix (or tensor) of dimension $3 \times 3$, with its spectral decomposition
$$A = \sum_{i=1}^3 \lambda_i\ n_i\otimes n_i$$
where $\lambda_i$, $n_i$ and $\...
- 13
0
votes
0
answers
125
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$?
- 4,058
1
vote
0
answers
274
views
Find the eigenvectors from the QR algorithm in the unsymmetric case
It is possible to find many references describing the QR Algorithm with more or less refinements to approximate the eigenvalues of a square matrix $A\in\mathbb{R}^{n\times n}$.
I implemented a version ...
- 11
1
vote
1
answer
2k
views
Eigenvalues of adjacency matrix of a k-regular graph
If $A_G$ is the adjacency matrix of a k-regular graph, let $B = J+xA_G$, where J is the matrix whose elements are all 1s and $x\in R$ is a scalar. If $\lambda_1\geq\lambda_2\geq \dots \geq \lambda_n$ ...
- 33
0
votes
0
answers
327
views
Eigenvector to zero eigenvalue of general Laplacian
I was wondering what we can say about the eigenvectors of a matrix $A$ fullfilling $Ax =0$ where $A$ is symmetric with a diagonal equal to one and every row sums up to 0. Obviously this is a ...
15
votes
4
answers
7k
views
Eigenvectors and eigenvalues of a tridiagonal Toeplitz matrix
Is it possible to analytically evaluate the eigenvectors and eigenvalues of the following $n \times n$ tridiagonal matrix
$$
\mathcal{T}^{a}_n(p,q) = \begin{pmatrix}
0 & q & 0 & 0 &...
- 153
1
vote
1
answer
526
views
Simultaneous diagonalization in Matlab [closed]
Crossposted from StackOverflow. The generalised diagonalization of two matrices $A$ and $B$ can be done in Matlab via
[V,D] = eig(A,B);
where the columns of $V$ ...
- 209
0
votes
1
answer
820
views
What are the eigenvalues and eigenvectors of a composition of two arbitrary linear transformations? [closed]
Let $S$ and $T$ be two linear transformations on $\mathbb{R}^n$. We can find the eigenvalues and eigenvectors of $S$ and $T$. I am trying to find out the relation(s) among the eigenvalues and ...
- 930
1
vote
2
answers
153
views
From one eigenvector to many, in a very local graph?
Let $\Gamma$ be an undirected graph of bounded degree $d$ with $V = \{1,2,\dotsc,N\}$ as its set of vertices, and edges only between vertices that are at a distance $\leq M$ apart (where $M$ is much ...
- 20.2k
2
votes
1
answer
3k
views
Lanczos algorithm for finding $k$ smallest eigenvector
I am trying (and have been recommended) to use the Lanczos algorithm to find the $k$ smallest eigenvectors. However, all of the literature seems to talk about this algorithm as a way to estimate the $...
- 21