Skip to main content

All Questions

131 questions with no upvoted or accepted answers
Filter by
Sorted by
Tagged with
24 votes
0 answers
1k 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 ...
Mark M. Wilde's user avatar
16 votes
0 answers
488 views

An inequality for matrix norms

Working on a problem in combinatorics I come up with the following inequality on matrix norms, which I checked it also numerically: Let $A=(a_{ij})$ be a real symmetric $n\times n$ matrix with ...
Mostafa - Free Palestine's user avatar
12 votes
0 answers
508 views

More mysterious properties of Gram matrix

This is another question related to the mysterious properties of the Gram matrix in dimension $4$. Here's the previous question. The following fact could be extracted from 0402087: For any $a_i\...
Daniil Rudenko's user avatar
12 votes
0 answers
218 views

Which ordering of factors is needed to obtain this kind of determinantal inequalities?

Let $A$ and $B$ be $n\times n$ Hermitian positive definite matrices. The curious determinantal inequality given here, which can be stated as $$\det (A^{4}+ ABBA+BAAB+B^{4})\ge\det(A^{4}+ AABB+BBAA+B^{...
Wolfgang's user avatar
  • 13.4k
12 votes
0 answers
314 views

Ratio of entries of A and log A where A is a triangular matrix

Consider triangular matrices $A = \left( {a(n,k)} \right)$ of arbitrary order with $a(n,k) = 0$ if $n + k$ is odd and $a(n,n - 2k) = \frac{{n!}}{{k!(n - 2k)!}}\frac{{(m + n - k - 1)!}}{{(m + n - 1)!}}$...
Johann Cigler's user avatar
11 votes
0 answers
313 views

Jaffard's theorem - finite matrices

For infinite matrices, Jaffard's theorem states that if $(A(k,l))_{k,l\in \mathbb{Z}}$ is invertible and satisfies $$ A(k,l) \leq C (1+\left|k-l\right|)^{-r}, $$ for some $C>0$, then $$ A^{-1}(k,...
Ozzy's user avatar
  • 393
8 votes
0 answers
232 views

Decay of orthogonal contributions in a random set of vectors

Suppose we sample $k$ vectors $v$ from normal distribution centered at zero and diagonal covariance with diagonal entries $1,\frac{1}{2},\ldots,\frac{1}{d}$ and normalize $v$: $$\frac{v_1}{\|v_1\|},\...
Yaroslav Bulatov's user avatar
8 votes
0 answers
194 views

Geometric mean of three or more positive definite matrices

The geometric mean of two positive definite (Hermitian) matrices of same size is defined by $$A\natural B := A^{1/2}(A^{-1/2}BA^{-1/2})^{1/2}A^{1/2},$$equivalently, $$A\natural B =(BA^{-1})^{1/2}A=A(A^...
Wolfgang's user avatar
  • 13.4k
8 votes
0 answers
633 views

Can we write unitary matrices as positive linear combinations of Hermitian matrices?

The space $M_n:=M_n(\mathbb{C})$ of complex $n\times n$ matrices has the structure of a finite-dimensional complex vector space. The space of Hermitian matrices forms a cone in this vector space $M_n$...
user avatar
7 votes
0 answers
355 views

An $L^{\infty}$ version of principal component analysis?

I have a $k$ by $n$ matrix $A$, with $k \ll n$. In case it helps, the $k$ rows are orthonormal. I'm interested in finding a $k$ by $k$ orthogonal matrix $M$ so as to maximize the $L^{\infty}$ norms ...
floc's user avatar
  • 193
6 votes
0 answers
587 views

Lower bound on the sum of singular values for a sum of Hermitian matrices

Denote the eigenvalues of an $n\times n$ matrix $\mathbf{X}$ by $\lambda_i(\mathbf{X})$ and its singular values by $\sigma_i(\mathbf{X})$, $i=1,\ldots,n$. When $\mathbf{X}$ is Hermitian, we know that $...
Bullmoose's user avatar
  • 917
6 votes
0 answers
489 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 ...
Seva's user avatar
  • 23k
5 votes
0 answers
836 views

Gershgorin's 2nd theorem (disjoint circles): elementary proof?

Let $A \in \mathbb{C}^{n\times n}$ be a complex matrix. We let $a_{i,j}$ be the $\left(i,j\right)$-th entry of $A$ for all $i, j \in \left[n\right]$ (where $\left[n\right]$ denotes $\left\{1,2,\ldots,...
darij grinberg's user avatar
5 votes
0 answers
586 views

A minimal eigenvalue inequality

Suppose $A$ is an $n\times n$ real symmetric positive definite matrix. Let $A^{(-1)}_{i,j}$ be the $n\times n$ matrix the entries $(i,i),\,(i,j),\,(j,i),\,(j,j)$ of which equal to the corresponding ...
Hans's user avatar
  • 2,239
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$ ...
getraparth's user avatar
4 votes
0 answers
163 views

Matrix logarithm of unitary factor from polar decomposition of product of positive definite matrices

This question is crossposted from Math Stackexchange here. I crosspost without much edits as I think this is the best way to phrase the question and because I received no feedback on the original post ...
Afham's user avatar
  • 41
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 $...
ryanriess's user avatar
  • 209
4 votes
0 answers
284 views

Maximizing a certain eigenvalue ratio

Let $A\in\mathbb{R}^{n\times n}$ be an Hurwitz stable matrix (i.e., the spectrum of $A$ lies on the left-half complex plane) and let $P$ be the unique positive definite solution of the following ...
Ludwig's user avatar
  • 2,712
4 votes
0 answers
245 views

On the sum of the first row of the inverse of a certain symmetric Toeplitz matrix

(i) Consider a Toeplitz matrix $A_n = (a_{i, j})_{1 \le i, j \le n}$ of size $n$ defined as follows: $$ a_{i, j} := |i-j|^{-1/2}, \text{ if } i \ne j; \ \ a_{i, j} := 2, \text{ if }i = j. $$ Let $...
Kazuki OKAMURA's user avatar
4 votes
0 answers
749 views

When the integral of the product of two matrix exponentials is singular?

Let $A$ and $B$ be two $n \times n$ real matrices. (In my application, $A$ and $B$ are $6\times 6$ traceless singular real matrices) I am interested in finding the smallest $T$ such that the integral $...
nadia's user avatar
  • 41
4 votes
0 answers
676 views

Weyl-type inequality for non-Hermitian matrices?

What is the weakest known condition under which a Weyl-type eigenvalue perturbation inequality holds? Does some analogue hold for normal matrices, for example?
Aryeh Kontorovich's user avatar
4 votes
0 answers
233 views

Determining Nullspace Basis such that only one column is deleted or added as row is added or deleted, and remaining columns of basis stay the same

I would like to compute, in MATLAB, the basis Z for the nullspace of an m by n matrix A, such that if one row of A is added (resulting in A_a), the basis for A_a is n-m-1 of the n-m columns of Z, i.e.,...
Mark L. Stone's user avatar
3 votes
0 answers
49 views

Which invertible linear maps preserve the set of Hurwitz stable matrices?

Let $V = M_n(\mathbb{R})$ be the set of all $n\times n$ matrices with real elements and $V_{-}$ be a subset of Hurwitz stable matrices, i.e. matrices such that all their eigenvalues have strictly ...
Fiktor's user avatar
  • 1,284
3 votes
0 answers
115 views

Recovering the matrix when the Schur decomposition of its blocks are known

Let E be a real symmetric matrix in $M_n(\mathbb{R})$ where $ n=2m$ and $$E=\left(\begin{array}{cc} G & X \\ X^t & H \end{array}\right)$$ where $G,H,X$ are $m\times m$ matrices. Suppose that $...
ABB's user avatar
  • 4,058
3 votes
0 answers
173 views

Can the Jordan decomposition of a matrix be computed in a backwards stable way?

Let $PJP^{-1}$ denote the Jordan decomposition of $M$. The matrix $J$ is a direct sum of Jordan blocks; it is unique up to permutation of the Jordan blocks. The matrix $P$ is not unique. There are two ...
wlad's user avatar
  • 4,943
3 votes
0 answers
275 views

Schur-Horn theorem for principal submatrices

The Schur-Horn theorem says that there exists a Hermitian matrix with diagonal entries $d_1,d_2,\ldots,d_n$ and eigenvalues $\lambda_1,\lambda_2,\ldots,\lambda_n$ if and only if $(\lambda_1,\lambda_2,\...
Nathaniel Johnston's user avatar
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{...
KAJ226's user avatar
  • 131
3 votes
0 answers
73 views

Regularity of Moore-Penrose pseudo-inverse

Let $k\in\mathbb{N}\cup\{0\}$, let $\Omega\subseteq\mathbb{R}^n$ be open, connected and let $G\in C^k(\Omega;\mathbb{R}^{n\times n})$ satisfy $$ \operatorname*{rank}G(x)= \operatorname*{rank}G(y),\...
Tatin's user avatar
  • 895
3 votes
0 answers
128 views

Is the matrix $\mu_f(X_i \cap X_j)$ positive definite?

Let $X_1,\ldots, X_n$ be finite subsets of some larger finite set $Z$. Let $f:Z \rightarrow \mathbb{R}_{>0}$ be any function, and define a (counting) measure $\mu_f(X) = \sum_{x \in X} f(x)$ for a ...
user avatar
3 votes
0 answers
126 views

Distance between two algebraic sets

We are in $M_n(\mathbb{R})$ equipped with the Frobenius norm $||A||^2=tr(AA^T)$. Let $Z=\{(A,B)\in M_n(\mathbb{R})^2;A^2-AB-B^2=0\}$ and $T=O(n)^2$. It is easy to see that $Z\cap T=\emptyset$ and ...
loup blanc's user avatar
  • 3,741
3 votes
0 answers
244 views

An inequality concerning the solution of a Lyapunov equation

Let $A$ be an Hurwitz stable matrix (i.e. the real part of the eigenvalues of $A$ lie in the left-half plane) and $Q$ be a positive semidefinite matrix ($Q\ge 0$, for short). Let $P>0$ be the ...
Ludwig's user avatar
  • 2,712
3 votes
0 answers
630 views

Diagonal elements of Hermitian matrices with given eigenvalues

Given real vectors $d = (d_1, \ldots, d_n)$ and $\lambda = (\lambda_1, \ldots, \lambda_n)$, where I will assume that their coefficients are arranged in non-increasing order, the Schur-Horn theorem ...
Dario's user avatar
  • 31
3 votes
0 answers
56 views

Equivalence Classes of a Subgroup of Similarity Transformations

Let $X$ be a real, finite-dimensional vector space and $A, B, C,$ and $D$ be matrices on $X$. I'm interested in the similarity classes of the block matrices $$ \begin{bmatrix} A & B\\ C & D\\ ...
JMJ's user avatar
  • 263
3 votes
0 answers
298 views

Singular value decomposition of a low rank weak diagonally dominant M-matrix. When is the unitary polar matrix positive semi-definite?

Let $A$ be an $n \times n$, non-symmetric, real, weak diagonally dominant M-Matrix. Its diagonal is strictly positive, its off-diagonal is negative or zero and all its columns sum to zero. $A$ has ...
Astor's user avatar
  • 323
3 votes
0 answers
70 views

Condition number after some "non standard" transform

Given a positive definite matrix $A$, and a diagonal matrix $B$ with positive diagonal entries, is the following inequality generally true? $$\kappa((A + B)(I + B)^{-1}) \leq \kappa(A)$$ $I$ is an ...
randomprojection's user avatar
3 votes
0 answers
611 views

Can anyone help me deduce a matrix inequality?

The following lemma is taken from references firstly. Lemma 1 [1-2] Given matrices $Q=Q^{T} , F, M$ and $N$ of appropriate dimensions, then $$Q+MFN+N^{T}F^{T}M^{T}<0$$ for all $F$ satisfying $F^{...
lovewinter's user avatar
3 votes
0 answers
193 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!
Vincent Russo's user avatar
3 votes
0 answers
706 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 ...
divB's user avatar
  • 167
3 votes
0 answers
125 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 ...
Felix Goldberg's user avatar
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)^...
Xinyu Chen's user avatar
2 votes
0 answers
43 views

Selecting some linearly independent columns of a particular matrix

Let us consider the matrix $C=A_1+A_2$ where : $A_1=(a_{k,l})_{k,l=0}^{n-1}$ is the $n$ by $n$ matrix given by $a_{k,l}=\frac{2}{\sqrt{n}}(\cos\frac{2kl\pi}{n})$ $A_2$ is the the $n$ by $n$ block ...
ABB's user avatar
  • 4,058
2 votes
0 answers
46 views

Combining SVD subspaces for low dimensional representations

Suppose we have matrix $A$ of size $N_t \times N_m$, containing $N_m$ measurements corrupted by some (e.g. Gaussian) noise. An SVD of this data $A = U_AS_A{V_A}^T$ can reveal the singular vectors $U_A$...
user2600239's user avatar
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 $, ...
newbie's user avatar
  • 61
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}$ ...
ayr's user avatar
  • 145
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 ...
Apprentice's user avatar
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 ...
Math_Y's user avatar
  • 287
2 votes
0 answers
186 views

Bounding the condition number of a matrix associated with an even symmetric positive definite function

Define a set $A = \{x_i/x_i\in\mathbb{R}^m, i = 1,2,3..n\}$. Let $f:\mathbb{R}^m\to(0,\infty)$ be an even symmetric positive definite function. Let $D = [d_{i,j}]$ be an $n\times n$ matrix such that $...
Rajesh D's user avatar
  • 698
2 votes
0 answers
1k views

Estimates on norm Hessian Matrix

Let $u:\Omega \rightarrow \mathbb{R}$ a twice differential function, with $\Omega$ a subset of $\mathbb{R}^n$. Suppose that we have the following: $$D^2u\geq - \dfrac{(1+K^2)^{1/2}}{\epsilon}I$$ ...
Jason's user avatar
  • 59
2 votes
0 answers
301 views

Eigenvector of Hadamard matrix functions

Let $X\in\mathbb{R}^{n\times n}$ with SVD $X=UDV^T$. Are there known results regarding the eigenvectors of $Y=X^{\odot g}$? I am mainly interested in simple functions such as $g(z)=z^2$, i.e. $Y_{ij}=...
JZRedw's user avatar
  • 21
2 votes
0 answers
75 views

Case of equality in entrywise spectral radius bound

Let $A,B$ denote square matrices such that $\lvert A_{ij}\rvert\le B_{ij}$ for all $i,j$, and denote the spectral radius by $\rho$. From the Gelfand spectral radius formula it is easy to see that $$\...
Julian's user avatar
  • 623