All Questions
Tagged with linear-algebra sp.spectral-theory
37 questions with no upvoted or accepted answers
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
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
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
6
votes
0
answers
107
views
Eigenvalues of splitting scheme
In numerical analysis it is common to approximate a solution to a PDE
$$u'(t) = (A+B) u(t), \quad u(0)=u_0$$
which is just given by $e^{t(A+B)}u_0$ by the splitting $e^{tB/2} e^{tA} e^{tB/2}u_0.$ Here,...
- 536
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 $...
- 907
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
4
votes
2
answers
871
views
Decay of eigenfunctions for Laplacian
Consider the discrete second derivative with Dirichlet boundary conditions on $\mathbb C^n$.
Its eigendecomposition is fully known:
see wikipedia
It seems like the largest eigenvalue $\lambda_1$ is ...
4
votes
0
answers
126
views
An inequality from the "Interlacing-1" paper
This question is in reference to this paper, http://annals.math.princeton.edu/wp-content/uploads/annals-v182-n1-p07-p.pdf (or its arxiv version, http://arxiv.org/abs/1304.4132)
For the argument to ...
3
votes
0
answers
173
views
Where could a paper on a unification of matrix decompositions be published?
I've got a paper which shows that when the spectral theorem (as a statement that every self-adjoint matrix can be unitarily diagonalised) is naively generalised to $*$-algebras other than the complex ...
- 4,943
3
votes
0
answers
163
views
Perturbation theory compact operator
Let $K$ be a compact self-adjoint operator on a Hilbert space $H$ such that for some normalized $x \in H$ and $\lambda \in \mathbb C:$
$\Vert Kx-\lambda x \Vert \le \varepsilon.$
It is well-known ...
user136577
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 &...
user136033
2
votes
0
answers
331
views
What is the spectrum of this differential operator?
My self-adjount differential operator $L$ is defined by $$L f(x) \equiv u(x) \frac{\partial^2}{\partial x^2} \left( u(x) f(x) \right)$$ where $u(x)$ is a known but arbitrary smooth function that ...
- 151
2
votes
0
answers
153
views
Spectrum of an almost Hamiltonian matrix
I have a complex-valued block matrix $N=\begin{bmatrix}
A & B \\
C & -A^*
\end{bmatrix}$, where $A$ is diagonal, $B=B^*$, and $C$ is rank-1 but not Hermitian.
If $C$ were Hermitian, $N$ would ...
- 116
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
2
votes
0
answers
79
views
Upper bound for smallest eigenvalue of infinite family of graphs
Let $\left\{G_{n}\right\}_{n=1}^{\infty}$ be a sequence of regular simple connected graphs with at least one edge such that $G_i$ is an induced sub-graph of $G_{i+1}$ and is not equal to $G_{i+1}$.
...
- 133
2
votes
0
answers
75
views
Unimodality of a function of a non-negative matrix
I am taking an interest in the following problem:
Consider a real matrix with non-negative entries $\boldsymbol{A} \in \mathbb{R}_+^{d \times d}$, with $d \in \mathbb{N}$.
For $k \in \mathbb{N}$, ...
- 141
2
votes
0
answers
116
views
Smallest singular value distribution
Let $G_\mathbb{R}\in\mathbb{R}^{n\times n}$ and $G_\mathbb{C}\in\mathbb{C}^{n\times n}$ denote the real and complex Ginibre random matrices, i.e. random matrices with independent real/complex Gaussian ...
- 83
2
votes
0
answers
452
views
Largest eigenvalues distribution of tridiagonal symmetric random matrix
I would like to find the largest eigenvalue distribution of the following tridiagonal symmetric random matrix in an analytic way.
All the ${\lambda}_i$ are distributed the same way with chi-square (...
- 21
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
2
votes
0
answers
172
views
Second eigenvalue of a weighted tree
Hello,
I am interested in upper bounding the second largest eigenvalue of the adjacency matrix of a graph $T$ with the following property:
1. $T$ contains self loops.
2. $T$ contains multiple edges (...
- 225
2
votes
0
answers
143
views
Optimization over Spectral Laplacian in cycles and trees
Is there any idea on how one can deal with an optimization problem of sum of k largest eigenvalues(min) of Laplacian matrix of a simple cycle or tree?
I would like to use semidefinite programming for ...
- 161
2
votes
0
answers
291
views
Eigen-decomposition perturbation
Let $A$, $B$ and $A_k + B$ be symmetric matrices with eigenvalues $\sigma_1 \geq \sigma_2 \ldots \geq \sigma_n$, $\rho_1 \geq \rho_2 \ldots \geq \rho_n$ and $\lambda_1 \geq \lambda_2 \ldots \geq \...
- 21
1
vote
0
answers
70
views
Lower-bounding the eigenvalues of a certain positive-semidefinite kernel matrix, as a function of the norm of the input matrix
Let $\phi:[-1,1] \to \mathbb R$ be a function such that
$\phi$ is $\mathcal C^\infty$ on $(-1,1)$.
$\phi$ is continuous at $\pm 1$.
For concreteness, and if it helps, In my specific problem I have $\...
- 6,853
1
vote
0
answers
67
views
Spectral theorems for generalized Hermitian matrices
Let $k$ be a field, and let $\sigma$ be a nontrivial involutory automorphism of $k$. Let $A$ be a square matrix with entries in $k$, such that $(A^{\sigma})^T = A$; here $A^\sigma$ means the matrix $(...
- 4,547
1
vote
0
answers
51
views
Relation between nullity of components to its parent graph
Let $G$ be an undirected graph and the corresponding adjacency matrix be $A$. Let $v$ be a cut-vertex of $G$. Let $G_1, G_2,\dots, G_k$ are the connected components of the induced graph $G-v$ ( the ...
- 640
1
vote
0
answers
266
views
Interlacing Suleĭmanova spectra
A set of real numbers $\{\lambda_1, \dots, \lambda_n \}$, $n \geq 1$, is called a Suleĭmanova spectrum if it contains exactly one positive value and $\sum_{i=1}^n \lambda_i \geq 0$. (It is well-known ...
- 1,719
1
vote
0
answers
72
views
basis representation of a special sinc kernel
I have a functional map from $(x,y) \in \mathbb{R}^2$ to another function $f_{x,y}(z,w) \in \mathbb{C}$. (Variables $z,w $ range from $-\infty$ to $\infty$.) That is, for any pair $x,y$, I get a ...
- 31
1
vote
0
answers
631
views
Bounding the largest Singular value
D is a $n \times n$ diagonal matrix whose diagonal entries lies in $(0,1]$.
B is any $n \times n$ n.n.d. matrix.
What will be the sharpest upper bound on the largest eigenvalue of:
$(D+B)^{-1}D^2(...
1
vote
0
answers
127
views
Unitary transformation of a Hermitian indefinite pencil to a real non-symmetric pencil
Given a Hermitian indefinite pencil $(A-\lambda B)$ where both $A=A^H$ and $B=B^H \in \mathbb{C}^{n\times n}$ are possibly indefinite, it is straightforward to show that the eigenvalues are either ...
- 757
1
vote
0
answers
244
views
Distribution of a signal covariance matrix
A common estimation problem in signal processing assumes the following signal model
\begin{equation}
\mathbf{r} = \sum_{i=1}^{Q}\alpha_i\mathbf{s}\left(w_i\right)+\mathbf{n}
\end{equation}
where $\...
- 345
1
vote
0
answers
209
views
An optimization problem on the sphere
Let $S$ be a sphere centered at origin in $\Bbb R^{2n}$ of radius $\sqrt{2n}$. Let $D$ be a diagonal matrix. Let $U$ be an orthogonal matrix. Let $r\in\Bbb Z_+$ be a fixed integer.
Let vector $v\in\...
- 13.9k
1
vote
0
answers
87
views
Possible diagonal values of a product of matrices with some specific characteristics
Hello all,
This is a question that might or might not be related to my previous one.
Imagine you have two matrices:
Matrix $\mathbf{\Phi}=[\Phi_1,\ldots,\Phi_M]\in\mathbb{R}^{L\times M}$ where $M\...
- 345
1
vote
0
answers
393
views
iterated characteristic polynomials
If I have $N$ $M\times M$ symmetric positive definite matrices $A_i$ and an $N\times N$ positive semi-definite symmetric matrix B, let the $N\times N$ matrix $C_{ij}(\lambda)=B_{ij}$ for $i\ne j$ and $...
- 11
0
votes
0
answers
74
views
Computing the eigenvalues of $A+E$ where $A$ is an upper triangular matrix whose diagonal entries are all zero and $E$ is a rank one matrix
Let us consider the backward-shift matrix $B=(b_{ij})\in M_n(\mathbb{R})$ whose entries are given by $b_{k,k+1}=1$ and the other entries are all 0. We also consider $X=(x_{ij})\in M_n(\mathbb{R})$ ...
- 4,058
0
votes
0
answers
104
views
Necessary and sufficient conditions for $\mbox{trace}(A^{-1/2}e^{-tB} (AB+BA) e^{-tB}A^{-1/2}) \ge 0$ for all $t$
Let $A$ and $B$ be positive-definite matrices of the same size. For any $t \ge 0$, define
$$
u(t) := \mbox{trace}(A^{-1/2}e^{-tB} (AB+BA) e^{-tB}A^{-1/2}).
$$
Question. What are necessary and ...
- 6,853
0
votes
0
answers
117
views
"Almost orthogonalizing" matrices using a signature matrix
Suppose $A$ and $B$ are two real symmetric $n \times n$ matrices (If simpler, consider $A$ and $B$ to be 0/1 matrices, say, adjacency matrices of d-regular graphs).
Then $||AB||_{op} \leq ||A||_{op}||...
- 949
0
votes
0
answers
146
views
Global solution for spectral clustering
I used spectral clustering for directed graphs suggested by Dengyong Zhou paper to partition the graph.I selected the eigen vectors corresponding to k largest eigen values and then I use kmeans or FCM ...
- 13