Skip to main content

Questions tagged [eigenvector]

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

Filter by
Sorted by
Tagged with
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 ...
billbob's user avatar
  • 37
2 votes
1 answer
205 views

Statistical estimation of singular values and vectors

My question is about the well known and well studied singular value decomposition (SVD). What I am working on right now requires performing an SVD repeatedly on a slowly varying matrix. Since I don't ...
Bernard's user avatar
  • 111
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}...
Majid's user avatar
  • 11
10 votes
1 answer
5k views

Eigendecomposition after multiplying by diagonal matrix

Hello, If we possess the eigendecomposition of a positive definite matrix: $X = U \Sigma U^T$, is there an efficient way to compute the eigendecomposition of $D X D$ where $D$ is a diagonal matrix?
Martin McCormick's user avatar
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 ...
Zedong Bi's user avatar
3 votes
1 answer
1k views

Is this function of a matrix convex?

Let $\mathcal{N}_{n}$ be the set of symmetric nonnegative irreducible matrices. For a matrix $A \in \mathcal{N}_{n}$ let $v^{A}$ be its Perron vector, normalized so that $||v^{A}||_{2}=1$. Define the ...
Felix Goldberg's user avatar
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 ...
jvn99's user avatar
  • 31
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 ...
tom's user avatar
  • 61
0 votes
3 answers
1k views

Intuitions/connections/examples for "eigen-*"

There are many concepts in mathematics that begin with the German word "eigen": eigenvector, eigenvalue, eigenspace, eigenstate, eigenfunction, eigensystem etc. (to name just the most important (?) ...
vonjd's user avatar
  • 5,935
5 votes
2 answers
2k views

rank-one perturbation of a matrix corresponding to a specific spectrum

Let $A$ be a real symmetric matrix whose spectrum is $\lambda_1,\lambda_2,\ldots,\lambda_n$. Let $A'$ be the matrix obtained by adding a perturbation to $A$. The requirement is that only the second ...
Vedarun's user avatar
  • 111
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} & \...
Spuds's user avatar
  • 121
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 ...
PThomasCS's user avatar
  • 399
6 votes
2 answers
3k views

Eigenvalues of a Symmetric Positive Semi-Definite (PSD) matrix after rank one update

I have a Symmetric Positive Semi-Definite matrix $A$ which i know its eigenvalue and eigenvectors. let $v$ and $u$ be a random column vector. i want to know if it is possible to have eigenvalues of ...
Amin's user avatar
  • 159
3 votes
2 answers
1k views

Eigenvectors and eigenvalues of Tridiagonal matrix with varying diagonal elements

is it possible to analytically evaluate the eigenvectors and the eigenvalues of a tridiagonal $n\times n$ matrix of the form : \begin{pmatrix} 1 & b & 0 & ... & 0 \\\ b & 2 &...
ram's user avatar
  • 31
3 votes
1 answer
2k views

Fast algorithm for maximizing smallest eigenvalue of linear combination of hermitian matrices

I have an engineering back ground. Due to work, I came across this problem \begin{align} &\max_{\lambda,y_i\in \mathbb{R}}~\lambda \\\ s.t.~&\left(\mathbf{A}_0+\sum_{i=1}^{K}y_i\mathbf{A}_i\...
dineshdileep's user avatar
  • 1,421
11 votes
1 answer
806 views

Algebraicity of Eigenvectors in a Hilbert space

Let $(e_j)_{j\in\mathbb N}$ be an orthonormal basis of a Hilbert space $V$. Let $T:V\to V$ be continuous, selfadjoint linear operator. Assume that for all $i,j\in\mathbb N$ the number $\langle Te_i,...
user avatar
2 votes
0 answers
765 views

Reference: Continuity of Eigenvectors [closed]

I am looking for an appropriate reference for the following fact. I already posted on math.stackexchange, but got no answer. For each $X \in \mathbb{R}^{n \times n}_{\text{sym}}$ (symmetric matrix),...
gerw's user avatar
  • 1,724
3 votes
3 answers
2k views

Eigenvectors and eigenvalues of nonsymmetric Tridiagonal matrix

Hi, the question is following: We have one matrix $$\begin{pmatrix} -\beta & \Delta & 0 & 0 &\cdots & 0 & 0 & 0 \newline \beta & -(\beta+\Delta) & \Delta & ...
Cherep's user avatar
  • 39
4 votes
1 answer
738 views

Helmholtz equation Poynting vector integral

The Maxwell's equation for harmonic time dependent field in vacuum is \begin{align} \nabla \times B + i\omega E &= 0\\ \nabla \times E - i\omega B &= 0 \\ \nabla \cdot B &= 0 \\ \nabla \...
Hans's user avatar
  • 2,251
1 vote
0 answers
537 views

Epsilon-net of operator norm ball around Identity

Suppose I look at the set of matrices which are invertible and satisfy $$ \left\|A-Id\right\|_{op}<r $$ for some $r<1$, where $Id$ is the $n\times n$ identity matrix. An $\epsilon$-net of such ...
squattyroo's user avatar
3 votes
2 answers
4k views

Singular Value Decomposition of Noisy Matrices

I am an engineer who makes measurements of a variable over a grid of, say, $m\times n$. Since these are actual measurements, the true values are always corrupted by noise, and what I measure is a ...
Sankara Subramanian's user avatar
7 votes
1 answer
197 views

Compute only selected components of an eigenvector

I am wondering whether it is possible to compute portions of the eigenvectors of a given (possibly very big) matrix. More formally, consider the eigenvalue problem $\mathbf{Ax} = \lambda \mathbf{x}$, ...
gboukensha's user avatar
3 votes
1 answer
561 views

Reducing eigenvalues of symmetric PSD matrix towards 0: effect on ratios of original matrix elements?

Let $\boldsymbol{S}$ be $k \times k$ positive semi-definite real symmetric matrix with eigen decomposition $\boldsymbol{S} = \boldsymbol{X} \boldsymbol{\Lambda} \boldsymbol{X}'$ ($\boldsymbol{\Lambda}$...
Preston's user avatar
  • 33
6 votes
1 answer
3k views

Stochastic Matrix: Second largest eigenvalue and second largest absolute value of eigen value

Setup Let $A$ be a stochastic matrix. Let the eigenvalues of $A$ be $1 = \lambda_1 \geq \lambda_2 \geq \lambda_3 ... \geq -1$. Let $\lambda = \max_{x: x \perp 1} \frac{||Ax||}{|| x ||}$ Question: ...
anonymous coward's user avatar
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 ...
mikitov's user avatar
  • 342
0 votes
1 answer
664 views

Kneser graphs eigenvalues

Basically, I want to prove that, in the Kneser graph (wikipedia has a good definition),$K_{n, m}$, if $n_{-}(A(G)) $ and $n_{+}(A(G))$ denote the number of negative and positive eigenvalues of A(G) ...
user53083's user avatar
2 votes
2 answers
564 views

Linear dynamical systems: interpretation of Frobenius eigenvector

Consider a positive linear dynamical system. $\frac{dx}{dt}=Ax$, where $A$ is a quasipositive/Metzler/essentially nonnegative matrix. By its properties, the vector $x$ will remain positive for all ...
Sultan's user avatar
  • 143
3 votes
1 answer
1k views

What is the minimum of the Frobenius norm in the intersection of positive semidefinite cones?

For scalar variables $x$, we have a simple solution for the following problem. \begin{eqnarray} \min_x&&\alpha(x-a)^2+\beta(x-b)^2 \\\ \mathrm{s.t. }&&x\leq a\\\ &&...
ppyang's user avatar
  • 607
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$,...
Benoît Kloeckner's user avatar
-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?
Weera's user avatar
  • 9
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 ...
Drn004's user avatar
  • 103
6 votes
1 answer
1k views

Repeated Second Eigenvalue of the Adjacency Matrix of a Graph

This question is motivated by a talk I went to earlier today. Suppose we have a $d$-regular graph $G$ with $n$ vertices, with adjacency matrix $A$. Let $$\lambda_1\geq \lambda_2 \geq\dots \geq \...
Eric Naslund's user avatar
  • 11.4k
3 votes
2 answers
2k views

Eigenvalues of sum of an adjacent matrix and a constant

$A$ is an adjacent matrix of a network. $la$ is the largest eigenvalue of $A$ and $Va$ is its corresponding eigenvector. I am interested in the following martix: $bA+c-dI$ ($b$, $c$, and $d$ are all ...
Changwang Zhang's user avatar
2 votes
1 answer
1k views

Coercive Symmetric Bilinear form on a Hilbert space

I need to show one of the two following equivalent results. If true, it must be a simple proof but I do not seem to be able to make it work. Thank you in advance. 1) Consider a continuous symmetric ...
Gateau au fromage's user avatar
0 votes
2 answers
737 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 ...
Nicolas's user avatar
3 votes
2 answers
2k views

When can an eigenvector be chosen uniquely which is invariant to permutation?

Suppose $A\in\Re^{n\times n}_{sym}$ is a symmetric matrix with eigenvalues $\lambda_1,\dotsc,\lambda_n$ in decreasing order. What I seek is a way to choose an eigenvector that is invariant to ...
Daniel's user avatar
  • 53
2 votes
1 answer
474 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 ...
sasquires's user avatar
  • 403
3 votes
0 answers
2k views

Relation between the eigenspace of a covariance matrix and eigenspace of correlation matrix

I was discussing applying Principal Component Analysis to a covariance matrix versus applying PCA to the corresponding correlation matrix with a collegue. This led me to think about the following ...
Stijn's user avatar
  • 131
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, ...
squattyroo's user avatar
1 vote
0 answers
270 views

Eigenvalue of product of self adjoint compact operators

Suppose A is a self adjoint $m \times m$ real matrix with eigenpairs $\{e_j, \lambda_j\}$ such that $\lambda_j > \lambda_{j + 1}$. Let $B$ be another self adjoint real $m \times m$ matrix such that ...
Madhuresh's user avatar
  • 157
0 votes
0 answers
225 views

Separating Two Groups of Data using Fisher's Linear Discriminant

I found an article (starting on page 8) that gives a neat method for finding the line/plane/hyperplane that maximizes the separation between two groups of data points in n-dimensions. It uses Fisher's ...
user1389840's user avatar
1 vote
1 answer
221 views

True or false: if a set of 2D points has valid symmetry axes, then at least one of them is equal to a principal component vector

I posted this question on math.stackexchange but got no answer, so I decided to post it here instead. Sorry about the impreciness, not professional mathematician here. Let's assume we have a set of ...
tziki's user avatar
  • 121
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 ...
Val K's user avatar
  • 355
1 vote
2 answers
450 views

Is Rellich's function valued theorem valid for a rank defficient function valued matrix?

Theorem (Rellich). Let $\boldsymbol{A}(t) : \mathbb{R}\rightarrow\mathbb{C}^{n \times n}$ be a Hermitian matrix function that depends on $t$ analytically. (i) The $n$ roots of the characteristic ...
trienko's user avatar
  • 33
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^...
user avatar
3 votes
1 answer
264 views

When is this matrix singular?

Consider matrix $A$ with $(j,k)$′th entry $A_{j,k}=\sin(\omega_j t_k+\phi_j),\,\forall j,k\in\{1,2,...,n\}$, where $\omega_j,t_k,\phi_j\in \mathbf R$. 1) For $t_k=k$, what is the condition on $\...
Hans's user avatar
  • 2,251
1 vote
1 answer
176 views

Linear map with two "incompatible" representations

Let $K$ be a field and let $V$ be the set of sequences $\{v_1,v_2,\dots\}$ of elements of $K$. If $A=\{a_1,a_2,\dots\}$ is also a sequence of elements of $K$, then it defines an endomorphism of $V$ $$...
Laurent Berger's user avatar
1 vote
0 answers
2k views

Eigenvalues of Matrix Sum

Hello, I have a linear algebra problem that I need help with. Basically, I need to get the eigenvalues and eigenvectors of several (sometimes tens of thousands) very large Hermitian matrices (6^n x ...
vkillion's user avatar
3 votes
1 answer
420 views

Eigenvectors of asymmetric graphs

Let $G$ be an asymmetric connected graph. Then is it always the case that at least one of the eigenvectors of its adjacency matrix $A$ consists entirely of distinct entries? Thanks!
baronbrixius's user avatar
2 votes
2 answers
170 views

Given a subdomain of GL(n), when is the map from matrices to their matrices of eigenvectors a diffeomorphism?

I'm wondering if there are any general conditions on a subdomain of $GL(n)$, which would guarantee that the map from a matrix to its matrix of eigenvectors is a diffeomorphism. For example, given a ...
Nick's user avatar
  • 173