# Questions tagged [eigenvector]

The eigenvector tag has no usage guidance, but it has a tag wiki.

273
questions

-5
votes

0
answers

50
views

### Given the eigenvalues of a matrix, can one find the eigenvectors? [closed]

If only the eigenvalues and the dimensions of a square matrix are given, is it possible to find the eigenvectors or more information about the matrix? I am trying to find $SS^{-1}$, but I'm a bit ...

1
vote

0
answers

83
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 \...

0
votes

0
answers

43
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})$ ...

3
votes

1
answer

47
views

### Why does the normalization term disappear when computing the MLE of decomposed Gaussians

Computing the Maximum Likelihood Estimator of Gaussians in arbitrary finite Hilbert spaces seems no easy task and I must admit to lamentably fail at it. The classical theory most often relies on ...

0
votes

0
answers

54
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 $...

1
vote

1
answer

58
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,...

2
votes

1
answer

96
views

### The eigenvectors of adding a particular rank one matrix to the circulant matrix

Suppose that $e_1, \cdots, e_n$ are the standard vectors of the Euclidean space $\mathbb{R}^n$.
Let us consider the backward shift operator $T:\mathbb{R}^n\to \mathbb{R}^n$ given by $Te_k=e_{k-1}$ ...

2
votes

1
answer

94
views

### Are these the only first eigenfunctions on a hemisphere?

Let $\mathbb{S}^2_+$ denote the closed upper hemisphere of the unit round sphere in $\mathbb{R}^3$. It is well known that the first positive eigenvalue of the Laplacian on the closed unit sphere is $2$...

1
vote

0
answers

40
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 ...

1
vote

1
answer

112
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{...

3
votes

1
answer

261
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 ...

1
vote

0
answers

56
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 $...

1
vote

0
answers

64
views

### Are eigenfunctions of the Dirichlet problem for the Laplace equation uniformly bounded?

Let $Q\subset \mathbb R^n$ be a bounded domain with boundary $\partial Q\in C^\infty$ and $\varphi_1,\varphi_2,\ldots$ are eigenfunctions of the Dirichlet problem for the Laplace equation in $Q$ ...

0
votes

1
answer

101
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 ...

0
votes

0
answers

93
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 ...

0
votes

0
answers

60
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$?

1
vote

0
answers

40
views

### CLT of the left singular vectors of i.i.d. data matrix

Let $\mathbf{X}$ be $(n \times p)$-dimensional random matrix ($n > p$) whose rows $\mathbf{x}_i$ are i.i.d. with some finite moments:
$$
\mathbf{X}^\top = [\mathbf{x}_1, \ldots \mathbf{x}_n]^\...

1
vote

1
answer

56
views

### Asymptotic property of the left singular vectors of i.i.d. data matrix

Let $\mathbf{X}$ be $(n \times p)$-dimensional data matrix ($n > p$) whose rows $\mathbf{x}_i$ are i.i.d. with some finite moments:
$$
\mathbf{X}^\top = [\mathbf{x}_1, \ldots \mathbf{x}_n]^\top.
...

2
votes

1
answer

189
views

### Are Neumann Laplacian eigenfunctions in $C(\overline{\Omega})$?

Consider that $u\in H^1(\Omega)$ with $\Delta u\in L^2(\Omega)$ (in the distributional sense) such that for some $\lambda>0$ we have that:
$$\begin{cases} \Delta u(x)=\lambda u(x), & x\in\Omega\...

2
votes

1
answer

66
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$$...

1
vote

1
answer

73
views

### Convergent condition of the high-dimensional submatrix of some orthogonal matrix

Let $\mathbf{V}$ be a $p\times p$ orthogonal matrix (i.e., $\mathbf{V}\mathbf{V}^\top = \mathbf{V}^\top \mathbf{V} = \mathbf{I}$) whose columns are
$$
\mathbf{V} = \begin{bmatrix} \mathbf{v}_1 & \...

0
votes

1
answer

69
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.
$$...

3
votes

0
answers

91
views

### Recovering the matrix when the Schur decomposition of its blocks are known

Let E be a real symmetric matrix in $M_n(\mathbb{R})$ where $ n=2m$ and
$$E=\left(\begin{array}{cc}
G & X \\
X^t & H
\end{array}\right)$$
where $G,H,X$ are $m\times m$ matrices.
Suppose that $...

0
votes

0
answers

51
views

### Properties on the eigenvalues of a random binary matrix

I'm considering a problem related to the spectral properties (singular values, eigenvalues and eigenvectors) of large, random binary matrices. In case this can help situate my background, I am aware ...

3
votes

1
answer

177
views

### The proof of the invertibility of $\Big( \sin\frac{8kl\pi}{2n+1} \Big)_{k,l=1}^\frac{n}{2}$

Suppose that $n$ is even. Any suggestion/appraoch to prove that $S=\Big( \sin\frac{8kl\pi}{2n+1} \Big)_{k,l=1}^\frac{n}{2}$ is invertible?

1
vote

0
answers

85
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 ...

2
votes

1
answer

261
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?

1
vote

1
answer

123
views

### The dimension of the eigenvector space of non-negative irreducible matrices

Let $A$ be an irreducible non-negative matrix. Is it true that the eigenvectors of $A$ can span the $R^n$ ?
Or are all the eigenvalues of $A$ distinct?

0
votes

0
answers

39
views

### What information concerning the eigen-structure are transformed on the antidiagonal submatrices?

Let us fix symmetric matrices $A_1$ $A_2$ in $M_m(\mathbb{R})$ with $A^2_1=\alpha I$ and $A^2_2=\beta I$ for some positive $\alpha ,\beta$. For a given matrix $B\in M_m(\mathbb{R})$, let us ...

1
vote

2
answers

129
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 & ...

7
votes

0
answers

117
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 $...

0
votes

0
answers

140
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}=...

3
votes

0
answers

41
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 ...

3
votes

2
answers

238
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 & &\\
& &...

0
votes

0
answers

76
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 \...

0
votes

1
answer

102
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?

4
votes

1
answer

157
views

### Least squares problem with left and right unknowns

For $i=1,...,n$, let $b_i$ be a scalar and $A_i$ be an $k\times l$ matrix. Is there a closed form solution for the following problem assuming $n>k+l$?
$$\min_{x\in \mathbb{R}^k ,y\in \mathbb{R}^l} \...

0
votes

0
answers

28
views

### upper band for the eigenvalue-distance from an eigenvalue regarding its eigenvector extension, in the adjacency matrix of a local graph?

Background: Suppose we have a system in which an electron can hop locally on this lattice. Here locally means that the electron can hop up to a short distance. We can make an energy spectrum that ...

10
votes

2
answers

420
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 &...

4
votes

0
answers

63
views

### Local energy estimate in a semiclassical regime

Let us consider $h_n=(2n+1)^{-1/2}\to 0$ as $n\to \infty$ be a small parameter, which we just write as $h$ for convenience, and $u_h : \mathbb{R} \to \mathbb{R}$ be functions satisfying $Pu_h=0$ (I ...

2
votes

1
answer

116
views

### On the eigen vectors of a diagonalizable matrix

Let us consider the space $M_n(\mathbb{C})$. By a unitary matrix $U=(u_{ij})$ we mean that $U^{-1}=(\overline{u_{ji}})$.
Q. Let $U$ be a unitary matrix. I am looking for the pairs of matrices $(D,A)$ ...

1
vote

0
answers

156
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 ...

1
vote

1
answer

413
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{...

5
votes

0
answers

198
views

### Perturbation of Neumann Laplacian

Consider the $N \times N$ matrix
$$A_{\alpha}=\begin{pmatrix} \lambda_1 & -1 & -\alpha & 0 & \cdots & 0\\
-1 & \lambda_2 & -1 & -\alpha & \cdots & 0\\
-\alpha &...

4
votes

2
answers

316
views

### How close to uniform are Perron-Frobenius eigenvectors?

Let $A=(a_{i,j})$ be a square matrix with non-negative entries. (Assume $A$ is symmetric, if it helps.) Let $v$ be a Perron-Frobenius eigenvector. What do we need to assume about $A$ in order to have ...

1
vote

0
answers

309
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 ...

1
vote

0
answers

110
views

### Eigenvalues and eigenvectors of non-symmetric elliptic operators

We know that the operator $A=\Delta$ with domain $D(A)=\{u\in W^{2, 2}(\Omega): u=0 \ \ \text{on } \partial\Omega\}$ (say $\Omega$ is a bounded nice domain) has eigenvalues $\lambda_1>\lambda_2\ge \...

1
vote

1
answer

263
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^...

0
votes

0
answers

174
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 ...

0
votes

1
answer

421
views

### Centrality measures in a network with negative correlations

I have a bidirectional network where the weights of edges are based on partial correlation matrix. I have both positive and negative values as weights. Now, I want to compute centrality measures as ...