All Questions
58 questions
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 & ...
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 ...
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 \...
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{...
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 ...
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 & &\\
& &...
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 ...
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 \...
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{...
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 & ...
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, \...
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 & \...
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}, $$ ...
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 &...
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 \...
11
votes
3
answers
9k
views
Eigenvectors of a symmetric positive definite Toeplitz matrix
I wish to efficiently compute the eigenvectors of an n x n symmetric positive definite Toeplitz matrix K. A full eigendecomposition would be even better.
Although I assumed this would be a well ...
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 $...
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,...
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 ...
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 ...
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 = ...
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}
\...
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 ...
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
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 ...
-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$?
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 & ...
7
votes
1
answer
6k
views
Eigenvectors as continuous functions of matrix - diagonal perturbations
The general question has been treated here, and the response was negative. My question is about more particular perturbations. The counterexamples given in the previous question have variations not ...
4
votes
1
answer
1k
views
Why are 1 and -1 eigenvalues of this matrix?
This is a subject I've been working on for a very long time now, but still did not manage to fully understand the interesting properties of this matrix $\mathbf{A}$.
First, let's define two matrices:
...
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 & ...
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 ...
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
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{...
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$ (...
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 ...
10
votes
2
answers
4k
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 A_1)...
9
votes
1
answer
3k
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 ...
11
votes
1
answer
2k
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 $T$-invariant complement(for algebraically ...
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
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 ...
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 &...
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 ...
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?
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 ...
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 ...
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 ...
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} & \...
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\...
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\\\
&&...
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 ...