**-1**

votes

**1**answer

168 views

### spectrum of a special class of tridiagonal matrices

Consider a real and symmetric tridiagonal matrix with zero diagonals and where subdiagonals and superdiagonals are equal to 1 except the (1,2)-th component being equal to $a$, i.e.,
...

**6**

votes

**3**answers

337 views

### Is $1/\max(i,j)$ a bounded matrix on Hilbert spaces?

I would like to know if the infinite matrix $[\frac{1}{\max(i,j)}]_{i,j\geq 1}$ represents a bounded operator on $\ell^2(\mathbb{N}^\star)$.
It would be sufficient to know if the Lehmer matrix ...

**1**

vote

**1**answer

196 views

### Matrix Generator for M/M/1 Queue Waiting Time Distribution

I "believe" that generator, $\bf W$, of the waiting time distribution for the M/M/1 queue is given by the following (I'm not sure if this is even correct):
${\bf W} =\left( \begin{array}{ccccc}
0 ...

**13**

votes

**1**answer

465 views

### Operator norms of circulant matrices

The definition and basic properties of circulant matrices can be found here: http://en.wikipedia.org/wiki/Circulant_matrix.
For complex numbers $a_1,\ldots,a_n$, I will use the notation
$$
...

**6**

votes

**1**answer

369 views

### Is the p-norm of a matrix strictly log-convex?

Let $A$ be a $n\times n$-matrix. We let $\|A\|_p$ denote the norm of $A$ when considered as a linear operator on $\ell^p(\{1,2,\ldots,n\})$, that is,
$$
\|A\|_p = \sup_{x\neq ...

**1**

vote

**0**answers

83 views

### Inverse of matrix of generalised harmonic numbers

For $s=0,1,\dots$ and $n=1,2,\dots$, denote $r_{n,s}=\sum_{k=1}^n k^s$. It is well-known that $r_{n,s}$ are polynomials in $n$ with leading term $\frac{1}{s+1}n^{s+1}$. Let $R_{n,s}$ be the ...

**4**

votes

**1**answer

140 views

### variation of the Lieb concavity theorem

A special case of the well known Lieb concavity theorem states that the following function is concave on positive operators A and B:
$$
(A,B) \to \text{Tr} \{A^s X B^{1-s} X^\dagger \}
$$
for $s \in ...

**0**

votes

**1**answer

94 views

### Any generic way to move a psd matrix to its neighbors?

Given a two positive matrices $A,B$. For simplicity, let's assume that $Tr A=Tr B=1$. Assume that $\|A-B\|_1\leq\varepsilon$, for some small $\varepsilon>0$, where $\|\cdot\|_1$ is the $l_1$-norm, ...

**5**

votes

**0**answers

282 views

### Symmetric matrices with $\rho(A)\gg\|A\|_\infty$

For a symmetric real matrix $A$, denote by $\rho(A)$ the spectral radius of $A$, and by $\sigma(A)$ the largest absolute row sum of $A$; that is, $\sigma(A)=\max_i \sum_j |a_{ij}|$, where $a_{ij}$ are ...

**2**

votes

**0**answers

182 views

### Norm bound of a complex resolvent

A well known result by Varah states that if $A$ is a strictly diagonally dominant matrix of dimension $n$, then
$\|A^{-1}\|_{\infty} \le \max_i\frac{1}{|a_{kk}|-\sum_{j \neq k}|a_{kj}|}$, where the ...

**5**

votes

**1**answer

172 views

### Simultaneous Tridiagonalization of a given set of hermitian matrices?

I have a set of $N\times N$ hermitian matrices $A_i,~i=1,\dots,M$. Are there any results on the possibility of simultaneously tridiagonalizing them?

**5**

votes

**2**answers

555 views

### How to check whether a matrix is completely positive or not?

The definition:
cone of completely positive matrices
$\mathcal{C}=\{\sum_{i=1}^kx_ix_i^T:x_i\in\mathbb{R}^n_+\ for \ i=1,2,...,k\}$.
I just don't knwo how to check whether a matrix belongs to ...

**1**

vote

**0**answers

72 views

### About the group generated by one diagonal unitary

Suppose $D=diag\{\alpha_1,\alpha_2,...\alpha_n\}$ is a diagonal unitary, which means that |\alpha_i|=1 for all $i$. We know that $\alpha_i$ is not unit root and so is $\alpha_i/\alpha_j$ for $i\neq ...

**2**

votes

**1**answer

146 views

### Known Results on Convexity of Numerical Range

Let $A_1,A_2,\dots,A_M$ be given $N\times N$ hermitian matrices. The numerical range is defined as the set
\begin{align}
\mathbb{S}=\{(u^HA_1u,\dots,u^HA_Mu)\in \mathbb{R}^M\mid u^Hu=1\}
\end{align}
...

**7**

votes

**1**answer

217 views

### How much can I perturb a symmetric stochastic matrix and keep positive solutions?

Suppose $A$ is a symmetric stochastic $n \times n$ matrix with least eigenvalue $\lambda_n>0$. Consider real symmetric perturbations $\widehat{A}$.
How large can I take $\epsilon$ such that ...

**5**

votes

**2**answers

387 views

### Finding roots of a recursively given polynomial sequence / eigenvalues of an almost Toeplitz matix

I would like to find the roots of the polynomial sequence given by a recurrence relation as follows:
$V_0(x) = 1-a^2$
$V_1(x) = 1-a^2 - x$
$V_{k \geq 2}(x) = (1+a^2 - x)V_{k-1}(x) - a^2V_{k-2}(x)$
...

**1**

vote

**2**answers

253 views

### Bound on smallest entry of inverse matrix

For a symmetric, invertible matrix $A=(a_{ij})\in \mathbb{R}^{n\times n}$ with (at least two) nonzero off-diagonal elements, is it possible to bound in absolute value the smallest entry of its inverse ...

**0**

votes

**0**answers

64 views

### Property of quasipositive matrices

I saw this theorem stated in a paper without proof and I have difficulty proving it.
If $A$ is an $n\times n$ matrix with non-negative off-diagonal entries, let $s(A)$ be the real eigenvalue such ...

**5**

votes

**1**answer

156 views

### Are there any known results on numerical ranges of rank-one positive semi-definite matrices?

In my problem, I came across numerical ranges of rank-one positive semidefinite matrices. Through Toeplitz-Hausdorff theorem and some other extensions, I know if there are at most three matrices, then ...

**3**

votes

**1**answer

207 views

### When is this matrix singular?

Consider matrix $A$ with $(j,k)$′th entry $A_{j,k}=\sin(\omega_j t_k+\phi_j),\,\forall j,k\in\{1,2,...,n\}$, where $\omega_j,t_k,\phi_j\in \mathbf R$.
1) For $t_k=k$, what is the condition on ...

**2**

votes

**1**answer

225 views

### derivative of sum of singular values

can someone point me to the direction how to calculate the derivatives of a sum of singular values of a matrix?
I am trying to minimize
$$\min_A \parallel A \parallel_*+ \cdots $$ where $\parallel A ...

**3**

votes

**1**answer

355 views

### SDP formulation of noisy low rank matrix completion

Exact low rank matrix completion using nuclear norm minimization can be formulated as a semidefinite program (SDP). Following the notation in the paper, a convex problem for noisy matrix completion ...

**0**

votes

**1**answer

597 views

### How to determine the distance between two matrices under the meaning of a matrix function? [closed]

Suppose a nonlinear infinitely continous differentiable function $f:\mathbb{D}\mapsto \mathbb{R^+}$, where $\mathbb{D}\subset\left\{X|\text{rank}{X}=2,X\in\mathbb{R}^{3\times 3}\right\}$ is a ...

**1**

vote

**0**answers

314 views

### Incoherence of the row/column span

Due to V.Chandrasekaran., et al (p.11) : In general for any $k$-dimensional subspace of $A_{n×n}$ we have that:
$$\sqrt{(k/n)} \leq incoherence(A)\leq 1$$
where the lower bound is achieved (for ...

**4**

votes

**1**answer

158 views

### Epidemic threshold

Need some help / ideas to proceed. Stuck for a while on this.
In the literature of epidemic theory, it is found that the epidemic threshold is $1/\lambda_{max}(A)$ where $\lambda_{max}(A)$ is the ...

**0**

votes

**1**answer

410 views

### Tensor product of generator of SU(n)

I'm doing research in quantum mechanics and got some trouble. Any help would be very much appreciated.
Let $\{\lambda_j\}$ be the set of generator of $SU(n)$. Consider the operator:
$K=\sum_j ...

**7**

votes

**0**answers

173 views

### Energy barriers between Hadamard matrices

Hadamard matrices may be characterized as $n\times n$ real orthogonal matrices $U$ that achieve the lowest possible "energy" as defined by the (scaled and shifted) entry-wise 1-norm:
$$
E(U)=n^2 ...

**0**

votes

**1**answer

186 views

### Nonnegative Matrix

Let $A=E+\sqrt{-1}B$, where $E=diag\{0,1,\cdots,1\}$, $B$ is a real symmetric matrix. Let $A^*$ denote the adjoint matrix of $A$, i.e. $AA^*=\det A\cdot I$. I hope the real part of adjoint matrix ...

**2**

votes

**0**answers

348 views

### How to perform this matrix integral?

Edit: some backgrouds added.
In quiver matrix model which is reviewed DV or CKR, the path integral reduce to the matrix integral
$$Z \sim \int \prod_{i=1}^r d\Phi_i \prod_{<a,b>} dQ_{ab} ...

**3**

votes

**3**answers

707 views

### The derivative of the Cholesky Factor

Let $A$ be a symmetric, positive definite $p\times p$ matrix, and let $f(A)$ be it's Cholesky factor. That is, $f(A)$ is a lower triangular $p\times p$ matrix such that $A = f(A) f(A)^{\top}$. I am ...

**0**

votes

**1**answer

307 views

### Weighted Spectral l-2 norms arising from matrix inner products

The spectral $l^2$ norm of a complex matrix is given by:
$\|A\|= \left( \sum_{k=0}^{N-1} s_k(A)^2 \right)^{1/2}$ where $s_k(A)$ are the singular values of $A$ ordered so as to be non decreasing in ...

**2**

votes

**1**answer

180 views

### Equivalent metrics on symmetric positive definite matrices

By similar arguments as for the proof of the golden-thompson inequality (see "Log majorization and complementary Golden-Thompson type inequalities" by T.Ando and F.Hiai) we can show that for all A,B ...

**0**

votes

**1**answer

104 views

### Norm bound on eigen-vector change caused by rank-one update

Suppose $A$ is a positive semi-definite, Hermitian matrix with a unit-norm eigen vector $\textbf{v}$ corresponding to its largest eigen value $\lambda$. Let $B = A + \alpha \textbf{z}\textbf{z}^H$, ...

**3**

votes

**2**answers

184 views

### Decomposition of a semi-definite matrix into sums of sparse semi-definite matrices

I'll first provide the background.
Let $x\in\mathbb{R}^N$ be decomposed into $n$ non-overlapping blocks of variables
$x^{(1)},\ldots,x^{(n)}$.
We say that $f:\mathbb{R}^N\rightarrow\mathbb{R}$ is ...

**8**

votes

**1**answer

799 views

### A Problem on Linear Algebra

I'm trying to calculate an integral over the generalized Poincare upper half plane, then I find that I need to show the following identity:
Let $X=(X_{i,j})\in\mathrm{GL}(n,\mathbb R)(n\geq 3)$ ...

**2**

votes

**0**answers

110 views

### A - B is semidefinite, what the relationship about their eigenvalues? [closed]

$A, B$ are two symmetric matrices, if $ A-B $ is semidefinite (i.e.$ A - B \geq 0$), if we rearrange the eigenvalues of two matrices, $\lambda_1 (A) \geq \lambda_2 (A) \geq ... \geq \lambda_n (A)$, ...

**6**

votes

**3**answers

582 views

### Optimization problem on trace of rotated positive definite matrices

Given two $n \times n$ symmetric positive definite matrices $A$ and $B$, I am interested in solving the following optimization problem over $n \times n$ unitary matrices $R$:
$$
\mathrm{arg}\max_R ...

**2**

votes

**1**answer

120 views

### Dimension independent computational complexity of singular value decomposition

Suppose $X$ is a $m \times n$ real matrix, which has only $k$ number of nonzero elements ($k \ll mn$).
Given a vector $y$, the sparsity of $X$ allows $X y$ to be computed in $O(k)$ time
which is ...

**1**

vote

**1**answer

434 views

### Bounding the positive semi-definite matrix with its block diagonal matrix [closed]

Can we bound $\mathbf{A}$ with $\mathbf{A^*}$ as ${\bf{A}} \preceq {{\bf{A}}^*}$ where
\begin{equation}
{\bf{A}} = \left[ {\begin{array}{*{20}{c}}
{{{\bf{A}}_{11}}}&{...}&{{{\bf{A}}_{1N}}}\\
...

**3**

votes

**2**answers

293 views

### On a determinant inequality of positive definite matrices

Assume that $B$ and $A$ are two positive definite matrices. Take $B^*$ a block diagonal matrix with block $B_{11}$ and $B_{22}$ of $B$. This means the following:
$$
B=\left[\begin{array}{ll}
...

**2**

votes

**1**answer

219 views

### More than controlability: Speed of controllability!

Consider the continuous linear time-invariant system
$$
\begin{array}{l}
\dot{\mathbf{x}}(t) = A \mathbf{x}(t) + B \mathbf{u}(t)\\
\mathbf{y}(t) = C \mathbf{x}(t) + D \mathbf{u}(t)
...

**1**

vote

**0**answers

128 views

### M-matrix with nonconstant entries properties

I have a matrix $J(x)$ with $J_{ij}(x)=f_{ij}(x)$ where vector $x$ is $x=x_1, x_2, ..., x_m$. I have shown that $J(x)$ is an M-matrix for all $x$. There is known review paper by Plemmons (1977) of 40 ...

**1**

vote

**1**answer

1k views

### Reachability in graphs using adjacent matrix

Assuming a graph $G$ with $N$ nodes distributed in a $\mathcal{L}\times\mathcal{L}$ area randomly. There is an edge between two nodes if and only if the Euler distance between them is equal or less ...

**2**

votes

**0**answers

169 views

### Row subset selection of matrix to optimize condition number

Given a matrix $\mathbf{A} \in \mathbb{C}^{N\times M}$ with $N \gg M$. This matrix results from a linear equation system and has a certain structure (however, I do not think that details provide any ...

**6**

votes

**1**answer

421 views

### Best rank one approximation

Assume $u,v\in\mathbb{C}^n$ are complex vectors. I was wondering if there is a closed form expression for the following problem in terms of $u$ and $v$
\begin{equation*}
\arg\min_{x\in\mathbb{C}^n} ...

**-3**

votes

**1**answer

206 views

### adjacency matrix of random geometric graphs [closed]

Consider a graph with N nodes. All nodes are distributed as a Poisson point process with density of λ in a L*L area. There is an edge between two nodes if and only if the distance between them is less ...

**6**

votes

**1**answer

528 views

### The singular values of the Hilbert matrix

The $n\times n$ Hilbert matrix $H$ is defined as
$H_{ij} = \frac{1}{i+j-1}, \qquad 1\leq i,j\leq n$
What is known about the singular values $\sigma_1\geq\ldots\geq \sigma_n$ of $H$?
For example, ...

**4**

votes

**1**answer

611 views

### An inequality involving operator and trace norms

Consider two square matrices $A, B \in \mathbb{R}^{n \times n}$ and let $\| \cdot\|_1$ and $\|\cdot\|$ be, respectively, the trace norm (the sum of singular values) and the usual operator norm (the ...

**3**

votes

**0**answers

103 views

### Copositivity in matrix pencils

Given two square symmetric matrices $A,B$ of the same order, the matrix pencil $P(A,B)$ is the set of linear combinations of $A$ and $B$. Finsler's theorem gives an elegant criterion for $P(A,B)$ to ...

**1**

vote

**2**answers

187 views

### Matrix-Norm aquivalence with p-Norm [closed]

Let $A$ be a square Matrix and $||\cdot ||_p$ the induced Matrixnorm for $1 \leq p \leq \infty$. Is it true that
$$||A||_p\leq \max(||A||_1,||A||_{\infty})?$$
For $p=2$ the answer is yes because ...