All Questions
Tagged with sp.spectral-theory matrices
9 questions
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,893
20
votes
2
answers
8k
views
Conditions for smooth dependence of the eigenvalues and eigenvectors of a matrix on a set of parameters
Let $A\in\mathcal M_n$ be an $n\times n$ real [symmetric] matrix which depends smoothly on a [finite] set of parameters, $A=A(\xi_1,\ldots,\xi_k)$. We can view it as a smooth function $A:\mathbb R^k\...
- 4,312
17
votes
5
answers
2k
views
Can always a family of symmetric real matrices depending smoothly on a real parameter be diagonalized by smooth similarity transformations?
This question is related to another question, but it is definitely not the same.
Is it always possible to diagonalize (at least locally around each point) a family of symmetric real matrices $A(t)$ ...
- 4,312
1
vote
0
answers
455
views
Possibility of Disconnected Subgraphs of a $k$ Connected $r$ regular Graph under a given condition
Context: Given a adjacency matrix A of a $r$-regular graph $G$ (not complete graph $K_{r+1}$) . $G$ is $k$ connected.
The matrix A can be divided into 4 sub-matrices based on adjacency of vertex $x ...
- 267
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 ...
- 143
9
votes
0
answers
802
views
Positive definiteness of matrix
This question is about the positive definiteness of a (non-random) matrix that is defined using random variables as follows:
We fix the vector $v=(1,1)$ (yet, it seems the final result does not ...
- 192
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
$...
- 536
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
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 ...
- 75