All Questions
39 questions
3
votes
2
answers
392
views
Monotonicity of matrix conjugation
Let $A$ and $B$ be positive-definite matrices such that $A \le B.$
By matrix monotonicity of the root, this also implies that $A^{\alpha} \le B^{\alpha}$ for $\alpha \in [0,1].$
I am now curious under ...
- 6,351
2
votes
1
answer
455
views
On a theorem of Carlson on the necessary and sufficient condition for a matrix to have $m$ real eigenvalues
Background: In the physics of open quantum systems the Lindbladian $\mathcal{L}$ governs the evolution of quantum states through the Lindblad master equation.
The Lindblad operator usually has ...
- 1,054
7
votes
0
answers
195
views
Hölder continuity of spectrum of matrices
Endow $\mathbb{C}^{d \times d}$ with the norm induced by the Euclidean norm on $\mathbb{C}^d$. It is well-known (to those who know it well, I guess) that the spectrum $\sigma(A)$ of a matrix $A \in \...
- 12.5k
1
vote
1
answer
209
views
Eigenvalues invariant under 90° rotation
Consider $N \times N$ matrices
$$A = \begin{bmatrix}
0 & 0 & \cdots & 0 & 1 \\
1 & 0 & 0 & & 0 \\
\vdots & 1 & 0 & \...
- 3,446
4
votes
1
answer
147
views
prove spectral equivalence bounds for inverse fractional power of matrices
The question is an extention to the answered question prove spectral equivalence bounds for fractional power of matrices.
Let $A, D \in \mathbb{R}^{n \times n}$ be two symmetric,positive definite and ...
- 128k
3
votes
1
answer
80
views
prove spectral equivalence bounds for fractional power of matrices
Let $A, D \in \mathbb{R}^{n \times n}$ be two symmetric,positive definite and tri-diagonal matrices for that we know that they are spectrally equivalent, thus ist holds
$$ c^- x^\top D x \le x^\top A ...
- 128k
2
votes
0
answers
121
views
Eigenvalues of two positive-definite Toeplitz matrices
Consider two positive-definite Toeplitz matrices $M_1$ and $M_2$ both with dimension $2^j \times 2^j$. Their matrix elements are:
$$M_1[x,y] = \frac{\text{sin}(\pi(x-y)/2^j)}{\pi(x-y)} \qquad M_2[x,y] ...
- 21
16
votes
3
answers
2k
views
Why is the set of Hermitian matrices with repeated eigenvalue of measure zero?
The Hermitian matrices form a real vector space where we have a Lebesgue measure. In the set of Hermitian matrices with Lebesgue measure, how does it follow that the set of Hermitian matrices with ...
- 12.9k
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-...
- 233
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
$...
- 785
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 &...
- 73
2
votes
1
answer
178
views
Expressing the singular values of a 2-by-2 real-valued matrix by the norm of the two columns and the angle between them
I'm looking for an elegant way to show the following claim.
Claim: Let $m_1, m_2 \in \mathbb{R}^2$ be the two columns of matrix $M \in \mathbb{R}^{(2 \times 2)}$. The singular values of the matrix are ...
- 188k
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 ...
- 188k
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 ...
CommunityBot
- 1
3
votes
1
answer
791
views
Real part of eigenvalues and Laplacian
I am working on imaging and I am a bit puzzled by the behaviour of this matrix:
$$A:=\left(
\begin{array}{cccccc}
1 & 0 & 0 & -1 & 0 & 0 \\
0 & 0 & 0 & 0 & -1 &...
CommunityBot
- 1
3
votes
1
answer
151
views
Commutation between integrating and taking the minimal eigenvalue
Let $S = (f_{ij})_{ij}$ be a $n \times n$ real symmetric matrix, with functions $f_{ij} \in L^1(\mathbb{R}^d,\mathbb{R})$ in it. We define $\left(\int u S \right)_{ij} = \int u S_{ij}$ as the ...
- 20.2k
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 ...
1
vote
2
answers
876
views
Matrix logarithms are not unique
In my ODE class, we proved that if $\exp(L) = \exp(L')$ then the eigenvalues are congruent mod $2 \pi i$. Here, $L$ and $L'$ are two $n \times n$ matrices. I wanted to know if something more precise ...
- 63.9k
6
votes
1
answer
299
views
Phase transition in matrix
Playing around with Matlab I noticed something very peculiar:
Take the symmetric matrix $A \in \mathbb R^{n \times n}$ defined by
$$A_{ij}= i \delta_{ij} - \frac{\varepsilon}{\sqrt{i}\sqrt{j}}\,.$$
...
- 536
1
vote
1
answer
2k
views
Positive matrix and diagonally dominant
There is a well-known criterion to check whether a matrix is positive definite which asks to check that a matrix $A$ is
a) hermitian
b) has only positive diagonal entries and
c) is diagonally ...
- 20.2k
0
votes
1
answer
262
views
Perturbing a normal matrix
Let $N$ be a normal matrix.
Now I consider a perturbation of the matrix by another matrix $A.$
The perturbed matrix shall be called $M=N+A.$
Now assume there is a normalized vector $u$ such that $\...
CommunityBot
- 1
5
votes
1
answer
417
views
Stable matrices and their spectra
I am a graduate student in engineering and we work a lot with so-called Hurwitz (or stable) matrices.
A matrix in our terminology is called stable if the real part of the eigenvalues is strictly ...
- 1,167
3
votes
1
answer
463
views
Spectrum of this block matrix
Consider the following block matrix
$$A = \left(\begin{matrix} B & T\\ T & 0 \end{matrix} \right)$$
where all submatrices are square and
matrix $B = \mbox{diag}\left(b_1 ,0,0,\dots,0,b_n \...
6
votes
1
answer
487
views
Intuitive proof of Golden-Thompson inequality
Sutter et al. [1] in their paper "Multivariate Trace Inequalities" give an intuitive proof of the following Golden-Thompson inequality:
For any hermitian matrices $A,B$:
$$
\text{tr}(\exp{(A+B)}) \...
- 31.5k
5
votes
2
answers
1k
views
spectral radius monotonicity
I encountered an inequality when reading a paper. Can someone help to show how to prove it?
Let be the spectral radius of matrix $A$ or $\rho(A)=\max\{|\lambda|, \lambda \text{ are eigenvalues of ...
6
votes
0
answers
587
views
Lower bound on the sum of singular values for a sum of Hermitian matrices
Denote the eigenvalues of an $n\times n$ matrix $\mathbf{X}$ by $\lambda_i(\mathbf{X})$ and its singular values by $\sigma_i(\mathbf{X})$, $i=1,\ldots,n$. When $\mathbf{X}$ is Hermitian, we know that $...
- 159
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 ...
- 34.7k
4
votes
5
answers
4k
views
About adding a negative definite rank-1 matrix to a symmetric matrix
If $B$ is a symmetric matrix then how do its eigenvalues compare to the eigenvalues of $B - vv^T$? ( where $v$ is a vector of the same dimension as $B$)
I guess that the eigenvalues of $B - vv^T$ ...
- 1,748
2
votes
1
answer
86
views
Information on special matrices similar to Jacobi matrices
Jacobi matrices are well known and deeply investigated mathematical objects from various point of view. One can arrive at these operators while studying discrete systems of particles interacting with ...
- 188k
7
votes
0
answers
217
views
Characterizing matrices with rank constraint
Given matrix $M\in\Bbb\{0,1\}^{n\times n}$, is there a nice method to characterize $$\mathscr{D}[M]=\{Q\in\Bbb\{0,1\}^{n\times n}:\mathsf{rank}(M-Q)= \mathsf{rank}(Q),\quad M-Q\in\Bbb\{0,1\}^{n\times ...
- 13.9k
0
votes
1
answer
204
views
Are these particular kinds of matrices well known?
Given two positive integers $n$ and $a \leq \frac{n}{2}$ consider a $n \times n$ matrix $A$ such that,
all the diagonal entries are either $a$ or $a+1$
all the non-zero off-diagonal entries are $\pm ...
- 9,650
2
votes
0
answers
279
views
Eigenvalues of this matrix
I have a linear map that is defined by $$T:\text{lin}(1,...,x^m) \rightarrow \text{lin}(1,...,x^m) \text{ with}$$ $$x^k \mapsto 2w(k-m)x^{k+1}+(k^2-k-w^2)x^k-2kwx^{k-1}+(k-k^2)x^{k-2}$$
Let me give a ...
- 329
1
vote
1
answer
546
views
Existence of a real eigenvalue
I have a matrix $M \in \mathbb{R}^{(n+1) \times (n+1)}$ that is tridiagonal.
In numerical computations I found out that I always find a real eigenvalue. My question is: Is there a theorem that ...
CommunityBot
- 1
29
votes
3
answers
3k
views
Perron-Frobenius "inverse eigenvalue problem"
The Perron-Frobenius theorem says that the largest eigenvalue of a positive real matrix (all entries positive) is real. Moreover, that eigenvalue has a positive eigenvector, and it is the only ...
- 4,679
3
votes
1
answer
944
views
numerical range of a column-zero-sum matrix
I am trying to produce an example of a (necessarily non-normal) matrix that has only eigenvalues with positive real part, but whose numerical range contains elements with strictly negative real part. ...
- 39.9k
1
vote
1
answer
720
views
Eigenvalues of Sum of non-singular matrix and diagonal matrix
Suppose $D={\rm diag}(d_i)$ is a diagonal matrix with all diagonal entries $d_i=\pm 1$. This implies $D^2=I$.
Suppose $A$ is a non-singular Hermitian matrix. If we know that $A+A^{-1}+D$ has rational ...
- 12.1k
8
votes
0
answers
738
views
Bounding sum of first singular values squared for Kronecker sum of traceless matrices
Let $A$ and $B$ be $4\times4$ traceless matrices with Hilbert-Schmidt norms summing up to $1/4$, i.e.
$$\text{Tr}\left[ A\right]=\text{Tr}\left[ B\right] = 0,\qquad\text{Tr}\left[ A^\dagger A + B^\...
- 1,612
9
votes
1
answer
1k
views
0 eigenvalue for a symmetric tridiagonal matrix
Let $T\in \mathbb{R}^{n\times n}$ be a symmetric tridiagonal matrix having the off--diagonal entries equal to -1. The diagonal entries are all positive, $a_i>0$, $i=\overline{1,n}$, and there ...
- 28.6k
4
votes
1
answer
1k
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 ...
- 20.2k