**2**

votes

**1**answer

262 views

### lower bound of a trace quadratic form [closed]

i want to find a lower bound on the following expression:
$tr(AXA^T)$ in terms of $tr(X)$
where A is real $n\times n$ matrix and $X>0$ is positive symmetric. It seems that the following bound is ...

**3**

votes

**0**answers

96 views

### What is the significance of the median eigenvalue?

When I look at the spectral density plots of my (usual) laplacian graphs, they spike at the median eigenvalue. But what significance for the graph/matrix (which originates from a network) does the ...

**4**

votes

**2**answers

330 views

### The eigenvectors and eigenvalues of matrix geometric mean

This is a follow up question on from How to solve a non-homogeneous quadratic matrix equation?.
Given the matrix $G = A(A^{-1}M)^{1/2}=A^{1/2}(A^{-1/2}MA^{-1/2})^{1/2}A^{1/2}$, where $A=-H^{-1}$, ...

**3**

votes

**2**answers

395 views

### How to solve a non-homogeneous quadratic matrix equation?

I am looking to solve the following matrix equation for $G$
$$GHG + M = 0$$
where $G$, $H$, and $M$ are square, symmetric, real matrices. $H$ is negative-definite and $M$ is positive-definite. $G$ ...

**1**

vote

**1**answer

47 views

### Partial Constraint of Low Rank Matrix

Suppose $X \in \mathbb{R}^{m \times n}$ is a rank $r$ matrix. Let $\Omega$ be a generic subset of $\in \{1, \ldots, m\} \times \{1, \ldots, n\}$ of cardinality $r(m + n - r)$. Denote by $X_{\Omega}$ ...

**1**

vote

**0**answers

82 views

### Does this permanent have a closed form?

What is the closed form of this permanent? (similar to the Cauchy determinant)
\begin{aligned}
f(z_1,z_2,\cdots,z_N,w_1,w_2,\cdots,w_N)=\left[
\small{\begin{matrix}
\frac{1}{(z_1-w_1)^2} && ...

**14**

votes

**1**answer

397 views

### Hlawka inequality for determinants of positive definite matrices

It is mentioned here that if $A, B, C\in M_{n}(\mathbb C)$ are positive semidefinite, then $$\det (A+B+C)+\det C\ge \det (A+C)+\det (B+C)$$ (quoted from this article) and the special case ($C=\bf 0$) ...

**1**

vote

**1**answer

145 views

### Connection between eigenvalues of A and its LDL decomposition

Consider an undirected graph $G$ with $N$ vertices and its adjacency matrix $n_{ij}$: $n_{ij} = 1$ if vertices $i$ and $j$ are connected by an edge and $n_{ij} = 0$ otherwise. Consider $A_{ij} \equiv ...

**10**

votes

**2**answers

444 views

### Nearby matrices have nearby leading eigenvectors?

Suppose I have a symmetric positive semidefinite matrix $A$ with leading eigenvalue $1$ of multiplicity $1$ and remaining eigenvalues $\leq\epsilon$. I am told that another symmetric positive ...

**1**

vote

**2**answers

1k views

### Taking matrix derivative with MATLAB or Wolfram Alpha [closed]

I want to take the derivate of a rather complicated matrix expression. Is it possible to do this in MATLAB or Wolfram Alpha? Here is what I am trying to calculate:
\begin{equation}
\frac{\partial}{ ...

**6**

votes

**1**answer

360 views

### On the positivity of matrices

For given $n$, the following $n\times n$ real matrix $M=M^{T}$ is called positive, if
$x^{T}M x\geq 0$
holds for all non-negative real $x_1,x_2,\cdots,x_n$,
where $x=(x_1,x_2,\cdots,x_n)^T$.
...

**7**

votes

**2**answers

149 views

### What are the upper bound and stability conditions for the following simple linear system?

Consider the following linear system
$$\dot{x}=\sum\limits_{i=1}^{m}{{{\alpha }_{i}}}\left( t \right)\cdot {{A}_{i}}\cdot x \quad (1)
$$
where, $x\in {{\mathbb{R}}^{n}}$ represents the state vector, ...

**7**

votes

**1**answer

521 views

### Block Matrix determinant

Consider the $k \times k$ block matrix:
$ C = \left(\begin{array}{ccccc} A & B & B & \cdots & B \\ B & A & B &\cdots & B \\ \vdots & \vdots & \ddots & ...

**4**

votes

**2**answers

233 views

### Is there an easy way to tell if all eigenvalues of a unitary or self-adjoint matrix only have eigenvalues of multiplicity two?

I am interested in a class of $2n\times 2n$ unitary matrices with complex entries (if you prefer, we can replace "unitary" with "self-adjoint").
I know that all the eigenvalues of matrices in this ...

**0**

votes

**1**answer

107 views

### Efficient way to find SVD of sum of projection matrices?

Lets say that we have n matrices of data $X_i : i \in [1, n]$. All $X_i$ have the same number of rows.
Their associated projection matrices are $P_i = X_i(X_i^T X_i)^{-1}X_i^T$
Also say that we have ...

**0**

votes

**1**answer

145 views

### Relation between the subordinate norm and the spectral radius of a matrix

Let's define the following subordinate norm of a $(NM \times NM)$ matrix A norm as follows
\begin{eqnarray*}
||A||_{2,b} = \mathrm{max}_{x \in \mathbb{C}^{NM}} \left \{ \frac{||A x||_b}{||x||_2} ...

**2**

votes

**1**answer

172 views

### Alike looking matrices imply convergence of eigenvalues?

This is a question about convergence of eigenvalues which essentially came up in studying the spectrum of St.-Liouville operators.
We want to look at matrices that agree in most of their entries and ...

**11**

votes

**2**answers

567 views

### Multiplicative Identity for all elements in SU(n)

Let $\{P_i\}$ be a subset of $SU(n)$ such that for any $U$ in another subset (or perhaps subgroup) $H$ of $SU(n)$: $$P_1UP_2U\cdots P_mU=I$$ where $I$ is the identity element. Is there a sequence ...

**5**

votes

**3**answers

271 views

### Norm of triangular truncation operator on rank deficient matrices

Let $T_{n\times n}$ be a triangular truncation matrix, i.e.
$$T_{i,j}=\begin{cases}1 & i\ge j\\ 0 & i<j \end{cases}$$
It is known that for arbitrary $A_{n\times n}$
$$\|T\circ ...

**0**

votes

**1**answer

114 views

### Solution of infinite dimension linear system

Suppose that ${a_n}$ and $b_n$ is decreasing sequence such that $a_0=A$, $lim_{n->\infty}a_n=0$ and $b_0=B$, $lim_{n->\infty}b_n=0$.
For fix n,
we can construct n dimension linear equation ...

**0**

votes

**0**answers

372 views

### Cholesky decomposition of a large covariance matrix

I have a tricky problem concerning a covariance matrix cholesky decomposition.
What I need is to obtain the cholesky decomposition of the estimated variance matrix of the set of samples stored in a ...

**13**

votes

**2**answers

932 views

### Does the matrix exponential preserve the positive-semi-definite ordering?

Suppose $A$, $B$, are symmetric, real valued matrices and $B-A$ is positive-semidefinite, i.e. $A≼B$. Does that imply $e^A ≼ e^B$? Would love some intuition here.
I know for instance that $A≼cI \iff ...

**4**

votes

**1**answer

90 views

### An extension of the Golden Thompson inequality

For three symmetric positive-semidefinite matrices $A,B,C$ I am trying to figure out if the following inequality holds, at least in some cases:
$$tr(Ae^{B+C})≤tr(Ae^Be^C)$$
Note that if $A=I$ then ...

**19**

votes

**0**answers

748 views

### conjectures regarding a new Renyi information quantity

In a recent paper http://arxiv.org/abs/1403.6102, we defined a quantity that we called the "Renyi conditional mutual information" and investigated several of its properties. We have some open ...

**6**

votes

**7**answers

920 views

### Source for roots of matrix polynomials?

A
matrix polynomial
is a polynomial whose variables are square $n \times n$ matrices,
let's say with entries in $\mathbb{C}$, and with coefficients in $\mathbb{C}$.
I am seeking a source of results on ...

**2**

votes

**0**answers

189 views

### proving quasi convexity of multivariable function

Given
an arbitrary $(N \times N)$ square matrix ${\bf X}$
a positive definite $(M\times M)$ matrix ${\bf T}$
a $(Q\times MN), Q< MN$ matrix ${\bf Z}$ consisting of only 1s and 0s where there is
...

**3**

votes

**0**answers

151 views

### Method to Generate Random Mutually Orthogonal Unitary Matrices

The title says it all, I'd like to know if such a method exists to generate random mutually orthogonal unitary matrices. If so, any supplementary references would be very much obliged. Thanks again!

**-1**

votes

**1**answer

175 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

356 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

234 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

494 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

401 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

88 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

150 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

96 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

298 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

198 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

179 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

676 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

74 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

175 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

242 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

457 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

344 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

65 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

162 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

211 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

269 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

544 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

799 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 ...