All Questions
202 questions
2
votes
1
answer
999
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
1
answer
241
views
Monotonicity of eigenvalues II
In a previous question here, I asked the question below for block matrices and received an answer showing the question is true if $\mathcal B$ is hermitian and false, in general if $\mathcal B$ is non-...
6
votes
1
answer
601
views
Monotonicity of eigenvalues
We consider block matrices
$$\mathcal A = \begin{pmatrix} 0 & A\\A^* & 0 \end{pmatrix}$$ and
$$\mathcal B = \begin{pmatrix} 0 & B\\C & 0 \end{pmatrix}.$$
Then we define the new matrix
$...
6
votes
4
answers
1k
views
Under what conditions are the eigenvalues of a product of two real symmetric matrices real?
Under what conditions are the eigenvalues of a product $M = A B$ of two real symmetric matrices $A$ and $B$ real?
And is there a way to relate the signs of the eigenvalues of $M$ to any properties of $...
0
votes
0
answers
46
views
What kind of bounds for $\mathrm{Re}(\lambda(A))$ when $\lambda_{\mathrm{max}}(A + A^t) < 0$?
What can be said about the real parts of eigenvalues of $A \in \mathbb R^{n\times n}$ when $\lambda_{\max}(A + A^t) < 0$?
I think the real parts of eigenvalues of $A$ will be negative, but I can't ...
0
votes
1
answer
263
views
Change in the largest eigenvalue due to perturbation of diagonal components of a symmetric matrix
Let $A\in \mathbb{R^{n\times n}}$ be a symmetric negative difinite matrix and
$D\in \mathbb{R}^{n\times n}$ be a diagonal matrix $D = \mathrm{diag}\{d_i\}, (d_i < 0)$.
From Weyl's inequality, the ...
2
votes
1
answer
74
views
Limitation through the singular values
Given matrix $X \in \mathbb{R}^{m\times n}$ and sequence $\left\{X^k\right\}_k$ converges to $X$ according to the Frobenius norm. I wonder that $\sigma_i(X^k)$ converge $\sigma_i(X)$ or not (where $\...
2
votes
0
answers
345
views
Extension of the Gershgorin circle theorem for symmetric matrices and localization of positive eigenvalues
In mathematics, the Gershgorin circle theorem can be used to localize eigenvalues of a matrix (including symmetric). Let $A$ be a real symmetry $n × n$ matrix, with entries $a_{ij}$. For $i∈{1,…,n}$ ...
1
vote
1
answer
260
views
How can I obtain the eigenvalues of this matrix?
Consider the following $M \times 3$ matrix
$$\mathbf F = [\mathbf h_1, \mathbf h_2, \mathbf h_3],$$
with distinct non-zero singular values $\sigma_1 >\sigma_2 > \sigma_3$, where $\mathbf h_k$'s ...
1
vote
0
answers
618
views
Largest eigenvalue of matrix A smaller than 1, what about B when A=B+C? [closed]
Suppose I have a square matrix $A$ that only has non-negative real entries and is not symmetric and not primitive either. It has no "special" structure we could exploit. I know that the ...
12
votes
2
answers
1k
views
Eigenvalue perturbation theory via Feynman diagrams
Suppose I have a matrix given by a sum
$$A=D+\epsilon B$$
where $D$ is diagonal and $\epsilon$ is small, and I want the eigenvalues of $A$ as a power series in $\epsilon$. The first two orders in ...
9
votes
1
answer
3k
views
Connection between eigenvalues of matrix and its Laplacian.
Hello!
There are two definitions of graph spectrum:
1) Eigenvalues of adjacency matrix $A$.
2) Eigenvalues of Laplacian of adjacency matrix ($L$).
Different sources offer different properties based ...
1
vote
0
answers
331
views
Eigenvalues of an (almost) pentadiagonal symmetric Toeplitz matrix
I am looking for analytic expressions for the eigenvalues of matrices of the form
$$A = \begin{bmatrix}
6 & -4 & 1 & 0 & 0 & 0 & 0 \\
-4 & 6 & -4 & 1 & 0 &...
2
votes
0
answers
81
views
Perturbed Gram matrix
Let $x_t \in \mathbb{S}^{d-1}$, $\forall t\in \mathbb{N}$ and let $e_1$ be the first canonical basis vector of $\mathbb{R}^d$, ie, $e_1 = (1,0,\cdots,0)$. Let us form a Gram Matrix
$$\sum_{t=1}^T(x_t ...
1
vote
1
answer
1k
views
Prove that absolute value of eigenvalue is smaller than 1 [closed]
I want to prove that the absolute value of the eigenvalues of a matrix A are smaller than 1 for $$A=\left(\begin{array}{cc}
0 & -H_{11}^{-1} H_{12} \\
-H_{22}^{-1} H_{21} & 0
\end{array}\right)...
2
votes
1
answer
236
views
How can I prove a randomly generated matrix has distinct non-zero eigenvalues?
Consider the following $M×M$ matrix
$$
\mathbf A=\sum_{k=1}^K =a_k \mathbf h_k \mathbf h_k^H,(M≥K)
$$
where $a_k$'s are real values and $h_k$'s are $M×1$ randomly generated vectors, e.g., complex ...
11
votes
1
answer
927
views
Imaginary eigenvalues
Consider the matrix
$$A(\mu) = \begin{pmatrix} 0 & 1& 0 & 0 \\ -1 & -i\mu & 0 & i \\ 0 & 0 & 0 & 1 \\ 0 &i & -1 & i\mu \end{pmatrix}.$$
This matrix is ...
2
votes
1
answer
212
views
Similarity of two matrices
Consider the matrix, for some $\lambda \in \mathbb R$ .
$$A=\begin{pmatrix} i \lambda & -1 & i & 0 \\ 1 & 0 & 0& 0 \\ i & 0 & - i \lambda & -1 \\ 0 & 0 & 1 ...
13
votes
3
answers
2k
views
Eigenvalue pattern
We consider a matrix
$$M_{\mu} = \begin{pmatrix} 1 & \mu & 1 & 0 \\ -\mu & 1 & 0 & 1 \\ -1 & 0 & 0 & 0 \\ 0 &-1 & 0 & 0 \end{pmatrix}$$
One easily ...
3
votes
1
answer
2k
views
Eigenvalues of a block matrix with zero diagonal blocks
Suppose $A$ is a $k_1\times k_2$ matrix with real entries, $k_1<k_2$. Let $M$ be the matrix
\begin{equation}
M:=\begin{pmatrix}
0_{k_1} & A\\ A^\top & 0_{k_2}
\end{pmatrix},
\end{equation}
...
10
votes
2
answers
614
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
125
views
A monotonicity property of eigenvalues
Let $A \in S^{n}_{+}$ be a positive semi-definite matrix and $D \in S^{n}_{+}$ a diagonal matrix with all the diagonal entries no smaller than one, i.e., $D_{ii} \geq 1$ for all $i \leq n$.
I wonder ...
1
vote
0
answers
373
views
Upper bound on the sum of the smallest non-zero eigenvalues
Let $\mathcal A := \{ A_1, A_2, \dots, A_n \} \subset \Bbb R^{d \times d}$ be a set of symmetric and positive semidefinite matrices.
For a matrix $A_k \in \mathcal A$, denote its (real) eigenvalues by ...
2
votes
2
answers
201
views
Eigen problem with constrained (equal) eigenvalues
Let $\Omega$ be a symmetric and positive definite matrix. From a test of hypothesis I know that some eigenvalues are likely to be equal (the test also suggests which eigenvalues). Do you have any ...
1
vote
0
answers
39
views
Characterisation of Coxeter matrices with all non-real eigenvalues having absolute value 1
Let $C$ be an invertible integer matrix. Then a matrix $M$ is called Coxeter matrix (following Sato in https://www.sciencedirect.com/science/article/pii/S0024379505001709?via%3Dihub ) when $M=-C^{-1} ...
3
votes
0
answers
374
views
Eigenvalues of block matrix
Given scalars $\alpha, \beta \in \mathbb{R}$, a symmetric positive definite matrix $A \in \mathbb{R}^{n\times n}$ and a flat matrix $B \in \mathbb{R}^{m\times n}$, where $m < n$, can I say ...
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 ...
16
votes
2
answers
1k
views
Spectral symmetry of a certain structured matrix
I have a matrix
$$ A= \begin{pmatrix} 0 & a & d & c\\ \bar a & 0 & b & d \\ \bar d & \bar b & 0 & a \\ \bar c & \bar d & \bar a & 0 \end{pmatrix} $$
As ...
3
votes
2
answers
432
views
Maximum eigenvalue of a covariance matrix of Brownian motion
$$ A := \begin{pmatrix}
1 & \frac{1}{2} & \frac{1}{3} & \cdots & \frac{1}{n}\\
\frac{1}{2} & \frac{1}{2} & \frac{1}{3} & \cdots & \frac{1}{n}\\
\frac{1}{3} & \frac{...
5
votes
1
answer
2k
views
Condition for block symmetric real matrix eigenvalues to be real
I have a $2n \times 2n$ block symmetric matrix that in the simplest case ($n=2$) looks like:
$$
M_2 = \begin{bmatrix}
a_1 & 0 & b_{1,2} & -b_{1,2}\\\
0 & -a_1 & b_{1,2} & -b_{...
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}
\...
5
votes
1
answer
241
views
Trace inequality under consideration of definiteness
Let $G \in \mathbb{R}^{3 \times 3}$ a symmetric, but indefinite matrix and $U \in \mathbb{R}^{3\times 3}$ a symmetric and positive definite matrix. I would like to prove the inequality
$$ \text{Tr} \...
3
votes
1
answer
534
views
Spectrum of the sum of two general matrices
Are there any restrictions on the possible spectrum of the sum of two arbitrary matrices with given spectra other than the trace identity?
In other words:
Let $\alpha, \beta, \gamma$ be $n$-tuples (...
0
votes
0
answers
54
views
Is there a method to find a vector that optimizes a Rayleigh quotient over a subspace?
Let $M\in\mathbb{C}^{n\times n}$ be an arbitary Hermitian matrix and let $E$ be a subspace of $\mathbb{C}^n$.
Is there a method to find vectors $y,z\in E$ such that
$$\dfrac{y^*My}{y^*y}=\sup_{x\in E\\...
-2
votes
1
answer
353
views
Can we attain the maximum and minimum of a Rayleigh quotient over any subspace? [closed]
Let $M\in\mathbb{C}^{n\times n}$ be a Hermitian matrix and let $E$ be a subspace of $\mathbb{C}^n$.
$$\mbox{Are } \sup_{x\in E\\
x\neq0}\dfrac{x^*Mx}{x^*x}\mbox{ and }\inf_{x\in E\\
x\neq0}\dfrac{x^*...
1
vote
0
answers
126
views
Fastest way to calculate the eigenvalues of a product of two Toeplitz matrices
I have the following problem:
I need to find the fastest way to calculate the eigenvalues of a matrix that is the product of two Toeplitz matrices. $B = A U$.
The first is a regular Toeplitz matrix $A$...
17
votes
3
answers
2k
views
Finding the nearest matrix with real eigenvalues
In this thread on MATLAB Central, I found a discussion on finding the nearest matrix with real eigenvalues. The first hypothesis was to simply truncate the complex part of the eigenvalues. So, given ...
4
votes
1
answer
2k
views
Relation of row sums to largest eigenvalue
I know that the largest eigenvalue of a graph is bounded between the minimal and maximal row sum of the matrix. If I have a $0-1$ symetric matrix (an adjacency matrix) and I know $k$ of the rows have ...
1
vote
1
answer
350
views
A linear algebra question regarding the eigenvalues of the product of a diagonal matrix and a projection matrix
I need to prove a statement in my research. The statement seems to be fundamental linear algebra, and numerical studies in MATLAB supported this statement, but I wasn't able to prove it after a few ...
7
votes
0
answers
906
views
The Möbius function as eigenvalues
Let the $N$ by $N$ matrix $A$ be defined by the tetration:
$$\Large \text{If } \gcd(n, k)=1 \text{ then } A(n,k)= \underbrace{e^{e^{\cdot^{\cdot^{e^{\Re\left(\frac{1}{n^s}\right)}}}}}}_m \text{ else }...
1
vote
1
answer
276
views
Spectral decomposition of a $4\times4$ real nonsymmetric matrix with unknown elements
I'm trying to eigendecompose the following matrix $A$, i.e. to find $Q$ and $\Lambda$ such that
$$
A = \begin{bmatrix}
-\alpha & \alpha & -\gamma^{-1} & 0\\
\beta &...
2
votes
0
answers
106
views
Connections between eigenvalues of $B$ and $A+iB$
Consider two symmetric and real matrices $A,B\in\mathbb{R}^n$ and definie $A+iB$. Note that $A+iB$ is not hermitian in this case. There are many results based on Brendixson and Courant-Fischer, saying,...
1
vote
2
answers
2k
views
Eigenvalues of tridiagonal symmetric matrix
Could you tell me please, are there any analytical methods how to find eigenvalues of matrix such this one?
$$
\begin{pmatrix}
a_1 & b_1 & 0 & 0 & 0 & \ldots & 0 \\
b_1 & ...
13
votes
0
answers
809
views
Can one Gershgorin circle (only) contain all eigenvalues, when the other circles are not contained in it
In short, following a question from my students, I am trying to find a special case where all the eigenvalues of a matrix lie within only one circle, but not in the others, and the other circles are ...
-2
votes
3
answers
2k
views
When is it possible to find the sum of all elements of inverse of a matrix?
Given sum of elements of each row of a positive definite square matrix $M$ of order $n$ all of whose entries are non-negative, when is it possible to find the sum of all elements of the matrix $M^{-1}$...
1
vote
1
answer
312
views
Relation between the algebraic multiplicity of an eigenvalue and the subdiagonal elements of a symmetric tridiagonal matrix [closed]
Show that if $T$ is a symmetric tridiagonal matrix and an eigenvalue $\lambda$ has multiplicity $k$, then at least $k−1$ subdiagonal elements of $T$ are zero.
If we consider a submatrix $B$ that has ...
1
vote
0
answers
132
views
Transformations preserving the number of distinct eigenvalues
Let $A\in\mathbb{R}^{n\times n}$ be an $n\times n$ symmetric, invertible matrix with nonnegative real entries, $\mathbf{1}$ be the all one $n$-dimensional vector, and $\mathrm{diag}(v)$, $v=[v_1,v_2,\...
2
votes
0
answers
146
views
Upper bound on some eigenvalue problem
Let $A_1,\ldots,A_m \in R^{n\times n}$ be symmetric and positive semidefinite, and suppose that their sum $A$ is positive definite. For some nonzero vector $u\in R^n$ with $u^TA_ju>0$ for all $j$, ...
2
votes
0
answers
550
views
Eigenvalues of a specific Hankel matrix
I have an $\frac{N}{2} \times \frac{N}{2}$ matrix $G$ with entries given by
\begin{equation}
G_{ij} = \frac{1}{\sin(\frac{\pi}{N}(i+j-\frac{3}{2}))}, \;\;\;\;\;\;\;\; 1 \le i,j \le \frac{N}{2},
\end{...
1
vote
1
answer
711
views
Eigenvalues of the product of traceless unitary hermitian matrices [closed]
As a follow up of the question raised in Determinant involving traceless unitary hermitian matrices, I would like to pose a similar question.
If A and B are distinct traceless unitary hermitian ...