Questions tagged [eigenvector]
The eigenvector tag has no usage guidance, but it has a tag wiki.
293 questions
13
votes
2
answers
702
views
'Eigenvectors' of evolute operation
The evolute of a curve is the locus of its centers of curvature.
The evolute of some plane curves is a scaled, or scaled and
reflected/rotated, version of that curve.
For example, the evolute of a ...
- 1,228
0
votes
0
answers
184
views
Oja's rule gives unit eigenvectors
Does Oja's rule for normalized Hebbian learning always result in a unit eigenvector which corresponds to the largest eigenvalue? Or are there any specific conditions or assumptions under which this is ...
- 63.9k
1
vote
1
answer
193
views
Is there any relation between weights in the eigenvector (corresponding to least eigenvalue) and the columns of a correlation matrix?
This problem is motivated from one of my pattern mining research projects. Any helpful suggestions will be highly appreciated.
Consider an $n \times n$ correlation matrix A such that all the off-...
- 1,517
1
vote
1
answer
179
views
Connection between weights in the last eigenvector (corresponding to least eigenvalue) and the corresponding column of a correlation matrix
This problem is motivated from one of my pattern mining research projects. Any helpful suggestions will be highly appreciated.
Consider an $n \times n$ correlation matrix A such that all the off-...
- 141
2
votes
0
answers
79
views
Conditions on a $n\times n$ Hermitian matrix such that its extremal eigenvectors have equal magnitude entries
Is it possible to find (necessary and sufficient) conditions on a general $n\times n$ Hermitian matrix $A$, such that its extremal eigenvectors (the eigenvectors corresponding to the maximum and ...
- 31
4
votes
0
answers
299
views
Stationary distribution of mixture of Markov Chain with "complete" Markov Chain
I already asked this question in StackExchange, but found little attention. So I'm just going to copy-paste my original question here.
Let $P$ be a stochastic matrix (of an irreducible Markov Chain) ...
- 153
2
votes
2
answers
446
views
Entrywise modulus matrix and the largest eigenvector
Disclaimer. This is a cross-post from math.SE where I asked a variant of this question two days ago which has been positively received but not has not received any answers.
Let $A$ be a complex ...
- 4,361
3
votes
1
answer
932
views
Integer eigenvectors
Is there a known way or software to find integer eigenvectors for an integer matrix with integer eigenvalues?
In particular, I have a large real symmetric matrix with only a small number of ...
- 54.2k
2
votes
0
answers
701
views
Simple random walk on a discrete torus - the eigensystem, reference
My problem concerns finding a reference in which the formulae for the eigenvalues and the corresponding eigenvectors ($n$ linearly independent eigenvectors!) for the transition matrix of a simple ...
CommunityBot
- 1
9
votes
1
answer
436
views
Eigenvalues of a matrix with binomial entries
I am trying to determine the eigenvalues and eigenvectors of the following matrix:
$$M_{ij} = 4^{-j}\binom{2j}{i}$$
where it is understood that the binomial coefficient $\binom{m}{k}$ is zero if $k&...
- 884
2
votes
0
answers
479
views
Eigendecomposition of the Hadamard product of a rank one symmetric matrix and a positive definite symmetric matrix
Is it possible to say anything about the eigenvalues and eigenvectors of a matrix
$X = Y \circ xx^T$
where $Y$ is a positive definite symmetric matrix with known eigen-decomposition
$Y=U\Lambda U^T$...
- 71
4
votes
0
answers
2k
views
What is the time complexity of the largest singular value and its vectors?
Full zero-error SVD on an $m \times n$ matrix $A$ would cost $O(\min(m^2n,mn^2))$. What is the time complexity if we need only the largest singular value and its corresponding vectors? I think it is $...
6
votes
1
answer
830
views
Dominant eigenvector of a real symmetric tridiagonal matrix
What is the most efficient way to calculate the dominant eigenvector of a real symmetric tridiagonal matrix? What's the corresponding time complexity bound?
Could someone give me a reference for ...
3
votes
0
answers
220
views
Eigenvalues and eigenvectors of nonsymmetric complex tridiagonal matrix
I wonder if it is possible to find analytically all eigenvalues and eigenvectors of the following $2n \times 2n$ non-symmetric complex tridiagonal matrix
$$M = i \begin{pmatrix}
0 & a & 0 &...
11
votes
1
answer
985
views
Exact eigenvalues of a specific tridiagonal matrix
I'm studying the following tri-diagonal matrix
$$
X = \begin{pmatrix}
0 & x_0 & 0 & 0 &\cdots & 0 & 0 & 0 \\\
x_0 & 0 & x_1 & 0 &\cdots & 0 & ...
1
vote
1
answer
437
views
Eigenvector of a nonnegative matrix in closed form
Consider $n\times 1$ vector $\alpha = (\alpha_{1}, ..., \alpha_{n})$, where $0<\alpha_{i}<1$, and $\sum_{i=1}^{n}\alpha_i = 1$. Construct the $n\times n$ zero-diagonal matrix $A$ with $(i,j)$-th ...
- 1,538
2
votes
0
answers
28
views
Comparison of principal diagonals of two positive definite matrix
Let us consider a matrix with positive elements: ${\bf X}^{k\times2}=[X_1:\ldots:X_k]'$ with $X_i=(1,X_{1i})',\;i=1,\ldots,k$. Also consider ${\bf X}^{(-1)}$ as the Moore-Penrose inverse of ${\bf X}$ ...
- 213
2
votes
2
answers
335
views
Solving linear system when one eigenvalue is known
I have a huge sparse linear system $Ax = b$ where I know that an eigenvalue/eigenvector pair is $1$ and a vector of all $1$'s. Can this knowledge help me in solving the linear system at all? It seems ...
- 20.2k
5
votes
3
answers
2k
views
Proving that a certain non-symmetric matrix has an eigenvalue with positive real part
Suppose that
$X$ is the $n \times n$ matrix of all ones
$Y$ is an arbitrary $n \times n$ matrix with zeroes on the diagonal and all other entries equal to $0$ or $1$
$0 < \delta < 1$
Let $Z = ...
- 61
2
votes
0
answers
148
views
Commutation relation and eigenvectors of infinite matrices [closed]
I'm given the Matrix $A$ and $A^T$:
$A =
\begin{bmatrix}
0 & 1 & 0 & 0 & \dots \\
0 & 0 & \sqrt{2} & 0 & \dots \\
0 & 0 & 0 & \sqrt{3} & \...
- 121
3
votes
1
answer
656
views
Upper bounds on the condition number of the eigenvector matrix
Let $A$ be an $n\times n$ real matrix with entries in a fixed interval $[a_\min,a_\max]$, with $a_\min$, $a_\max>0$.
Question: Are there any upper bounds on the condition number of the ...
- 2,286
6
votes
1
answer
6k
views
SOLVED: How to retrieve Eigenvectors from QR algorithm that applies shifts and deflation
After having googled for several days without locating a definitive answer, I will try my luck here!
I have implemented a version of the QR algorithm to calculate Eigenvalues and hopefully ...
- 63
-1
votes
1
answer
61
views
Finding a matrix with shared eigen vectors with a given matrix [closed]
If I have a known matrix A, is there a method to find a matrix B that share all the eigen vectors of Matrix A?
- 96.4k
4
votes
1
answer
1k
views
complexity of computing the singular vector corresponding to the smallest singular value
It is known that the singular value decomposition of an $m \times n$ matrix $A$ is in general of complexity of the order $m n^2$, assuming that $m \ge n$. But what if we only want to compute say the ...
- 96.4k
0
votes
1
answer
835
views
Do these matrices have the same null space?
Let $[\theta_1,\theta_2, \dots, \theta_N]^\mathrm{T} \, \in \mathbb{R}^N$. The angles are not all identical (on the circle), i.e. $[\theta_1,\theta_2, \dots, \theta_N] \not \equiv c [1,1,\dots, 1]^\...
- 54.2k
7
votes
1
answer
254
views
Eigenvectors of a matrix with entries involving combinatorics
In the question Eigenvalues of a matrix with entries involving combinatorics No_way asked about eigenvectors of $n\times n$ matrix $M$ with entries \begin{eqnarray*}
M_{ij}=(-1)^{i+j}F(n, l, i, j),
\...
CommunityBot
- 1
1
vote
0
answers
286
views
Generalized eigenvalue problem with nonnegative eigenvector constraint
Consider the following problem that is known to be non-convex but can be solved as a generalized eigenvalue problem (i.e. has a global optimum solution):
$\underset{w}{\text{maximize}}\quad w^{\top}...
- 11
5
votes
4
answers
2k
views
Differentiability of eigenvalue and eigenvector on the non-simple case
Let $h:\mathbb{R}^n\to\mathbb{R}^m, n>1$ be a twice continuously differentiable function and $J_h:\mathbb{R}^n\to\mathbb{R}^{m\times n}$ be its jacobian matrix. Let us consider the functions $A(x):=...
- 25.3k
4
votes
0
answers
84
views
Matrices with almost constant coefficient have a simple eigenvalue
As a by-product of a general result for bounded operators of a Banach space, I have the following:
A matrix $L=(\ell_{ij})_{ij}$ that has almost constant coefficients in the sense that for some $c$,...
- 14.4k
2
votes
1
answer
912
views
How can I efficiently approximate the stationary distribution of an infinite CTMC with a sparse rate matrix?
I am looking for methods to approximate the stationary distribution of an infinite CTMC with a sparse rate matrix. Each row and column of the rate matrix has a finite number of non-zero elements. ...
CommunityBot
- 1
-2
votes
1
answer
713
views
The spherical harmonics are the EIGENVECTORS of Beltrami operator [closed]
In the well-known book "THE PRINCETON COMPANION TO MATHEMATICS" page 296, it is indicated that the spherical harmonics are the EIGENVECTORS of the Beltrami operator. In the document Spectral Geometry ...
- 105k
2
votes
1
answer
1k
views
How to retrieve eigenvectors from shifted QR algorithm?
I understand that the key to retrieve eigenvectors in the non-shifted QR algorithm is to accumulate the transformations at each steps in the following way:
$Q = \Pi_i Q_i$
Can we accumulate the ...
- 21.6k
2
votes
1
answer
968
views
Eigenvectors of symmetric positive semidefinite matrices as measurable functions
I'm currently interested in how discontinuous can get the eigenprojections of a continuous function taking values in a particular subspace of symmetric matrices.
I've been searching everywhere for an ...
- 34.7k
2
votes
0
answers
463
views
Conditions for continuity of non-simple eigenvectors
Here, https://math.stackexchange.com/a/1146455, it is noted that eigenprojections are continuous, but eigenvectors are not. Are there any conditions where the eigenvalues are not simple, but the ...
CommunityBot
- 1
6
votes
1
answer
506
views
Recovering Spherical Harmonics from Discrete Samples
Consider a collection of $N$ points on the 2-sphere chosen uniformly at random. Let's say that there's an edge between two such vertices if their geodesic distance is less than $r_N$. The resulting ...
- 881
0
votes
1
answer
106
views
Eigenvalue-related statements [closed]
(I understand this question might not be appropriate for this website, but it has been asked on MathStackexchange and did not receive any replies even with a bounty)
How can I prove that the ...
- 52.4k
4
votes
2
answers
477
views
Non-asympototic version of Gelfand's formula
Let $A$ be a $n\times n$ matrix. Let $\|A\|$ be the spectral norm of $A$, and $\rho(A)$ be the spectral radius. I am wondering whether the following statement is true.
There exists universal ...
- 109k
0
votes
1
answer
353
views
Almost sure convergence of smallest eigenvector of diagonal matrix
I have that a sequence of random matrices, $M_n$, converges almost surely to a diagonal matrix, $D$, with finite real entries on its diagonal. During convergence, the off-diagonals are not necessarily ...
- 399
7
votes
1
answer
412
views
Sum of the absolute eigenvalues of A>=B
Kindly help me to prove/disprove the following statement.
Let $A$ be a symmetric matrix of order $n \times n$ with all the diagonal entry equal to $0$, and other non-diagonal entry equal to $k$ (...
- 28.6k
3
votes
3
answers
357
views
Can a block matrix with at least 3 zero blocks of different size on the diagonal and 1's everywhere else have only integer eigenvalues?
Let $M=\begin{pmatrix}
\begin{array}{cccccccc}
0 & 0 & 1 & 1 & 1 & 1 & 1 &1\\
0 & 0 & 1 & 1 & 1 & 1 & 1 &1\\
1 & 1 & 0 & 0 & ...
- 19.6k
4
votes
0
answers
463
views
The distribution of the elements of an eigenvector of random matrices
Suppose a random matrix $A$ with its elements following Gaussian distribution with non-zero mean. We know that the eigenvalues of $A$ have two patches: one is at the real axis that is far away from ...
- 13.4k
1
vote
0
answers
147
views
Bounding Rayleigh quotient for stochastic matrix
Suppose you have an irreducible, stochastic matrix $A$ with left Perron-Frobenius eigenvector $v$ (corresponding to the eigenvalue $1$), and suppose the next largest eigenvalue for $A$ is $\lambda$. ...
- 19.6k
1
vote
0
answers
122
views
Algorithm for finding eigenfunctions
I have an $ L^2(\mathbb{R}) $ operator that looks like
$$
\Omega = \int \partial\phi(a, b)\ \ |b, a\rangle \langle b, a |,
$$
where $ \langle x | a, b \rangle = f_a(x - b) e^{x^2/2} $ and $ f_a \in L^...
CommunityBot
- 1
21
votes
4
answers
9k
views
Condition for two matrices to share at least one eigenvector?
Suppose that I have two matrices $A$ and $B$, and I want them to share a common eigenvector $x$. For simplicity let's just assume that the eigenvalue associated with $x$ is $1$ for both matrices, so $...
CommunityBot
- 1
2
votes
1
answer
311
views
Is there an algorithm to test whether a vector is an eigenvector of a power of a matrix?
Given a square matrix $A\in k^{n\times n}$ and a vector $x\in k^n$ over some field $k$, is there an algorithm to test whether there are $s\in\mathbb{N}$ and $\lambda\in k$ such that $A^sx=\lambda x$? ...
- 22.5k
1
vote
0
answers
158
views
Interpreting (Fiedler) spectral bisectioning
I would appreciate help on how to interpret the results of spectral bisectioning of a graph.
Given a $G=(V,E)$ with size $N$ represented by $Q$ its Laplacian matrix where the eigenvalues are ordered ...
- 355
2
votes
1
answer
163
views
Shared maximum eigenvector
Let us consider two arbitrary Hermitian square matrices $\mathbf{A,B}$ with the same dimension. Given $\mathbf{v}$ the eigenvector associated to the maximum eigenvalue of $\mathbf{A}$:
Are there ...
- 27.9k
1
vote
3
answers
1k
views
Simple Spectrum of Jacobi matrices
I want to call a matrix a Jacobi matrix (cause there may be different notions of Jacobi matrices) if it is a tridiagonal matrix with positive off-diagonal entries. Now, I read that the spectrum of ...
- 2,188
3
votes
1
answer
247
views
Concentration and Correlation for Magnitudes of Gaussian Vectors
Suppose we have a large collection of standard normal random variables $a_i\in\mathbb{R}^n$. We know by standard concentration results that if we take $m \geq C\left(t/\epsilon\right)^2n$ samples, ...
- 205
2
votes
1
answer
3k
views
Hadamard Product and Eigendecomposition
I just found this related question in here Q1.
Given a positive definite matrix $\mathbf{A}$, consider its eigendecomposition $(\mathbf{A}\mathbf{V} = \mathbf{V}\mathbf{D})$. Consider an arbitrary ...
CommunityBot
- 1