Skip to main content

All Questions

Tagged with
Filter by
Sorted by
Tagged with
0 votes
0 answers
103 views

Eigenvectors of tridiagonal hermitian matrix

In my paper, I investigate the coordinates of the eigenvectors of a hollow tridiagonal hermitian matrix, which is defined as: \begin{align*} Q_n = \begin{pmatrix} 0 & q_{1,2} & 0 & 0 & ...
Denis's user avatar
  • 1
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{...
PIII's user avatar
  • 83
2 votes
1 answer
278 views

Continuity of eigenvector of zero eigenvalue

Wonder whether anyone has an idea on showing the following or to point out that it is not true: Let $A(t) \in \Re^{n \times n}$ be differentiable over an interval $I$, and it has a zero eigenvalue for ...
muddy's user avatar
  • 69
3 votes
1 answer
155 views

Does this matrix equation always have a solution?

Let $\{A_i, i\ge 3\}$ be the matrices whose columns represent numbers from $0$ to $2^i-1$ in binary form. For example, $A_3 = \begin{bmatrix} 0 & 0 & 0 & 0 & 1 & 1 & 1 & 1 \...
Arnaud Casteigts's user avatar
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 $...
brant's user avatar
  • 63
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 ...
Daniel Belaish's user avatar
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{...
António Borges Santos's user avatar
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 ...
brant's user avatar
  • 63
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 $...
MikeDean's user avatar
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 ...
TobiR's user avatar
  • 103
1 vote
1 answer
107 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 & \...
Seung Hyeon Yu's user avatar
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 & ...
Sascha's user avatar
  • 536
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 & &\\ & &...
Connor's user avatar
  • 145
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 \...
Marin's user avatar
  • 1
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{...
Guido's user avatar
  • 29
5 votes
0 answers
208 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 &...
Guido Li's user avatar
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^...
drommedaris's user avatar
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, \...
Serguei Popov's user avatar
3 votes
1 answer
1k views

Calculating second derivatives of eigenvectors of a matrix with some degenerate eigenvalues

Given real symmetric matrix $\mathbf{M}$ with eigenvalues $\lambda_i$ and eigenvectors $\mathbf{v}_i$, the derivative of an eigenvector is $$\dot{\mathbf{v}}_i = \sum_{j \ne i} \frac{\mathbf{v}_j \...
ehermes's user avatar
  • 33
0 votes
0 answers
166 views

Minimize a vector from a matrix operation

I want to minimize a certain vector that results from a matrix operation with some constraints and i don't exactly know how to tackle this problem. Lets say we have $$ (L+A)*s = v $$ L is the ...
leo_bouts's user avatar
  • 101
0 votes
0 answers
79 views

Eigendecomposition of $A=I+BDB^H$

Suppose that we have $$A = I_m + BDB^H$$ where matrix $A$ is $m \times m$, matrix $B$ is $m \times k$, $BB^H \neq I_m$ and $D$ is a $k \times k$ diagonal matrix. Can we obtain the eigendecomposition ...
user164237's user avatar
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$ ...
GA316's user avatar
  • 1,269
0 votes
0 answers
236 views

Eigenvectors of a matrix

Let $M$ be a square matrix of order $n\times d$. Let $\xi_{1},\dots,\xi_{n\times d}$ be an orthonormal basis of $\mathbb{R}^{n\times d}$ formed of eigenvectors of $M$. We have $$\xi_{i}=(\lambda_1, 0,...
yassine yassine's user avatar
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$. ...
Henrique de Oliveira's user avatar
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}, $$ ...
MCH's user avatar
  • 1,324
2 votes
1 answer
661 views

Leading eigenvector value problem as an optimisation problem for asymmetric matrices

As noted in 1806.05647, given a symmetric matrix $A$, the leading eigenvector value problem (LEVP) $$Av = \lambda v,$$ where $A = A^T \in \mathbb{R}^{n \times n}$, $\lambda$ is the largest ...
user144910's user avatar
6 votes
0 answers
96 views

Finding the maximal component of a vector in sublinear time

Given a vector $u \in \Bbb R^n$, finding the value of the largest component of $u$ needs linear time in $n$. However, what if we additionally know that $u$ lies in some linear subspace $U \subset \Bbb ...
M. Winter's user avatar
  • 13.6k
1 vote
0 answers
86 views

Solution of a manipulated equation vs the maximum eigenvalue and eigenvector of a non-negative matrix

Lets assume we have the following equation: $AU=\lambda U \Rightarrow\left[ \begin{array}{c|c|c} 0 &A_{12}&A_{13}\\ \hline A_{21}& 0& A_{23}\\ \hline A_{31}&A_{32}&0 \end{...
afra's user avatar
  • 21
1 vote
0 answers
92 views

An inequality concerning the eigenvalues and eigenvectors of an SPD matrix

Let $Ax_i=\lambda_ix_i, \ (i=1,\cdots,n)$ be an eigensystem of the symmetric positive-definite diagonally-dominant matrix $A=\{a_{ij}\}$. Let $$b_{jk}=\sum_{i=1}^{n}{\frac{(x_i(j)-x_i(k))^2}{\...
shuai's user avatar
  • 11
1 vote
0 answers
171 views

Eigenvalues of non-negative block matrices

$B$ is a non-negative irreducible block matrix as follows: $$B= \left[ \begin{array}{c|c|c} 0 &B_{12}&B_{13}\\ \hline B_{21}& 0& B_{23}\\ \hline B_{31}& B_{32}&0 \end{array} \...
afra's user avatar
  • 21
-2 votes
1 answer
970 views

What can we say about the rank of the sum of a multiple of the identity matrix and a symmetric rank-$1$ matrix? [closed]

Suppose we have the following symmetric matrix. $$A = \sigma^2 I + u u^T$$ What can we say about the eigendecomposition of $A$?
Christo's user avatar
  • 67
4 votes
0 answers
447 views

How to find eigenvalues of following block matrices?

Is there a procedure to find the eigenvalues of A? ‎ $$A=\begin{bmatrix}X & I &&&&&&&&& 0\\I & 0 & P &&&&&&&&\\& P^t ...
Maryam Hak's user avatar
4 votes
1 answer
380 views

Rotatable matrix, its eigenvalues and eigenvectors

We say that a real matrix is rotatable iff after turning it clockwise on $90^{\circ}$ it doesn't change. I'm interesting about eigenvalues and eigenvectors (belonging to non-zero eigenvalues) of such ...
Mikhail Goltvanitsa's user avatar
5 votes
1 answer
8k views

Eigenvalues and eigenvectors of tridiagonal matrices

What can I say about the eigenvalues and eigenvectors of the tridiagonal matrix $T$ given as $T = \begin{pmatrix} a_1 & b_1 \\ c_1 & a_2 & b_2 \\ & c_2 & \ddots & \ddots \\ &...
Guilherme's user avatar
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-...
Saurabh Agrawal'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
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 $...
B. Arsic's user avatar
  • 123
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 &...
V. M. Martinez Alvarez's user avatar
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}$ ...
Janak's user avatar
  • 213
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 ...
Abhishek Halder's user avatar
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 = ...
jtg128's user avatar
  • 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} & \...
Spuds's user avatar
  • 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 ...
Ludwig's user avatar
  • 2,712
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), \...
Alexey Ustinov's user avatar
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
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. ...
jfhc's user avatar
  • 71
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 ...
Jorge I. González C.'s user avatar
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 & ...
Kasper's user avatar
  • 161
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
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$ (...
L S B. user255259's user avatar