Skip to main content

All Questions

Filter by
Sorted by
Tagged with
3 votes
1 answer
187 views

Eigenvalues of certain matrices

We write $R(\theta)=\left(\begin{smallmatrix}\cos(2\pi\theta)&\sin(2\pi\theta)\\ -\sin(2\pi\theta)&\cos(2\pi\theta)\end{smallmatrix}\right)$ for any $\theta\in\mathbb R$. Let $d,m,n,r$ be a ...
emiliocba's user avatar
  • 2,446
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 ...
ABB's user avatar
  • 4,058
0 votes
1 answer
224 views

Faulty algorithm for simultaneous diagonalization?

I found a simple algorithm for simultaneous diagonalization of two commuting matrices (Nordgren - Simultaneous Diagonalization and SVD of Commuting Matrices), which seemed to be well-founded. For ...
TobiR's user avatar
  • 103
3 votes
1 answer
144 views

On the bounds of the sum of the squares of spectral variation of two real symmetric matrices

Suppose $A$ and $B$ are two symmetric real $\{0,1,-1\}$ matrices of order $n$ with diagonal elements as zeros (therefore the traces are zeros) and eigenvalues $\lambda_1\ge \lambda_2\ge \dotsb \ge \...
shahulhameed's user avatar
1 vote
1 answer
150 views

eigenvalues of matrices (with positive entries)

I am reading an old paper by Kawpien and Pelczynski, Studia Math. 1970. It claims that singular values of a matrix (with positive entries? I am not sure) is given by $t_i=\sqrt{\sum_{j\ge 1}a(i,j)^2}$....
user92646's user avatar
  • 617
2 votes
1 answer
156 views

Minimal Laplacian spread of a graph

Laplacian spread of a graph is the difference among the largest and the second smallest Laplacian eigenvalue of the graph. Is there any result or conjecture that discusses about the graphs having ...
Anđela Todorović's user avatar
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} ...
AdamNie's user avatar
  • 53
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 ...
Apprentice's user avatar
3 votes
1 answer
4k views

Eigenvalues of product of symmetric positive definite matrices

Let $T_1, \ldots, T_n$ by real symmetric positive definite matrices, with eigenvalues bounded below by $\mu > 0$. Can I say $$ \frac{x^T T_1 T_2 \ldots T_n x}{x^T x} \geq \mu^n $$ If these matrices ...
Mido's user avatar
  • 41
8 votes
1 answer
5k views

Eigenvectors of Kronecker Product [closed]

Conjecture If $A$ and $B$ are two complex square matrices, then every eigenvector of $A\otimes B$ is of the form $x\otimes y$, where $x$ is an eigenvector of $A$ and $y$ is an eigenvector of $B$. ...
Henrique de Oliveira's user avatar
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,\...
Ludwig's user avatar
  • 2,712
5 votes
1 answer
8k views

Eigenvalues and eigenvectors of tridiagonal matrices

What can I say about the eigenvalues and eigenvectors of the tridiagonal matrix $T$ given as $T = \begin{pmatrix} a_1 & b_1 \\ c_1 & a_2 & b_2 \\ & c_2 & \ddots & \ddots \\ &...
Guilherme's user avatar
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 ...
Unwieldy Bob's user avatar
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 ...
Andrea F.'s user avatar
  • 185
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$? ...
Soheil Feizi's user avatar
4 votes
1 answer
545 views

No arbitrary product of matrices has eigenvalue 1?

Consider the matrix $D$, adjacency matrix of an undirected graph $G$ on $n$ vertices, with the notation that $d_{i,i}=0,\forall i$. The matrices $A_i$ are constructed from Identity matrices, $I_{n*n}$...
Phani Raj's user avatar
  • 143
2 votes
4 answers
293 views

Find a square, stochastic matrix of odd size, not a permutation matrix, with an eigenvalue other than 1 on the unit circle

...or prove that none exists. Note that such a matrix $M$ couldn't be primitive, so there would be at least one entry equal to zero in every power $M^k$ (Perron-Frobenius theory). Preferably the ...
tarski's user avatar
  • 21
8 votes
2 answers
12k views

Relation between eigenvalues of $A$ and $A^TA$?

For an $n\times n$ diagonizable matrix $A$, is there a relation between the eigenvalues of $A$ and the eigenvalues of $A^TA$? I ask this because I am looking into the relation between $A$ and $A+cI$, ...
Eric S.'s user avatar
  • 181
-1 votes
1 answer
230 views

How bad could $\|A^k\|$ be when $\rho(A) < 1-\delta$ [closed]

(Sorry, I do hate editing this many many times but let me try the last time) Gelfand's formula says that $$\lim_{k\rightarrow \infty} \|A^k\|^{1/k} = \rho(A)$$ I am wondering whether there is any ...
Alex Wenxin Xu's user avatar
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 ...
Flav Monty's user avatar
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$ ...
jqka's user avatar
  • 21