Skip to main content

All Questions

Filter by
Sorted by
Tagged with
3 votes
2 answers
392 views

Monotonicity of matrix conjugation

Let $A$ and $B$ be positive-definite matrices such that $A \le B.$ By matrix monotonicity of the root, this also implies that $A^{\alpha} \le B^{\alpha}$ for $\alpha \in [0,1].$ I am now curious under ...
António Borges Santos's user avatar
3 votes
1 answer
204 views

Effects of unitarian multiplication into the spectrum of a finite matrix.

I am interested in the following problem: Let $P$ be a $n\times n$ complex finite matrix such as $PP^\dagger =W$. Given $W$, what can I say about the spectrum of $P$? This matrix "square-root" has ...
Ricardo Marino's user avatar
3 votes
2 answers
307 views

Random matrix is positive

This is a follow up question on my previous question here that was on solved in the deterministic setting by Denis Serre, when the perturbation can be separated. Therefore, I decided to split the ...
Sascha's user avatar
  • 536
3 votes
1 answer
1k views

Proof of eigenvalue stability inequality via Courant-Fischer min-max theorem

T. Tao in his notes on eigenvalue inequalities uses Courant-Fischer min-max theorem to prove the eigenvalue stability inequality. Specifically, I am looking for proof of Eq. (13) where he states as ...
Taha's user avatar
  • 137
3 votes
1 answer
2k views

Singular values of differences of square matrices

Suppose $A, B \in \mathbb{R}^{n \times n}$. Let $\sigma_1(A),\ldots,\sigma_n(A)$ be the singular values of $A$, and let $\sigma_1(B),\ldots,\sigma_n(B)$ be the singular values of $B$. If I know these ...
Aaron's user avatar
  • 794
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
3 votes
4 answers
3k views

spectral radius of a matrix as one element changes

Here's my question -- Let $A$ be an $n \times n$ real matrix, and suppose that the spectral radius $\rho(A)$ is less than one (spectral radius = max eigenvalue). Let's choose some $1 \leq i \leq N$ ...
hal iii's user avatar
  • 147
3 votes
1 answer
115 views

Approximation of vectors using self-adjoint operators

Let $T$ be an unbounded self-adjoint operator. Does there exist, for any $\varphi$ normalized in the Hilbert space, a constant $k(\varphi)>0$ and a sequence of normalized $(\varphi_n)$ such that $$...
Landauer's user avatar
  • 173
3 votes
1 answer
944 views

numerical range of a column-zero-sum matrix

I am trying to produce an example of a (necessarily non-normal) matrix that has only eigenvalues with positive real part, but whose numerical range contains elements with strictly negative real part. ...
Delio Mugnolo's user avatar
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 ...
Luna947's user avatar
  • 75
3 votes
2 answers
167 views

Massive dirac operator symmetric spectrum

Consider the Dirac operator $$ H = \begin{pmatrix} m & -i\partial_z \\ -i\partial_{\bar z} & -m \end{pmatrix},$$ where $\partial_{\bar z}$ is the Cauchy-Riemann operator and $m \ge 0.$ It is ...
Landauer's user avatar
  • 173
3 votes
1 answer
806 views

A spectral radius inequality

Define $\rho(A)$ to be the spectral radius of a square matrix $A$. Let $S$ and $T$ be two non-negative square matrices and $h$ a real number such that $\rho(S+T) < h$. Show that $\rho((hI-S)^{-1}T) ...
Hans's user avatar
  • 2,239
3 votes
1 answer
151 views

Commutation between integrating and taking the minimal eigenvalue

Let $S = (f_{ij})_{ij}$ be a $n \times n$ real symmetric matrix, with functions $f_{ij} \in L^1(\mathbb{R}^d,\mathbb{R})$ in it. We define $\left(\int u S \right)_{ij} = \int u S_{ij}$ as the ...
user avatar
3 votes
1 answer
271 views

Local-Global Principle in Graph Spectrum

The question is a bit vague, but any ideas/directions will be appreciated. Let us fix an $n$-vertex $d$-regular graph $G=(V,E)$. As I understand it, the eigenvalues of the adjacency matrix $A$ of $G$ ...
BharatRam's user avatar
  • 949
3 votes
1 answer
211 views

Generalizing the spectral radius of a unistochastic matrix

Consider a square matrix $A$, and from it construct $B$ whose entries are the squared magnitudes of those in $A$. What can we say about the spectral radius of $B$? I know that for a unitary matrix $A$,...
Victor Liu's user avatar
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 ...
wlad's user avatar
  • 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 ...
user avatar
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 &...
user avatar
2 votes
3 answers
216 views

Equivalence of operators

let $T$ and $S$ be positive definite (thus self-adjoint) operators on a Hilbert space. I am wondering whether we have equivalence of operators $$ c(T+S) \le \sqrt{T^2+S^2} \le C(T+S)$$ for some ...
van Dyke's user avatar
2 votes
1 answer
456 views

On a theorem of Carlson on the necessary and sufficient condition for a matrix to have $m$ real eigenvalues

Background: In the physics of open quantum systems the Lindbladian $\mathcal{L}$ governs the evolution of quantum states through the Lindblad master equation. The Lindblad operator usually has ...
Frederik Ravn Klausen's user avatar
2 votes
1 answer
968 views

Eigenvectors of symmetric positive semidefinite matrices as measurable functions

I'm currently interested in how discontinuous can get the eigenprojections of a continuous function taking values in a particular subspace of symmetric matrices. I've been searching everywhere for an ...
Jorge I. González C.'s user avatar
2 votes
1 answer
238 views

Laplacian spectrum of $2-$lifts of graphs

We know that a $2-$ lift of a graph is specified by a $\pm 1$ assignment on the edges of the graph ( given as a signing matrix) denoting which edge is to be duplicated by the identity permutation on ...
user6818's user avatar
  • 1,893
2 votes
1 answer
86 views

Information on special matrices similar to Jacobi matrices

Jacobi matrices are well known and deeply investigated mathematical objects from various point of view. One can arrive at these operators while studying discrete systems of particles interacting with ...
Twi's user avatar
  • 2,188
2 votes
1 answer
178 views

Expressing the singular values of a 2-by-2 real-valued matrix by the norm of the two columns and the angle between them

I'm looking for an elegant way to show the following claim. Claim: Let $m_1, m_2 \in \mathbb{R}^2$ be the two columns of matrix $M \in \mathbb{R}^{(2 \times 2)}$. The singular values of the matrix are ...
keyboardAnt's user avatar
2 votes
1 answer
1k views

About distinct eigenvalues of a graph

if a graph with adjacency matrix $A$ and Laplacian $L$ has $k$ distinct eigenvalues then does this fact naturally help define or prove existence of a polynomial $p$ of degree $k-1$ such that $[p(A)]_{...
user6818's user avatar
  • 1,893
2 votes
1 answer
520 views

Neighborhood overlap matrix for a bipartite graph

Let $G$ be an undirected, simple, bipartite graph with parts $V$ (having $n$ vertices) and $W$ (having $m$ vertices). Define the following $n$-by-$n$ matrix: for any $i,j \in V$, $$a_{ij} = |N_i \cap ...
Ben Golub's user avatar
  • 1,068
2 votes
1 answer
358 views

positive semidefinite matrix condition

There is a great work of Alizadeh that in section 4 speaks about Minimizing sum of the first few(k-largest) eigenvalues of a symmetric matrix. Instead of a symmetric model we use the weighted ...
Royeh's user avatar
  • 161
2 votes
1 answer
280 views

The effect of random projections on matrices

Let $A\in\mathbb{R}^{n\times n}$ be a given normal matrix, i.e. $A^TA=AA^T$. Let $P_s\in\mathbb{R}^n$ be a random projection matrix to an $s$-dimensional subspace in $\mathbb{R}^n$. Suppose $\frac{A+...
neverevernever's user avatar
2 votes
2 answers
446 views

Entrywise modulus matrix and the largest eigenvector

Disclaimer. This is a cross-post from math.SE where I asked a variant of this question two days ago which has been positively received but not has not received any answers. Let $A$ be a complex ...
Julian's user avatar
  • 623
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 ...
Peter A's user avatar
  • 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 ...
mathamphetamine's user avatar
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] ...
Chriscrosser's user avatar
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}$. ...
Yahav Boneh's user avatar
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}$, ...
geo.wolfer's user avatar
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 ...
Dominik's user avatar
  • 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 (...
user1065320's user avatar
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 ...
BaoLing's user avatar
  • 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 (...
Daniel86's user avatar
  • 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 ...
Royeh's user avatar
  • 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 \...
cdhanjal's user avatar
1 vote
2 answers
877 views

Matrix logarithms are not unique

In my ODE class, we proved that if $\exp(L) = \exp(L')$ then the eigenvalues are congruent mod $2 \pi i$. Here, $L$ and $L'$ are two $n \times n$ matrices. I wanted to know if something more precise ...
john mangual's user avatar
  • 22.8k
1 vote
1 answer
2k views

Positive matrix and diagonally dominant

There is a well-known criterion to check whether a matrix is positive definite which asks to check that a matrix $A$ is a) hermitian b) has only positive diagonal entries and c) is diagonally ...
Xin Wang's user avatar
  • 183
1 vote
1 answer
546 views

Existence of a real eigenvalue

I have a matrix $M \in \mathbb{R}^{(n+1) \times (n+1)}$ that is tridiagonal. In numerical computations I found out that I always find a real eigenvalue. My question is: Is there a theorem that ...
user avatar
1 vote
1 answer
209 views

Eigenvalues invariant under 90° rotation

Consider $N \times N$ matrices $$A = \begin{bmatrix} 0 & 0 & \cdots & 0 & 1 \\ 1 & 0 & 0 & & 0 \\ \vdots & 1 & 0 & \...
Sascha's user avatar
  • 536
1 vote
1 answer
241 views

Monotonicity of eigenvalues II

In a previous question here, I asked the question below for block matrices and received an answer showing the question is true if $\mathcal B$ is hermitian and false, in general if $\mathcal B$ is non-...
Sascha's user avatar
  • 536
1 vote
1 answer
753 views

square root of a certain matrix [closed]

Hello, I'd like to know the square root of the following $n$ by $n$ matrix, for $n > 2$ and $r>0$: $R_{ii}=r+1$ for $i < n$ $R_{ij}=r$ otherwise The $2$ by $2$ case is given by $\sqrt{R}=\...
user avatar
1 vote
1 answer
720 views

Eigenvalues of Sum of non-singular matrix and diagonal matrix

Suppose $D={\rm diag}(d_i)$ is a diagonal matrix with all diagonal entries $d_i=\pm 1$. This implies $D^2=I$. Suppose $A$ is a non-singular Hermitian matrix. If we know that $A+A^{-1}+D$ has rational ...
katie's user avatar
  • 427
1 vote
1 answer
155 views

Spectrum invariant under (generalised) transpose as operator on trace class operators

For matrices $A$ it is well known that the spectrum is invariant under transpose $\sigma(A^T) = \sigma(A)$. Furthermore, the spectrum of the adjoint matrix $\sigma(A^*) = \overline{ \sigma(A)}$ the ...
Frederik Ravn Klausen's user avatar
1 vote
1 answer
195 views

Eigenvalues of operator

In the question here the author asks for the eigenvalues of an operator $$A = \begin{pmatrix} x & -\partial_x \\ \partial_x & -x \end{pmatrix}.$$ Here I would like to ask if one can extend ...
Kung Yao's user avatar
  • 192
1 vote
1 answer
1k views

Spectral radius's relation with row sum

Let $A$ be a non-negative $N \times N$ square matrix with $a_{i,i}=0, 1 \leq i \leq N$. Also, let $r_i$ be the $i$-th row sum of $A$. I know that $\rho(A)$, the spectral radius of $A$, is bounded as ...
Val K's user avatar
  • 355