1
vote
1answer
135 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$ ...
0
votes
1answer
151 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) ...
0
votes
1answer
79 views

Any generic way to move a psd matrix to its neighbors?

Given a two positive matrices $A,B$. For simplicity, let's assume that $Tr A=Tr B=1$. Assume that $\|A-B\|_1\leq\varepsilon$, for some small $\varepsilon>0$, where $\|\cdot\|_1$ is the $l_1$-norm, ...
1
vote
0answers
44 views

Bounding Rayleigh quotioent 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$. ...
3
votes
0answers
73 views

What do we know about the generalized eigenvalue problem involving a projector?

Consider a matrix $A\in\mathbb{R}^{n\times n}$ and a projector $P\in\mathbb{R}^{n\times n}$. Are there results regarding the generalized eigenpairs $(v,\lambda)$ of the generalized eigenproblem ...
3
votes
1answer
190 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 ...
8
votes
1answer
723 views

Frobenius-Perron eigenvalue and eigenvector of sum of two matrices

Suppose that I have two positive matrices, $A$, and $B$, and I know their Frobenius-Perron eigenvalues ($\lambda_A$, $\lambda_B$) and eigenvectors ($v_A$, $v_B$). I'm interested in what I can say ...
2
votes
2answers
113 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 ...
4
votes
0answers
104 views

Concept of eigenvector restricted to nonnegative entries

Let $X\in \mathbb{R}^{n\times n}$ be a positive semidefinite matrix. The leading eigenvector $v\in \mathbb{R}^n$ of $X$ is the solution to the problem $\arg \max_{v:\lVert v\rVert_2=1} \lambda\quad$ ...
3
votes
1answer
178 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 \\\ ...
2
votes
1answer
154 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 ...
15
votes
4answers
986 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 ...
4
votes
0answers
104 views

Preconditioner for finding the smallest eigenpairs of a large, but structured, matrix

I'm trying to find the eigenvector corresponding to the second smallest eigenvalue of a large $(4,000,000 \times 4,000,000)$ matrix $L$. $L$ is a graph Laplacian, with the following structure: $L = D ...
0
votes
1answer
72 views

The influence of eigendecomposition on the periodicity of a (rank 2) Hermitian matrix (of functions)

Let $\boldsymbol{R}(u,v);~u,v\in\mathbb{R}$ be a Hermitian matrix (of Hermitian functions) with entries \begin{equation} r_{ij}(u,v) = 1 + Ae^{-2\pi i \phi_{ij}(ul_0 + vm_0)}; ...
2
votes
2answers
149 views

Is my use of the eigendecomposition correct here?

I'm exploring different techniques to efficiently solve some matrix equations. My situation is that I have a matrix $\textbf{H} = \textbf{J}^T \textbf{J}$, where $\textbf{J}$ is a matrix with no ...
0
votes
2answers
224 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 ...
2
votes
1answer
191 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 ...
2
votes
0answers
362 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 ...
1
vote
0answers
63 views

Eigenvectors of contraction times projection

Suppose $A$ is a real $n\times n$ matrix with real eigenvalues: $$ 1=\lambda_1>|\lambda_2|\ge \ldots\ge |\lambda_n|>0. $$ Suppose $B$ is an involution, for simplicity let us assume that $B$ is ...
4
votes
1answer
248 views

Sum of commuting semisimple operators

Let $V$ be a finite dimensional vector space over a field $K$. An operator $T:V\to V$ is called semi-simple if every $T$-invariant subspace of $V$ has a complement(for algebraically closed fields ...
6
votes
2answers
912 views

Perturbation theory for the generalized eigenvalue problem

Is there a standard reference for the perturbation theory of the generalized eigenvalue problem? More specifically, I would like to get a systematic expansion for the problem $(A_0 + \epsilon ...
1
vote
0answers
161 views

componentwise eigenvector perturbation

Does the sin-theta theorem imply a componentwise nonasymptotic bound for eigenvectors? Assume, for the purpose of this question, that the eigenvalues concerned are simple. If this is trivial, I ...
2
votes
0answers
370 views

How many iterations are required for the Lanczos algorithm to converge?

I am trying to find the n smallest eigenvalues and eigenvectors of a NxN SPD matrix using Lanczos method. What is the number of iterations usually required? I mean, does it scale as $O(N)$ or ...
3
votes
1answer
328 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\\\ ...
2
votes
2answers
657 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 ...
8
votes
2answers
470 views

Efficiently computing a few localized eigenvectors

Let $H = \triangle + V(x) : \mathbb{R}^2 \rightarrow \mathbb{R}^2$. I am interested in domain decomposition for an eigenproblem involving $H$. The lowest 1000 eigenfunctions of $H$, $ \psi_i $, can ...
2
votes
2answers
829 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 ...
1
vote
3answers
918 views

Generalization of eigenvalues/vectors to modules?

What is the generalization of eigenvalues/vectors to modules? To be specific, given a "vector" v in a module over some ring, and a linear "operator" O from the module to itself (please feel free to ...
1
vote
0answers
204 views

Operator eigenvalues and eigenvalues of pointwise evaluation matrix

Let $D\subset\mathbb{R}$ be a bounded interval and $f: D\times D \rightarrow \mathbb{R}$ a real-valued analytic function of two variables such that $f\in L_2(D\times D)$. Suppose we have upper bounds ...
4
votes
1answer
917 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?
4
votes
2answers
801 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,...,\lambda_n$ Let $A'$ be the matrix obtained by adding a perturbation to $A$. The requirement is that only the second ...
1
vote
0answers
233 views

Eigenvectors of convolution with a normal distribution over a restricted interval

Suppose I have a random variable $X_0$ with a p.d.f $f_0$ supported on the real interval $[a_0, b_0]$. $X_1$ is the restriction to $[a_1, b_1]$ of the sum $X_0 + g$, where $g$ is normally distributed ...
4
votes
1answer
875 views

dominant eigenvector

Hi, everyone! Is there any efficient way to simplify the following tensor product $X \otimes X + X^T \otimes X^T$, where $X$ is a square $n \times n$ matrix. My goal is to efficiently compute the ...
2
votes
1answer
140 views

Statistical estimation of singular values and vectors

Hi All 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 ...
0
votes
3answers
983 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 (?) ...