Skip to main content

All Questions

Filter by
Sorted by
Tagged with
2 votes
1 answer
242 views

Necessary conditions for existence of linear combination of these matrices to be singular

I'm doing some research in Control theory, and a stumbled with this problem. Any help is appreciated. QUESTION Let $P_1,\dots,P_m$ be $m$ symmetric positive definite $n\times n$ matrices with $m<n$ ...
FeedbackLooper's user avatar
1 vote
0 answers
87 views

Approximation bounds for matrix multiplication

$\DeclareMathOperator{\op}{\mathrm{op}}$Since matrix multiplication is continuous, I expect that if $A_n\to A\in \mathrm{Mat}_{d\times d}(\mathbb{R})$ for the operator-norm and if $x_n\to x$ in $\...
ABIM's user avatar
  • 5,405
1 vote
1 answer
201 views

How could I extend this result to a case where the matrices were not of full rank?

I'm reading this paper by Bhatia, Jain and Lim and on page 6 theorem 2, they state $$ \sqrt{\operatorname{tr}(A^{1/2}BA^{1/2})} = \max_{X>0} \{ |\operatorname{tr} X|: A\geq XB^{-1}X^{*} \} $$ where ...
Kashif's user avatar
  • 383
6 votes
1 answer
290 views

Recover approximate monotonicity of induced norms

Let $A$ some square matrix with real entries. Take any norm $\|\cdot\|$ consistent with a vector norm. Gelfand's formula tells us that $\rho(A) = \lim_{n \rightarrow \infty} \|A^n\|^{1/n}$. Moreover, ...
ippiki-ookami's user avatar
4 votes
1 answer
119 views

Is the Loewner maximum uniquely defined?

Given 2 (symmetric) PSD matrices $A,B$, is the following set $S_{A,B}$ non-empty? $$ S_{A,B} = \{ C: C\succeq A, C\succeq B, \text{ and }\forall D, D\succeq A, D\succeq B \implies D\succeq C \} $$ If ...
user163087's user avatar
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 ...
Ludwig's user avatar
  • 2,712
1 vote
1 answer
128 views

Asymptotic behavior of a matrix equation and its eigenvalues

We have a matrix valued function $A:\mathbb{R}_+\to \mathbb{R}^{m\times m}$. It is known that $A(\lambda)$ is a positive definite matrix for all $\lambda\in\mathbb{R}_+$ Denoting $\rho_i(A(\lambda))$ ...
Rajesh D's user avatar
  • 698
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}) \...
LayZ's user avatar
  • 115
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
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
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 ...
s hukahi's user avatar
5 votes
2 answers
634 views

Reference request: continuity of Cholesky factor

It most books dealing with Cholesky decomposition, or it is variants, one finds a statement of the form if $A$ is symmetric $k\times k$ positive semi-definite (non-negative definite) then the $k\times ...
ABIM's user avatar
  • 5,405
1 vote
1 answer
324 views

How can I find minimum and maximum eigenvalue of non-positive define matrix [closed]

There is a power iteration method, but it only returns the greatest(in absolute value) eigenvalue of matrix. So when we have negative eigenvalues it'll give wrong results. Is there any method, which ...
Dima Shkad's user avatar
2 votes
1 answer
1k views

$\arg\max$ in the dual norm of the nuclear norm

Given a matrix $X \in \mathbb{R}^{m \times n},$ then the spectral norm is defined by $$\left \| X\right\| := \max\limits_{i \in \{1, \dots, \min\{m,n\}\} }\sigma_i (X)$$ whereas the nuclear norm is ...
Santiago Armstrong's user avatar
0 votes
0 answers
47 views

"Probability" for a partitioned matrix to be singular

Let $A,B\in\mathbb{R}^{n\times n}$ be two nonsingular matrices with $A\ne B$, and consider the following partitioned matrix $$ M:=\begin{bmatrix}AA^\top + BB^\top & A^\top \Delta_1 A + B^\top \...
Ludwig's user avatar
  • 2,712
2 votes
1 answer
375 views

Bound for matrix inner product based on singular values

Regarding the matrix inner product based on singular values, Lewis (1995) "The convex analysis of unitarily invariant matrix functions" states the result by von Neumann that $\langle X,Y \rangle \leq \...
Prateek Sasan's user avatar
3 votes
1 answer
421 views

Inequality for $AB + BA$ when $A,B\geq0$, reference request

Let $A,B\geq0$ be positive semidefinite matrices of arbitrary size $n\times n$. Denote by $\alpha$ and $\beta$ their largest eigenvalues. It is well-known that the eigenvalues of the expression $AB +...
Felix Huber's user avatar
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
0 votes
0 answers
132 views

Upper bound on the condition number of the product of a random sparse matrix and a semi-orthogonal matrix

Let $G \in \mathbb{R}^{n \times m}$ (m > n, m = O(n)) whose all entries are i.i.d. distributed as $\mathcal{N}(0, 1) * \text{Ber}(p)$. Let $V \in \mathbb{R}^{m \times n}$ be a fixed semi-orthogonal ...
nikhil_vyas's user avatar
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
1 vote
0 answers
139 views

Subgradient chain rule

Suppose $$F:\mathbb{R}^n \to \mathbb{R},\; F(x)=\mathrm{max}_\mathrm{eig}(C-\mbox{diag}(x)).$$ I am trying to find a subgradient of $F$ at $x_0$. A subgradient of $\mathrm{max}_\mathrm{eig}$ is given ...
Stephen T.'s user avatar
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
8 votes
3 answers
663 views

Representation theorem for matrices (reference request)

Motivation. If $A \in \mathbb{C}^{n \times n}$ is self-adjoint (or, more generally, normal), then we all know that $$ A = \sum_{k=1}^n \lambda_k \, h_k \otimes h_k, $$ where $\lambda_1,\dots,\lambda_n$...
Jochen Glueck's user avatar
1 vote
0 answers
96 views

Vectors that satisfy $\sum_{i=1}^n Y_i X_i^\top = I$ and $\sum_{i=1}^n \frac{1}{p_i}Y_iY_i^\top = \Sigma(P)^{-1}$

Let $X_1,\dots,X_n$ be vectors in $\mathbb{R^d}$. Assume all of the vectors are inside the unite $\ell_2$ ball. Let $P$ be a vector in the probability simplex $\Delta_n$ with $P_i>0$ for all $i$. ...
good bandit's user avatar
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
1 vote
1 answer
61 views

Effect of column normalization on maximum diagonal entry

Let $\mathbf{A}$ be a $M\times N$ complex matrix, and $\bar{\mathbf{A}}$ be constituted by normalizing each column of $\mathbf{A}$. Therefore, we have $$\mathbf{A}=\bar{\mathbf{A}}\mathbf{\Gamma},$$ ...
Math_Y's user avatar
  • 287
0 votes
1 answer
91 views

Choosing the best submatrix

Let $\mathbf{A}_{m\times n}$ be a matrix with non-negative elements. Assume that a submatrix $\mathbf{B}$ from $\mathbf{A}$ is defined as \begin{align} B_{i,j} = \begin{cases} A_{i,j}, & i\in\...
Math_Y's user avatar
  • 287
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
0 votes
0 answers
96 views

Eigenvalues of the matrix obtained by letting some of the rows vanish, hoping for some inequality

Let $A$ be an $n \times n$ matrix. Let $A_k$ be the matrix obtained by keeping the first $k$ rows of $A$ fixed and substituting $0$ for the rows $k+1$ to $n$. To be precise, we write $A= [R_1...R_k, ...
Learning math's user avatar
10 votes
1 answer
630 views

Minimum distance of a symmetric matrix to diagonal matrices

Let $A=(a_{ij})$ be an arbitrary $n \times n$ real symmetric matrix and $n\geq 2$. Let $\| \cdot \|$ denote the operator $2$-norm or equivalently the maximum absolute value of eigenvalues for ...
Mostafa - Free Palestine's user avatar
0 votes
0 answers
400 views

Comparison of two similarity matrices

English is not my first language, so please excuse any mistakes. I'm working with two similarity matrices on the same data set: Suppose I have $n$ items, and I calculated the similarity of each item ...
Catasaur's user avatar
8 votes
1 answer
1k views

Operator norm of square root of matrix vs original

If I have a nonsymmetric matrix whose operator norm is $\leq 1$ and square root it, does its operator norm remain below $1$? More formally, I want to know whether there is always at least one square ...
user149538's 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
8 votes
3 answers
691 views

Commutant of the conjugations by unitary matrices

Let $\mathcal{L}(\mathbb{C}^{n \times n})$ denote the algebra of all linear mappings from $\mathbb{C}^{n \times n}$ to $\mathbb{C}^{n \times n}$ and let $\mathcal{C} \subseteq \mathcal{L}(\mathbb{C}^{...
Jochen Glueck's user avatar
29 votes
2 answers
5k views

Consequences of eigenvector-eigenvalue formula found by studying neutrinos

This article describes the discovery by three physicists, Stephen Parke of Fermi National Accelerator Laboratory, Xining Zhang of the University of Chicago, and Peter Denton of Brookhaven National ...
Ivan Meir's user avatar
  • 4,862
1 vote
0 answers
132 views

Transformations preserving the number of distinct eigenvalues

Let $A\in\mathbb{R}^{n\times n}$ be an $n\times n$ symmetric, invertible matrix with nonnegative real entries, $\mathbf{1}$ be the all one $n$-dimensional vector, and $\mathrm{diag}(v)$, $v=[v_1,v_2,\...
Ludwig's user avatar
  • 2,712
7 votes
1 answer
443 views

On approximate simultaneous diagonalization

It is well known that two $n\times n$ symmetric positive semidefinite matrices $A$, $B$ such that $AB=0$ are simultaneously diagonalizable. My question is related to the existence of a specific ...
Shake Baby's user avatar
  • 1,638
2 votes
1 answer
498 views

Does the Perron vector maximize $x^TAx$ in the simplex?

Let $\mathbf{A}$ be any $n\times n$ symmetric positive matrix ($A_{ij}>0$). It is easy to show that the solution to the following optimization problem \begin{align} \max_{\mathbf{x}}~~\mathbf{x^...
dineshdileep's user avatar
  • 1,421
6 votes
1 answer
840 views

Quantum inspired matrix inequality

While mimicking the union bound in quantum systems, we land on the following conjecture but don't know how to prove this. Given any complex-valued $n\times m$ matrix $A$. A sub-matrix of $A$ is ...
Taylor Huang's user avatar
0 votes
1 answer
129 views

Hadamard $\ell_2$ sum of two symmetric positive semidefinite matrices

This is a follow-up question to this and this. Let $A=(a_{ij})$ and $B=(b_{ij})$ be symmetric positive semidefinite $n\times n$ matrices such that all $a_{ij}\geq 0$, $b_{ij}\geq 0$ and $a_{ii}=b_{ii}...
D_809's user avatar
  • 175
2 votes
0 answers
92 views

Hadamard $\ell_p$ sum of two symmetric positive semidefinite matrices: follow-up

I asked the following question here: "Does there exist $p>1$ such that for all $n\geq 2$, if $(a_{ij})$ and $(b_{ij})$ are symmetric positive semidefinite $n\times n$ matrices and $a_{ij}, b_{ij}\...
D_809's user avatar
  • 175
3 votes
1 answer
381 views

Hadamard $\ell_p$ sum of two symmetric positive semidefinite matrices

Does there exist $p>1$ such that for all $n\geq 2$, if $(a_{ij})$ and $(b_{ij})$ are symmetric positive semidefinite $n\times n$ matrices and $a_{ij}, b_{ij}\geq 0$ then $\bigl(\|(a_{ij},b_{ij})\|...
D_809's user avatar
  • 175
5 votes
1 answer
404 views

Best orthogonal approximation of rank 1 matrix

Let $X=\lambda_0u_0v_0^T\in\mathbb{R}^{n\times n}$ be a rank 1 matrix where $\lambda_0\in\mathbb{R}$, $u_0,v_0$ are of unit Euclidean norm. What is the solution of the following problem? $$\hat{X}=\...
neverevernever's user avatar
0 votes
0 answers
52 views

How do I test two square matrices are transpose to each other if only the column vector summations are known?

Given two secret square matrices, say $\left( {\begin{array}{*{20}{c}} {{a_{11}}}&{{a_{12}}}&{{a_{13}}}\\ {{a_{21}}}&{{a_{22}}}&{{a_{23}}}\\ {{a_{31}}}&{{a_{32}}}&{{a_{33}}} \...
user67451's user avatar
4 votes
1 answer
413 views

Lipschitz property of matrix function only depending on singular values

Let $f$ be a function from $\mathbb{R}^{n\times n}$ to $\mathbb{R}$ such that there exists another symmetric function $g$ (invariant under permutation of coordinates) from $\mathbb{R}^{n}$ to $\mathbb{...
neverevernever's user avatar
3 votes
1 answer
172 views

Representation of $4\times4$ matrices in the form of $\sum B_i\otimes C_i$

Every matrix $A\in M_4(\mathbb{R})$ can be represented in the form of $$A=\sum_{i=1}^{n(A)} B_i\otimes C_i$$ for $B_i,C_i\in M_2(\mathbb{R})$. What is the least uniform upper bound $M$ for such $n(A)$...
Ali Taghavi's user avatar
1 vote
1 answer
146 views

Solve a linear matrix ODE involving symmetric blocks

Let $P \in \mathbb R^{n \times n}$ be a symmetric positive definite matrix with eigenvalues denoted by $\lambda_i$ and corresponding eigenvectors denoted by $v_i$. For each $j \in \{1, 2, 3, 4\}$, let ...
Justin Le's user avatar
  • 113
3 votes
1 answer
2k views

Relation between Frobenius norm, infinity norm and sum of maxima

Let $A$ be a sequence of $n \times n$ matrices so that the Frobenius norm squared satisfies $\|A\|_F^2 \simeq n$ and the infinity norm squared is $\|A\|_{\infty}^2 = 1$. Is the following true? $$\...
horxio's user avatar
  • 105
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
1 vote
1 answer
809 views

Relationship between $2 \to 2$ norm and $\infty \to 2$ norm [closed]

I am wondering what are the best known relationship between $\|A\|_{2\rightarrow 2}$ and $\|A\|_{\infty\rightarrow 2}$ and how tight it is. E.g., the trivial result is that for matrix $A$ with ...
Alex Wenxin Xu's user avatar

1 2
3
4 5
8