**2**

votes

**1**answer

185 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

252 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

473 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

370 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

68 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

164 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

212 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

294 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 \...

**4**

votes

**1**answer

578 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

858 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

397 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

162 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

485 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

182 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

192 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

375 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} e^{-\...

**4**

votes

**4**answers

929 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

378 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 $k$...

**2**

votes

**1**answer

201 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

117 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

206 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

811 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

113 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

698 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

128 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

536 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

319 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}
B_{11}&...

**2**

votes

**1**answer

223 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)
\end{array}...

**1**

vote

**0**answers

149 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

222 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

503 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

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

**7**

votes

**1**answer

652 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

703 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

104 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

202 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 $||A||...

**8**

votes

**1**answer

374 views

### Inequalities for Hadamard products of complex symmetric matrices

Consider a complex symmetric matrix $$ C= C_R + i C_I $$ with $C_R,C_I \in \text{Mat}_{n\times n}(\mathbb R)$ symmetric, and assume that the eigenvalues of $C_R$ are all strictly positive. Then, $C$ ...

**1**

vote

**0**answers

194 views

### Estimate the diagonal of a Cholesky factor…?

I'm computing several hundred Cholesky factorizations of large, sparse matrices, and I'm really only doing Cholesky factorization because I need to know the diagonal elements of the Cholesky factor L. ...

**0**

votes

**2**answers

190 views

### positive semidefiniteness: a psd matrix substracted by another rank 1 psd matrix

Given that $A$ is a positive semidefinite matrix, $x$ is a vector, $\lambda_0 \in [0, +\infty) $ is a real non-negative number. I want to know the answer to the following optimization problem.
$$
\...

**0**

votes

**0**answers

586 views

### Diagonal of the inverse of a 6x6 symmetric partitioned matrix

Let
$$M = \begin{bmatrix}
A & B \\
B & C
\end{bmatrix}$$
in which $A$, $B$ and $C$ are $3 \times 3$ matrices being also symmetric. In fact, they are quite similar, just differing on a single ...

**5**

votes

**2**answers

191 views

### Maximal norm-1 projection

Suppose I have a real unitary matrix $U$ and a unit vector $\mathbf{x}, \|\mathbf{x}\|_2 = 1$. What is the solution to the following problem?
$$
\widehat{\mathbf{x}} = \arg\max_{\mathbf{x}, ~\|\...

**0**

votes

**2**answers

417 views

### Eigenvalues of an amplification matrix

Let $A$ and $B$ square real matrices.
I know that the matrix $A+B$ has 1 as eigenvalue of multiplicity 1 and the others eigenvalues have their modulus <1.
Can we say something about the eigenvalues ...

**0**

votes

**0**answers

82 views

### Big eigenvalues of a special stochastic matrix

Given a matrix $M$ of size $n\times n,$ we write its different eigenvalues by $x_1,x_2,\ldots,x_m$ with $m\leq n$ such that $|x_1|>|x_2|>|x_3|>\cdots|x_m|,$ and call $x_2\doteq |\lambda_2|(M)....

**1**

vote

**0**answers

64 views

### Which matrix/operator in a cone has the largest negative spectral part?

Background:
Let $\mathcal{K}$ be set (convex cone, if you like) of symmetric matrices of order $n$. Each matrix $A \in \mathcal{K}$ can be decomposed in a unique way as $A=A_{+}-A_{-}$, where $A_{+}$...

**9**

votes

**1**answer

554 views

### M-matrix plus S-matrix is P-matrix?

I am trying to prove that a mapping has a unique fixed-point by showing that its Jacobian is a P-matrix. In this particular case the Jacobian can be decomposed as the sum of two matrices and I would ...

**11**

votes

**2**answers

550 views

### Computing a large permanent

Is there a practical way to compute the permanent of a large ($91 \times 91$) $(0,1)$ matrix?
I have tried to use the matlab function written by Luke Winslow which works great for smaller matrices ...

**-1**

votes

**1**answer

5k views

### Derivative of log determinant and inverse

I have a matrix $\Sigma$ with element $(i,j)$
$$\Sigma_{i,j}= \exp(-h_{i,j}\rho).$$
The matrix is positive definite and symmetric (it is a covariance matrix).
Now I need to evaluate
$$\frac{\...

**1**

vote

**0**answers

108 views

### Matrices with a common Fischer basis

Let $A$ be a real symmetric $n\times n$ matrix, normalized such that $Tr[A]=1$. Define a 'Fischer basis' as the basis in which all diagonal elements are equal to $\frac{1}{n}$. The motivation for ...

**0**

votes

**1**answer

1k views

### How to compute difference between 2 similarity matrices?

Hello,
I have two n*n correlation matrices with values ranging between -1,1. (2 correlation matrix because I have the same n terms under 2 different conditions)
I then transformed the correlation into ...