All Questions
187 questions
0
votes
1
answer
127
views
Under what conditions does $x^TA^{-1}y> 0$ hold? $A$ is a symmetric positive definite matrix,$A\in \mathbb{R}^{n\times n}_+, x,y\in \mathbb{R}^{n}_+$
This is a tricky problem I encountered in my research. $A\in \mathbb{R}^{n\times n}_+, x,y\in \mathbb{R}^{n}_+$, i.e. $\forall 1\leq i \leq n, 1 \leq j\leq n, A(i, j)>0, x(i), y(i)>0$.
As known, ...
0
votes
0
answers
68
views
Inequality between product of companion matrices and power of Pisot number
Let $d\geqslant 2$ be an integer and consider a convergent sequence of "companion" matrices
$$A_k := \begin{pmatrix}
a_{k,1} & a_{k,2} & \cdots & a_{k,d} \\\
& ...
10
votes
3
answers
455
views
When does $\det(\frac{A+A^T}{2})=\det(A)$ for positive-definite $\frac{A+A^T}{2}$?
Setup: Let $A$ be a real square matrix and assume its symmetric part $\frac{A+A^T}{2}$ is positive-definite. The inequality
$$
\det\left(\frac{A+A^T}{2}\right) \leq \lvert\det(A)\rvert
$$
is known as ...
7
votes
1
answer
271
views
Existence of a linear map resulting in the determinant being an elementary symmetric polynomial
Let $1 \leq k \leq n$ be fixed integers. Let $\mathcal{M}_n^{\mathrm{H}}$ be the set of $n \times n$ complex Hermitian matrices (if it makes it easier to answer this question, you may instead use the ...
7
votes
1
answer
390
views
Questions on symmetric Hadamard matrices
Definitions: An $n\times n$ Hadamard matrix (HM for short) is a matrix whose entries are either $1$ or $−1$ and whose rows are mutually orthogonal.
If $A$ is a symmetric matrix, then $A = A^T$ and if $...
0
votes
0
answers
43
views
Given two rectangular matrices and they yield the same results when they are multiplied by their own transposes. What can we say about them?
Suppose we have $MM^T = NN^T$, where $M$ and $N$ are both $n$ by $d$ matrices. Assume that $n$ is (much) larger than $d$, are there anything we could conclude about $M$ and $N$, aside from that $N$ ...
6
votes
2
answers
647
views
Is there a name for matrices of the form $a_{ij}=\frac{1}{a_{ji}}$?
I have a matrix that is “kind of symmetric.” Specifically, it is an $n \times n$ real matrix such that the entries $a_{ij}=1/a_{ji}$ whenever $j \ne i$. I want to investigate the properties of this ...
2
votes
1
answer
200
views
An inequality related to matrix trace
$$Tr(A|A^T U \Sigma U^T|) \leq Tr(AA^T U \Sigma U^T)$$ where $A \in \mathbb{R}^{m\times n}$ is a real rectangular matrix, $U \in \mathbb{R}^{n \times n}$ is a orthonormal matrix and $\Sigma$ is a ...
1
vote
2
answers
137
views
Methods to solve for a matrix whose entries satisfy certain properties
(This question is a repost of a deleted question I asked, because the previous version had several elements missing)
Setting
For fixed $N \in \mathbb{N}$, I wish to compute the entries of a matrix $...
8
votes
1
answer
325
views
On a matrix inequality
$\newcommand{\R}{\mathbb R}\newcommand{\tr}{\operatorname{tr}}$It follows from Proposition 7 and this recent answer that, for any positive-definite $n\times n$ symmetric real matrices $A$ and $B$,
$$\...
1
vote
2
answers
184
views
Generate a low-rank sparse covariance matrix
May I ask how to generate a low-rank sparse covariance matrix? Thank you!
3
votes
1
answer
144
views
On the bounds of the sum of the squares of spectral variation of two real symmetric matrices
Suppose $A$ and $B$ are two symmetric real $\{0,1,-1\}$ matrices of order $n$ with diagonal elements as zeros (therefore the traces are zeros) and eigenvalues $\lambda_1\ge \lambda_2\ge \dotsb \ge \...
1
vote
1
answer
70
views
A question about the sign of quadratic forms on nonnegative vectors
Let $M$ be a real square matrix of order $n\ge 3$.
Assume that for every nonnegative vector $\textbf{z}\in \mathbb R^n$ which has at lease one zero entry we have $\textbf{z}^T M \textbf{z} \ge 0$.
Can ...
6
votes
1
answer
886
views
One question on block-circulant matrices
Circulant matrices are very useful in digital image processing.
I found the general formula for determinant of circulant matrix.
But I think it is not suitable for block-circulant matrices.
For ...
1
vote
0
answers
163
views
An estimation of the largest eigenvalue of a submatrix of $\left(\cos(\frac{kl\pi}{4n})\right)_{k,l=1}^n$
Let us consider the following matrix $A=(a_{k,l})$ where
$$A=\left(\cos(\frac{kl\pi}{4n})\right)_{k,l=1}^n$$
Let us consider the submatrix $A_0$ of $A$ whose entries are those $a_{k,l}$ where $k\...
2
votes
0
answers
88
views
Nuclear norm minimization of convolution matrix (circular matrix) with fast Fourier transform
I am reading a paper Recovery of Future Data via Convolution Nuclear Norm Minimization. Here, I know there is a definition for convolution matrix.
Given any vector $\boldsymbol{x}=(x_1,x_2,\ldots,x_n)^...
5
votes
1
answer
319
views
Analytical form for the nuclear norm of an $n \times n$ matrix
I get the follow equation in a paper. Let $A \in \mathbb{R}^{2 \times 2}$, then $M = A^TA$ is a positive semi-definite matrix, the nuclear norm of $A$ is:
$$ \Vert A \Vert_* = \sqrt{\operatorname{tr}(...
4
votes
0
answers
990
views
Lower bound minimum eigenvalue of a positive semi-definite Hermitian matrix with bounded entries
Let $M \in \mathbb{C}^{n \times n}$ be a matrix with the following properties:
$M$ is Hermitian and positive semi-definite (all the eigenvalues are real and nonnegative).
The diagonal entries of $M$ ...
2
votes
0
answers
107
views
Gradient of QZ decomposition
Let $A$ and $B$ be an $m \times n$ matrix of rank $ k_1 \le \min(m,n) $ and $ k_2 \le \min(m,n) $. Then the QZ decomposition or the generalized Schur decomposition is $A = USV^T$ and $B = UTV^T $, ...
1
vote
0
answers
146
views
Identities for the determinant of a matrix similar to $\det(A)=\exp\circ\operatorname{tr}\circ\log(A)$ for different matrix functionals
The identity for the determinant of $A$ in the title is well know in matrix analysis and comes from the Jacobi's formula. I am interested in the existence of nontrivial formulas like this one (they do ...
0
votes
0
answers
180
views
Adding the AWGN to the data makes its covariance matrix always positive definite?
I'm working on a numerical method that estimates direction-of-arrivals in antenna arrays.
I realized that every time I add the AWGN (Additive white Gaussian noise) to a data (which is a matrix), its (...
0
votes
0
answers
105
views
Unitarily equivalent matrices that are also unitarily equivalent on orthogonal subspaces
Consider two positive semidefinite matrices $A$ and $B$ on $\mathbb C^d$.
Let $\{P_i\}_{i=1}^m$ be a complete family of $m$ orthogonal projectors on $\mathbb C^d$ (i.e., $P_i^*=P_i, P_iP_j=\delta_{ij}...
4
votes
1
answer
721
views
Singular value decomposition of truncated discrete Fourier transform matrix
Let $\mathbf{F}$ be a discrete Fourier transform (DFT) matrix such that
\begin{align}
F_{m,n}=e^{-j2\pi(m-1)(n-1)/N},\quad m,n=1,\ldots,N.
\end{align}
What we can say about the singular value ...
2
votes
1
answer
74
views
Limitation through the singular values
Given matrix $X \in \mathbb{R}^{m\times n}$ and sequence $\left\{X^k\right\}_k$ converges to $X$ according to the Frobenius norm. I wonder that $\sigma_i(X^k)$ converge $\sigma_i(X)$ or not (where $\...
2
votes
0
answers
346
views
Extension of the Gershgorin circle theorem for symmetric matrices and localization of positive eigenvalues
In mathematics, the Gershgorin circle theorem can be used to localize eigenvalues of a matrix (including symmetric). Let $A$ be a real symmetry $n × n$ matrix, with entries $a_{ij}$. For $i∈{1,…,n}$ ...
7
votes
1
answer
511
views
Is it true that $\lVert A\rVert \leq \lVert A^2\rVert$ for $A\in \operatorname{SL}(2, \mathbb{R})$ when $\operatorname{trace}(A)>2$?
$\DeclareMathOperator\SL{SL}\DeclareMathOperator\trace{trace}$Let $A \in \SL(2,\mathbb{R})$ and $\trace(A)>2$. Is it true that $$\lVert A\rVert \leq \lVert A^2\rVert,$$
where $\lVert \rVert$ is the ...
1
vote
1
answer
106
views
Matrix equation with projection matrix
I need to solve the following equation for $P \in\mathbb{R}^{r\times d}$
$$P - G_1G_2(\lambda P^\top(PAP^\top)^{-1}P + A^{-1} ) = 0,$$
where the other quantities are known: $A\in\mathbb{R}^{d\times d}$...
0
votes
0
answers
54
views
Rank decomposition of matrices over $\mathbb F_2$
Given an integer matrix $M\in\mathbb Z^{n\times n}$ of real rank $k$ what is the minimum and maximum number of rank $1$ matrices $B_1$ to $B_t$ we require so that $M\equiv\sum_{i=1}^tB_i\bmod 2$?
If $...
0
votes
1
answer
274
views
Does positivity of the n(n-1)/2 principal minors formed from 2 x 2 submatrices ensure positive-definiteness of the n x n matrix itself?
I am interested in conditions under which an $n \times n$ matrix ($\rho$) is positive definite. Of course, one necessary and sufficient set of conditions is that the $n$ leading minors of $\rho$ each ...
0
votes
0
answers
46
views
Lipschitz solutions to linear complementarity problems (LCP)
Let $M\in\mathbb{R}^{n\times n}$.
For $q\in\mathbb{R}^n$, define the set:
$$S_M(q)=\{y\in\mathbb{R}^n|y\ge 0,q+My\ge 0, y^\top (q+My)=0\}.$$
This is the set of solutions to the LCP $(q,M)$.
We say $...
0
votes
0
answers
194
views
Rewriting Kronecker product
im considering a pole placement problem in control theory and my controler has a specific form:
$$R=I_n\otimes q$$
where $I_n$ is the identitiy matrix of size $n$ and $q\in\Re^k$ is a vector of the ...
3
votes
1
answer
741
views
Operator norm of difference of matrix decompositions
This question is in part related to a question that I have already posed.
Say I have two symmetric positive definite matrices and their respective Cholesky decompositions $\mathbf{A} = \mathbf{L}_A \...
2
votes
0
answers
176
views
System of matrix equations
Problem definition: Let $x_i \in \mathbb{R}^d$ and $a_i \in [0,1]$, for all $i = 1,\dots, k$ (with $k\geq d$). Define $M(a) = \sum_{i = 1}^k a_i x_ix_i^T,$ and assume $M(a) \succ 0.$
Question: Is ...
-2
votes
1
answer
1k
views
Derivative of log determinant [closed]
Let $x_i \in\mathbb{R}^d$ and $a_i\in [0,1]$ for $i = 1,\dots,k$. How to compute the following derivative?
$$
\frac{d}{da_j}\log \det\left(\sum_{i = 1}^k a_ix_ix_i^\top\right).
$$
1
vote
1
answer
64
views
Upper bound on the size of vectors contained in an ellipsoid?
Crossposted at Math SE
Consider the diagonal matrix
$$D=\left[\begin{array}{cccc}
1^{- 2 p} & 0 & \cdots & 0 \\
0 & 2^{-2 p} & \cdots & 0 \\
\vdots &...
1
vote
1
answer
201
views
Matrix equation involving quadratic form
Let $X,Y\in\mathbb{R}^{n\times k}$, $\Lambda(\alpha) = \text{diag}(\alpha)$, with $\alpha\in\mathbb{R}^k$, and let $c,d\in\mathbb{R}^+$ be positive constants. Let
$$A_i(\alpha) = (X\Lambda(\alpha) X^...
3
votes
0
answers
2k
views
Multiplication of two Pauli string
Given a Pauli string $P_i \in \{ I,X,Y,Z\}^{\otimes n} $
Example: $P_0 = XXYIZ = X \otimes X \otimes Y \otimes I \otimes Z $.
Here $I,X,Y,Z$ are Pauli matrices defined explicitly as:
$$
I = \begin{...
6
votes
2
answers
259
views
Distance of low-rank matrices to the identity for the $\infty$-norm
I am trying to get a lower bound (or even the exact value) of
$$
\min_{X \in \mathbb{R}^{n\times n}} \|X - I_n\|_{\infty} \enspace \text{s.t.} \enspace \mbox{Rank}(X) = m
$$
where $m \leq n$, and the ...
0
votes
0
answers
146
views
Square root of a circulant matrix block
I'm trying to show the following:
Given the following $n\times n$ symmetric circulant matrices
$$A^*=\begin{pmatrix}
1 & -\mu_a & 0 & ...&0&-\mu_a \\
-\mu_a & 1 & -\mu_a &...
0
votes
0
answers
90
views
Is a basis that almost diagonalizes a matrix 'close' to its eigenbasis?
Let $A\in\mathbb{R}^{n\times n}$ be diagonalisable (over $\mathbb{C}$) with pairwise distinct eigenvalues $\lambda_1,\ldots,\lambda_n\in\mathbb{C}$, and suppose that
$$\tag{1}S^{-1}\cdot A\cdot S = \...
1
vote
2
answers
143
views
If $x \ge 0$ and $\mathbf{1}^Tx \le \|x\|^2$ then $\mathbf{1}^T(I - xx^T / \|x\|^2) \mathbf{1} \ge \| [\mathbf{1} - x]_+ \|^2$
Notation. Denote $\mathbf{1}=(1,1,\ldots,1)$ as the vector-of-ones in $\mathbb{R}^n$. Write the "positive part" as $[\alpha]_+ = \max\{\alpha,0\}$ for $\alpha\in\mathbb{R}$ and $[(x_1,x_2,\...
2
votes
1
answer
156
views
Characterize matrix range
$\DeclareMathOperator{\col}{\operatorname{col}}\DeclareMathOperator{\diag}{\operatorname{diag}}\DeclareMathOperator{\Range}{\operatorname{Range}}$Let $A \in \mathbb{R}^{n\times m}$, $D = \diag(d) = \...
0
votes
0
answers
149
views
L_q matrix inequality
The following arose out of studying $\ell_q$ Lewis weights. Let $P$ be a real $n \times n$ orthogonal projection matrix (i.e., $P$ is symmetric and $P^2 = P$) and let $W$ be the diagonal matrix ...
-1
votes
1
answer
172
views
$A\geq B\Rightarrow A^{-1}\leq B^{-1}$ entrywise for pos.def. symmetric matrices?
My question follows from https://math.stackexchange.com/questions/3857976/inverse-inequality-of-symmetric-matrix. Suppose we assume that $A$ and $B$ are two positive definite matrices with positive ...
2
votes
1
answer
448
views
How to find upper and lower bound
Let $\Sigma \in S_{++}^n$ be a symmetric positive definite matrix with all diagonal entries equal to one. Let $U \in \mathbb{R}^{n \times k_1}$, $W \in \mathbb{R}^{n \times k_2}$, $\Lambda \in \mathbb{...
2
votes
0
answers
588
views
Bounding Frobenius norm of pseudo-inverse
$\DeclareMathOperator{\F}{\mathrm{F}}$Let $\mathbf{A}$ and $\mathbf{A}^\prime$ be two $m\times n$ matrix such that $\|\mathbf{A}-\mathbf{A}^\prime\|_{\F}\leq \delta$. Is there any bound for the ...
4
votes
3
answers
239
views
Properties of matrix $X=\left[\frac{1}{1-\bar\alpha_i \alpha_j}\right]_{ij}$
Let $\{\alpha_i\}_{i=1}^n$ be complex numbers such that $|\alpha_i|<1$, and consider the following $n\times n$ structured matrix
$$
X=\left[\frac{1}{1-\bar\alpha_i \alpha_j}\right]_{ij}.
$$
Such ...
5
votes
1
answer
910
views
Proving a majorization inequality for the singular value of the product of two matrices without using tensor product
For any two matrices $\mathbf{A},\mathbf{B} \in \mathbb{C}^{n \times n}$, we know that the following majorization inequality holds
$$
\tag{1}
\label{grz}
\sigma^{\downarrow}(\mathbf{A}\mathbf{B}) \...
4
votes
0
answers
1k
views
Can an orthogonal matrix move monotonically toward a signed permutation matrix?
The question is motivated by this question on Mathematics SE.
Let $A \in O(n)$ be an orthogonal matrix that is not a signed permutation matrix, and let $P$ be the nearest signed permutation matrix to $...
6
votes
1
answer
446
views
Matrix inequality : trace of exponential of Hermitian matrix
I want to know whether the following inequality holds or not.
\begin{align}
(\mathrm{Tr}\exp[(A+B)/2])^2\leq(\mathrm{Tr}\exp A)(\mathrm{Tr}\exp B)\tag{1}
\end{align}
where $A, B$ are Hermitian ...