Skip to main content

All Questions

Filter by
Sorted by
Tagged with
9 votes
1 answer
3k views

Connection between eigenvalues of matrix and its Laplacian.

Hello! There are two definitions of graph spectrum: 1) Eigenvalues of adjacency matrix $A$. 2) Eigenvalues of Laplacian of adjacency matrix ($L$). Different sources offer different properties based ...
TotalNoob's user avatar
9 votes
3 answers
383 views

convergence of 2nd eigenvalue

Fix $0<h_1<h_2<h_3<1$ reals. All matrices below are $3\times3$ real. Suppose the sequence of matrices $M(n)$ are symmetric positive definite and these converge (point-wise) to a symmetric ...
T. Amdeberhan's user avatar
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 \...
Sascha's user avatar
  • 536
-2 votes
1 answer
353 views

Can we attain the maximum and minimum of a Rayleigh quotient over any subspace? [closed]

Let $M\in\mathbb{C}^{n\times n}$ be a Hermitian matrix and let $E$ be a subspace of $\mathbb{C}^n$. $$\mbox{Are } \sup_{x\in E\\ x\neq0}\dfrac{x^*Mx}{x^*x}\mbox{ and }\inf_{x\in E\\ x\neq0}\dfrac{x^*...
Chilote's user avatar
  • 596
10 votes
5 answers
2k views

The maximal eigenvalue of a symmetric Toeplitz matrix

Let $0\le x\le 1$ be a real number. Denote by $A_n(x)=(a_{ij})$ the $n$ by $n$ matrix such that $a_{ij}=x^{|i-j|}$ and let $\lambda_n(x)$ be the maximal eigenvalue of $A_n(x)$. Is there any ...
Andrei Jaikin's user avatar
3 votes
1 answer
726 views

Largest eigenvalue of product of orthogonal-projection rank-1 perturbation

Suppose I have a symmetric positive definite matrix $A \in \mathbb{R}^{n \times n}$ with $n$ linearly indepedent columns $a_1,...a_n$ in $\mathbb{R}^n$. All columns $a_i$ has norm 1, but they are not ...
dave2d's user avatar
  • 103
7 votes
1 answer
2k views

Bound the eigenvalue of product of matrices?

Let $H$ be a $n \times n$ real symmetric matrix that has eigenvalues with absolute value less than 1. Define the matrix $M = \prod_{i=1}^n (I - e_ie_i^{\top}H)$ where $e_i$ denotes the $i^\text{th}$ ...
user avatar
3 votes
1 answer
3k views

Bounds for eigenvalues of block matrix

Let's say I have a block matrix of the form $$X = \begin{bmatrix} A & B\\ B^T & C\end{bmatrix}$$ where $A$, $C$, and $X$ are all positive definite. I have bounds on both the minimum and ...
bringingdownthegauss's user avatar
11 votes
3 answers
1k views

Maximum singular value of a random $\pm 1$ matrix

Define a matrix $\mathbf{A} \in \mathbb{R}^{m \times n}$ such that each element is independently and randomly chosen with probability $\frac 12$ to be either $+1$, or $-1$. Do you know any result in ...
Kostas's user avatar
  • 199
2 votes
0 answers
106 views

Connections between eigenvalues of $B$ and $A+iB$

Consider two symmetric and real matrices $A,B\in\mathbb{R}^n$ and definie $A+iB$. Note that $A+iB$ is not hermitian in this case. There are many results based on Brendixson and Courant-Fischer, saying,...
Stephan's user avatar
  • 21
1 vote
0 answers
39 views

Characterisation of Coxeter matrices with all non-real eigenvalues having absolute value 1

Let $C$ be an invertible integer matrix. Then a matrix $M$ is called Coxeter matrix (following Sato in https://www.sciencedirect.com/science/article/pii/S0024379505001709?via%3Dihub ) when $M=-C^{-1} ...
Mare's user avatar
  • 26.5k
1 vote
1 answer
312 views

Relation between the algebraic multiplicity of an eigenvalue and the subdiagonal elements of a symmetric tridiagonal matrix [closed]

Show that if $T$ is a symmetric tridiagonal matrix and an eigenvalue $\lambda$ has multiplicity $k$, then at least $k−1$ subdiagonal elements of $T$ are zero. If we consider a submatrix $B$ that has ...
Prashant Govindarajan's user avatar
2 votes
1 answer
657 views

Leading eigenvector value problem as an optimisation problem for asymmetric matrices

As noted in 1806.05647, given a symmetric matrix $A$, the leading eigenvector value problem (LEVP) $$Av = \lambda v,$$ where $A = A^T \in \mathbb{R}^{n \times n}$, $\lambda$ is the largest ...
user144910's user avatar
2 votes
1 answer
450 views

Eigenvalues of A^T D A for positive A and diagonal D

Suppose I have a diagonal matrix $D$ whose entries are bounded in absolute value. I also have a matrix $A$ that is positive (entry-wise, so $A_{ij} > 0\ \forall\ i,j$): one can assume that the ...
B Merlot's user avatar
  • 269
7 votes
1 answer
641 views

Lower bound on the eigenvalues of the Laplacian

I am looking for a graph for which $2 d_{i} < \mu_{i}$, for some index $i$, where $\mu_{1} \leq \mu_{2} \leq \dots\leq \mu_{n}$ are the eigenvalues of the Laplacian matrix $L(G)$ and $d_{1} \leq d_{...
B. Arsic's user avatar
  • 123
2 votes
0 answers
550 views

Eigenvalues of a specific Hankel matrix

I have an $\frac{N}{2} \times \frac{N}{2}$ matrix $G$ with entries given by \begin{equation} G_{ij} = \frac{1}{\sin(\frac{\pi}{N}(i+j-\frac{3}{2}))}, \;\;\;\;\;\;\;\; 1 \le i,j \le \frac{N}{2}, \end{...
Marc's user avatar
  • 101
5 votes
3 answers
2k views

Proving that a certain non-symmetric matrix has an eigenvalue with positive real part

Suppose that $X$ is the $n \times n$ matrix of all ones $Y$ is an arbitrary $n \times n$ matrix with zeroes on the diagonal and all other entries equal to $0$ or $1$ $0 < \delta < 1$ Let $Z = ...
jtg128's user avatar
  • 61
2 votes
0 answers
146 views

Upper bound on some eigenvalue problem

Let $A_1,\ldots,A_m \in R^{n\times n}$ be symmetric and positive semidefinite, and suppose that their sum $A$ is positive definite. For some nonzero vector $u\in R^n$ with $u^TA_ju>0$ for all $j$, ...
Arnold Neumaier'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
3 votes
1 answer
721 views

What can be said about the relationship between the eigenvalues of a negative definite matrix and of its Schur complement?

I have two problems related to eigenvalues of negative definite matrices: I have a matrix $M\prec0$ (symmetric and all eigenvalues are negative) and $S=M_{11}-M_{12}M_{22}^{-1}M_{21}$ by taking $M=[...
Parikshit's user avatar
3 votes
1 answer
600 views

« Generalized simultaneous diagonalization » of a pair of symmetric, non-commuting, positive semi-definite matrices

I hope my question is trivial for some of you but for the time being I’m lost somewhere between the generalized eigenproblem, simultaneous diagonalization of quadratic forms, simultaneous SVD, ...
Fabrice Pautot's user avatar
1 vote
0 answers
171 views

Eigenvalues of non-negative block matrices

$B$ is a non-negative irreducible block matrix as follows: $$B= \left[ \begin{array}{c|c|c} 0 &B_{12}&B_{13}\\ \hline B_{21}& 0& B_{23}\\ \hline B_{31}& B_{32}&0 \end{array} \...
afra's user avatar
  • 21
0 votes
1 answer
154 views

Energy of a symmetric matrix with $0$, $1$ or $-1$ entries

I have a symmetric matrix with entries $0$, $1$ or $-1$ which appeared in my works in graph theory (the diagonal entries are all zero). I need a good upper bound for the energy of this matrix; i.e. "...
A. Mpi's user avatar
  • 351
0 votes
1 answer
1k views

How do eigenvalues change if we duplicate a row and column of a symmetric matrix?

Let $\bf A$ be a $n \times n$ symmetric positive semidefinite matrix whose first column is denoted by ${\bf a}_1$. We define a new matrix, $$ {\bf B} = \begin{bmatrix} a_{11} & {\bf a}_1^T \\ {\bf ...
Jingxian Wu's user avatar
0 votes
0 answers
54 views

Is there a method to find a vector that optimizes a Rayleigh quotient over a subspace?

Let $M\in\mathbb{C}^{n\times n}$ be an arbitary Hermitian matrix and let $E$ be a subspace of $\mathbb{C}^n$. Is there a method to find vectors $y,z\in E$ such that $$\dfrac{y^*My}{y^*y}=\sup_{x\in E\\...
Chilote's user avatar
  • 596
4 votes
1 answer
380 views

Rotatable matrix, its eigenvalues and eigenvectors

We say that a real matrix is rotatable iff after turning it clockwise on $90^{\circ}$ it doesn't change. I'm interesting about eigenvalues and eigenvectors (belonging to non-zero eigenvalues) of such ...
Mikhail Goltvanitsa's user avatar
1 vote
0 answers
126 views

Fastest way to calculate the eigenvalues of a product of two Toeplitz matrices

I have the following problem: I need to find the fastest way to calculate the eigenvalues of a matrix that is the product of two Toeplitz matrices. $B = A U$. The first is a regular Toeplitz matrix $A$...
Enea Olati's user avatar
10 votes
0 answers
237 views

Generalized eigen property of a matrix

Given a $n \times n$ invertible matrix $A$, I am interested in the set $$ \mathcal{S}(A) = \{ D \textrm{ diagonal matrix } \mid \det(D - A) = 0 \}. $$ Thus, for all eigenvalues $\lambda_i$, we have $...
Jiro's user avatar
  • 909
5 votes
3 answers
204 views

Find eigenvalues with given multiplicity in presence of errors

Let $A^0$ a $3 \times 3$ real symmetric matrix with eigenvalues $\lambda_1^0 = \lambda_2^0 \neq \lambda_3^0$. Hence, $\lambda_1^0$ has multiplicity $2$. In real-world applications, I will have a ...
Zanna's user avatar
  • 61
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 $\...
user avatar
22 votes
4 answers
5k views

Eigenvalues of permutations of a real matrix: can they all be real?

For a matrix $M\in GL(n,\mathbb R)$, consider the $n!$ matrices obtained by permutations of the rows (say) of $M$ and define the total spectrum $TS(M)$ as the union of all their spectra (counting ...
Wolfgang's user avatar
  • 13.4k
4 votes
1 answer
206 views

How to find the analytical representation of eigenvalues of the matrix $G$?

I have the following matrix arising when I tried to discretize the Green function, now to show the convergence of my algorithm I need to find the eigenvalues of the matrix $G$ and show it has absolute ...
Sherry's user avatar
  • 153
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
1 vote
0 answers
49 views

Bounds on Eigenvalues After Skew-Symmetric Perturbation

Consider two matrices $\mathbf{J} \in \mathbb{R}^{n \times n}$ and $\mathbf{L} = -\mathbf{L}^T \in \mathbb{R}^{n \times n}$. I am trying to upper bound the eigenvalues of their sum: $$\mathbf{A} = \...
Leo's user avatar
  • 11
4 votes
0 answers
2k views

What is the time complexity of the largest singular value and its vectors?

Full zero-error SVD on an $m \times n$ matrix $A$ would cost $O(\min(m^2n,mn^2))$. What is the time complexity if we need only the largest singular value and its corresponding vectors? I think it is $...
B. Arsic's user avatar
  • 123
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
6 votes
0 answers
96 views

Finding the maximal component of a vector in sublinear time

Given a vector $u \in \Bbb R^n$, finding the value of the largest component of $u$ needs linear time in $n$. However, what if we additionally know that $u$ lies in some linear subspace $U \subset \Bbb ...
M. Winter's user avatar
  • 13.6k
-2 votes
1 answer
968 views

What can we say about the rank of the sum of a multiple of the identity matrix and a symmetric rank-$1$ matrix? [closed]

Suppose we have the following symmetric matrix. $$A = \sigma^2 I + u u^T$$ What can we say about the eigendecomposition of $A$?
Christo's user avatar
  • 67
11 votes
1 answer
981 views

Exact eigenvalues of a specific tridiagonal matrix

I'm studying the following tri-diagonal matrix $$ X = \begin{pmatrix} 0 & x_0 & 0 & 0 &\cdots & 0 & 0 & 0 \\\ x_0 & 0 & x_1 & 0 &\cdots & 0 & ...
Kasper's user avatar
  • 161
2 votes
1 answer
1k views

Is the sum of two stable matrices also stable?

Let $A$ and $B$ be two arbitrary real matrices of the same dimension. If the eigenvalues of $A$ and $B$ are all in the left half of the complex plane, can we estimate the the location of the ...
Jason Zhou's user avatar
5 votes
1 answer
2k views

Condition for block symmetric real matrix eigenvalues to be real

I have a $2n \times 2n$ block symmetric matrix that in the simplest case ($n=2$) looks like: $$ M_2 = \begin{bmatrix} a_1 & 0 & b_{1,2} & -b_{1,2}\\\ 0 & -a_1 & b_{1,2} & -b_{...
Giulia's user avatar
  • 151
1 vote
0 answers
359 views

Sufficient conditions for all eigenvalues simple in stochastic matrix

The "largest" eigenvalue $1$ of a stochastic matrix is well-characterized by the classical Perron-Frobenius theorem. In particular, it gives sufficient conditions for the eigenvalue $1$ to be simple. ...
Randomguy's user avatar
7 votes
1 answer
6k views

Eigenvectors as continuous functions of matrix - diagonal perturbations

The general question has been treated here, and the response was negative. My question is about more particular perturbations. The counterexamples given in the previous question have variations not ...
Beni Bogosel's user avatar
  • 2,222
0 votes
1 answer
269 views

Limit of eigenvalues of a matrix perturbation sequence

Suppose $H$ is an $n\times n$ symmetric positive definite matrix, $M_k$ is a sequence of $n \times n$ matrix (not necessarily symmetric) such that $M_k \to O$ where $O$ is the zero matrix. Let $\...
Ralph B.'s user avatar
  • 135
4 votes
1 answer
1k views

Why are 1 and -1 eigenvalues of this matrix?

This is a subject I've been working on for a very long time now, but still did not manage to fully understand the interesting properties of this matrix $\mathbf{A}$. First, let's define two matrices: ...
anderstood's user avatar
3 votes
3 answers
357 views

Can a block matrix with at least 3 zero blocks of different size on the diagonal and 1's everywhere else have only integer eigenvalues?

Let $M=\begin{pmatrix} \begin{array}{cccccccc} 0 & 0 & 1 & 1 & 1 & 1 & 1 &1\\ 0 & 0 & 1 & 1 & 1 & 1 & 1 &1\\ 1 & 1 & 0 & 0 & ...
L S B. user255259's user avatar
2 votes
0 answers
330 views

Eigenvalues of special sum of Hermitian matrices

In my research on linear algebra and its applications, I have come across the following problem which has stumped me: Let $ A $ be a positive definite matrix and let $ D $ be a positive diagonal ...
groupoid's user avatar
  • 620
1 vote
0 answers
152 views

Bound for Expectation of Singular Value

In my case, $X_{\boldsymbol{\delta}}\in\mathbb{R}^{d\times M}$ is a function of Rademacher variables $\boldsymbol{\delta}\in\{1,-1\}^M$ with $\delta_i$ independent uniform random variables taking ...
lee's user avatar
  • 53
1 vote
0 answers
86 views

Solution of a manipulated equation vs the maximum eigenvalue and eigenvector of a non-negative matrix

Lets assume we have the following equation: $AU=\lambda U \Rightarrow\left[ \begin{array}{c|c|c} 0 &A_{12}&A_{13}\\ \hline A_{21}& 0& A_{23}\\ \hline A_{31}&A_{32}&0 \end{...
afra's user avatar
  • 21
4 votes
0 answers
284 views

Maximizing a certain eigenvalue ratio

Let $A\in\mathbb{R}^{n\times n}$ be an Hurwitz stable matrix (i.e., the spectrum of $A$ lies on the left-half complex plane) and let $P$ be the unique positive definite solution of the following ...
Ludwig's user avatar
  • 2,712