Skip to main content

All Questions

Filter by
Sorted by
Tagged with
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) = \...
Apprentice's user avatar
2 votes
1 answer
346 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 ...
user avatar
2 votes
1 answer
851 views

Null Space Perturbations

Hi, I face a problem some time now (not a homework problem) and I believe it is related to matrix perturbations and how the null space behaves in these cases. The distilled version of the ...
Kostas's user avatar
  • 199
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 ...
Wayne's user avatar
  • 21
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{...
newbie's user avatar
  • 61
2 votes
1 answer
236 views

An inequality regarding projection

Let $a, b \in \mathbb{R}^k$ be two normalized vectors such that $a^T b << 1$. Define matrix $C$ such that $[a, b, C]$ is full column rank, and let matrix $D$ be positive definite. Define ...
Jeff's user avatar
  • 482
2 votes
1 answer
359 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 ...
Janathan's user avatar
2 votes
1 answer
2k views

power of a block triangular matrix

I have a matrix in the form : $$M = \begin{pmatrix} A & 0 & 0 \\\ B & A & 0 \\\ C & D & A \end{pmatrix} $$ where $A,B,C,D$ are diagonalizable square matrices and I want to ...
Christophe'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
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
345 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
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
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
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
2 votes
0 answers
87 views

Conditions for $B$ that make $ADB + (ADB)^T$ positive (semi-)definite

I am trying to find conditions under which this dynamical system converges. At the end of the day, we have something like $$ 0 \leq x^TD_0W_0D_1W_1D_2 \dots W_ND_NCx $$ With $D_i$ matrices that are ...
Robert's user avatar
  • 121
2 votes
0 answers
147 views

Is the following inequality true for the norm of Moore-Penrose pseudoinverses?

Let $L$ be a real, positive semi-definite, symmetric, square matrix, with pseudoinverse $L^{+}$. It can be shown for the operator norms $||.||_{op}$ that: if $L$ is invertible and $||I - L||_{op} < ...
Learning math's user avatar
2 votes
0 answers
477 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 ...
neil's user avatar
  • 73
2 votes
0 answers
1k 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 ...
hoom's user avatar
  • 21
2 votes
0 answers
130 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)$, ...
Weeson Dorne's user avatar
2 votes
0 answers
372 views

What is the Birkhoff norm of a Perron vector?

Let $A$ be a positive matrix. What is known about the Birkhoff norm of its Perron vector? By the Birkhoff norm of a vector $x$ I refer to the quantity $\frac{\max{x}}{\min{x}}$. P.S. This is ...
Felix Goldberg's user avatar
1 vote
3 answers
195 views

The functional equation $T(x\otimes y)=T(x)\otimes T(y)$ on the matrix algebra

Is there a non trivial sequence $(T_{n})$ of linear operators $T_{n}$ on $M_{n}(\mathbb{C})$ such that $$T_{nm}(X\otimes Y)=T_{n}(X) \otimes T_{m}(Y) $$ where $X$ and $Y$ are in $M_{n}(\mathbb{C})$ ...
Ali Taghavi's user avatar
1 vote
3 answers
5k views

Number of parameters needed to specify a Hermitian matrix of rank r.

Hi, i have two questions that seem to bother me lately. Maybe you could help me and/or point me in any related literature. 1) Assume hermitian matrix $H \in \mathcal{C}^{n \times n}$ that has rank $...
Kostas's user avatar
  • 199
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,\...
Richard Zhang's user avatar
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}$...
Apprentice's user avatar
1 vote
1 answer
437 views

Eigenvector of a nonnegative matrix in closed form

Consider $n\times 1$ vector $\alpha = (\alpha_{1}, ..., \alpha_{n})$, where $0<\alpha_{i}<1$, and $\sum_{i=1}^{n}\alpha_i = 1$. Construct the $n\times n$ zero-diagonal matrix $A$ with $(i,j)$-th ...
Abhishek Halder's user avatar
1 vote
1 answer
623 views

Can I modify the singular values of a matrix in order to get a negative eigenvalue?

Let $A \in \mathbb{R}^{n \times n}$ be a real nonsymmetric matrix with eigenvalues $\left\{\lambda_i : i=1..n\right\}$ with positive real part $\Re(\lambda_i) > 0$ $\forall i=1..n$ Let $A=U\Sigma ...
Astor's user avatar
  • 323
1 vote
1 answer
940 views

Uniqueness and invariance of the LDLT decomposition

A real symmetric positive semi-definite matrix $A$ can be decomposed in the form $A = P^TLDL^TP$, where $P$ is a permutation matrix, $L$ is a lower unit triangular matrix and $D$ is a diagonal ...
user3749105's user avatar
1 vote
2 answers
486 views

Closed form for integral of function of a symmetric positive definite matrix

Let $M$ be a real symmetric positive definite matrix of size $n \times n$, and let $\log M$ denote its (principal) matrix logarithm. Is it possible to evaluate the following integral in closed form? ...
Abhishek Halder's user avatar
1 vote
1 answer
462 views

Is this a full rank matrix? [closed]

According to the answer of znt to the previous version, I revise the question as follows: Is there a real $(n-1)\times n$ matrix $A$ such that $A$ is not a full rank matrix and satisfy $a_{ii}&...
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
1 vote
2 answers
1k views

A "positive diagonal plus skew-symmetric" matrix decomposition

Let $A\in\mathbb{R}^{n\times n}$ be a diagonalizable matrix with real and strictly positive eigenvalues (note that $A$ is not required to be symmetric). My question. Do there exist an orthogonal ...
Ludwig's user avatar
  • 2,712
1 vote
1 answer
607 views

The state-transition-matrix of a physical system,

Here's a simple but potential research problem that I am learning about. Let's say I am studying a physical system that is governed by N objects. At each time, each object is either "active" and ...
User001's user avatar
1 vote
2 answers
575 views

matrix stability criterion

I have a $5 \times 5$ parametric nonnegative matrix and want to show that it's stable (in the sense that all eigenvalues are positive). It is not symmetric, but I do know in advance that it has 5 real ...
Felix Goldberg's user avatar
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 $...
algebroo's user avatar
  • 135
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 ...
user139975's user avatar
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 &...
Peter's user avatar
  • 11
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^...
Apprentice's user avatar
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
1 vote
1 answer
103 views

On ranks of matrices with tensor structure

Fix two $2^t$ length vector of form $p=\begin{bmatrix}u_1&v_1\end{bmatrix}\otimes\dots\otimes\begin{bmatrix}u_t&v_t\end{bmatrix}$ and $r=\begin{bmatrix}w_1&z_1\end{bmatrix}\otimes\dots\...
Turbo's user avatar
  • 13.9k
1 vote
1 answer
2k views

SVD of two matrices A and B having the same right singular vectors?

I saw this statement in a lecture note Assume the generalized SVD of matrices $A\in R^{m\times n}$ and $B\in R^{p\times n}$ given as: $$U^TAX = diag(\alpha_1, ..., \alpha_n),~ U^TU = I_m$$ $$V^TBX = ...
Shindou's user avatar
  • 113
1 vote
2 answers
508 views

Sufficient conditions for inverse-positivity

I am trying to determine when a certain parametric matrix is inverse-positive (it's actually the one about which I asked in Explicit formula for Cholesky factorization in a special case, but the ...
Felix Goldberg's user avatar
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!
JWRebecca's user avatar
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\...
ABB's user avatar
  • 4,058
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 ...
Hvjurthuk's user avatar
  • 573
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
1 vote
0 answers
172 views

A vanishing sum of symmetric matrices

Let $\{G_i\}_{i=1}^N\in\mathbb{R}^{n\times m}$ be a set of full column rank matrices (i.e., $\mathrm{rank}(G_i)=m$ for all $i$) and $\{P_i\}_{i=1}^N\in\mathbb{R}^{m\times m}$ be a set of positive ...
Ludwig's user avatar
  • 2,712
1 vote
0 answers
187 views

A question concerning positive definite matrix functions

Let $C(e^{i\theta})$ be an $m\times n$ ($m\ge n$) matrix-valued continuous function of $\theta\in[-\pi,\pi]$. Let $A_1(e^{i\theta})$ and $A_2(e^{i\theta})$ be two $n\times n$ positive definite matrix-...
Ludwig's user avatar
  • 2,712
1 vote
0 answers
137 views

Boundary of pseudospectra

Suppose: $B_i \in \mathbb{C}^{n \times n}$, $0<w_i\in \mathbb{R}$ $(i = 0,1,2,\ldots,m)$ ${\rm P}(x) ={\rm{B}_m} x ^m + \cdots + B_1 x + B_0$ is a matrix polynomial, and $x $ is a complex ...
R.T MAN's user avatar
  • 151