All Questions
7 questions with no upvoted or accepted answers
3
votes
0
answers
1k
views
Eigenvalues of block-hermitian matrices with zero diagonal blocks
I have a matrix of the form
$$D = \left( \begin{array}{cc} 0 & C \\ C^{\dagger} & 0 \end{array} \right)$$
where $C$ is not necessarily hermitian. In general, can we say anything about the ...
- 47
2
votes
0
answers
677
views
Bounds on smallest Eigenvalue of the Sum of a Standard Laplacian and a Diagonal Matrix
I'm trying to find upper boundaries on the smallest Eigenvalue $\lambda_1$ of $L + E$, where $L$ is a standard Laplacian of an unweighted digraph, with $\lambda_1(L) = 0$ and $E \in \{0,1\}^{n \times ...
- 21
2
votes
0
answers
132
views
Characterizing the singular values of a matrix with structure
Suppose we have a function from $\mathbb{R}^2\to\mathbb{C}$,
$$f(x,y) = e^{\imath\pi x g(y)}$$
where $g(y)$ is periodic in $y\in[-T, T),\ T<\infty$ (e.g., a sinusoid) and $0\leq x < \infty$
...
- 21
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 ...
- 245
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,712
1
vote
0
answers
129
views
Matrix majorization when a diagonal matrix is multiplied from right and left
Let $D_1$ and $D_2$ be two diagonal matrices such that $D_1^2+D_2^2=I$ (identity matrix). Suppose matrix $A$ majorizes matrix $B$. Can we show that matrix $A$ majorizes matrix $D_1 A D_1 + D_2 B D_2$? ...
- 181
0
votes
0
answers
32
views
Eliminating nullity for enhanced non-singularity
If we have an
$n\times n$ matrix $A$ with entries either $0$ or $1$, where all diagonal entries are $0$ and the rank is $k<n$, can we reach full rank by changing exactly $n-k$ zero off-diagonal ...
- 4,058