The study of the properties of real and complex matrices that are more close to analysis and operator theory. For instance: the properties of positive definite matrices, matrix inequalities, perturbation analysis, matrix functions, inequalities between eigenvectors and singular values, majorization.

learn more… | top users | synonyms

-8
votes
0answers
54 views

What are singular value of $A$? [on hold]

Let $ A = \left( {\begin{array}{*{20}{c}} {x + (\frac{3}{4} + y)i}&1&1\\ 0&{(x - \frac{5}{4}) + iy}&1\\ 0&0&{(x + \frac{3}{4}) + iy} \end{array}} \right)$, and $x,y\in ...
6
votes
3answers
177 views

Logarithms of matrices in the disk-algebra

It is easy to see that within the disk algebra $A(D)$ $$\Delta(z):= \begin{pmatrix} 1&0\\z&1 \end{pmatrix}\; \begin{pmatrix} 1&1\\0&1 \end{pmatrix}= \begin{pmatrix} ...
-1
votes
0answers
48 views

What will draw a shape for $L = \left\{ {\lambda \in \mathbb{C}:{s_4}(\lambda ) = {s_3}(\lambda )} \right\}$ [on hold]

Let $P(\lambda ) = \left( {\begin{array}{*{20}{c}} {{\lambda ^2} - 1} & 0 \\ 0 & {{\lambda ^2} - 2\lambda } \\ \end{array}} \right)$ and $\lambda \in \mathbb{C}$( $λ$ is a complex ...
-2
votes
0answers
43 views

$k$-th diagonal element of an inverse matrix $(\textbf{H}^{\dagger}\textbf{H})^{-1}$ [on hold]

Let $\textbf{W}=\textbf{H}^{\dagger}\textbf{H}$ with $\{\cdot\}^{\dagger}$ being conjugate transpose operator. In some materials I have read so far, there is a common statement that the $k$-th ...
1
vote
3answers
160 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})$ ...
1
vote
1answer
29 views

Eigenvalues of partial Hankel matrices

I was wondering if there are closed formulas for the singularvalues of a partial Hankel matrix (by partial I mean $\ell<n$) \begin{align*} H= \begin{bmatrix} c_1 & c_2 & \ldots & ...
1
vote
0answers
32 views

Matrix diagonalization after a completely positive transformation

I have a hermitian matrix $A$ which can be diagonalized: $$A=UDU^+,$$ where U is the unitary matrix and D is the diagonal matrix. Next, I have a completely positive transformation over it, which is ...
0
votes
0answers
41 views

How to get Wiener-Hopf decomposition of this matrix function

I met a matrix function $M(z)$ that I need to get its Wiener-Hopf decomposition that $M(z) = M_+(z) M_-(z)$ with $M_+(z)$ and $M_-(z)$ being analytic inside and outside the unit circle respectively. ...
0
votes
1answer
48 views

Restricted Isometry Property for Discrete Fourier Transform Matrix

I was wondering if the Restricted Isometry Property holds for Discrete Fourier Transform. In particular, I am interested in whether a subsampled DFT matrix has such property. Let$W \in ...
1
vote
0answers
42 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 ...
3
votes
1answer
83 views

Wiener-Hopf factorization of matrices

Given a $2\times2$ matrix, which entries are functions in the complex plane $$\hat{A}(z)=\left(\begin{array}{cc}a(z)&b(z)\\c(z)&d(z)\end{array}\right)$$Where $a(z),b(z),c(z)$ and $d(z)$ are ...
3
votes
2answers
271 views

Factor matrix ${\bf A}$ into the product ${\bf B}{\bf C}$ where ${\bf C}$ has no negative entries and ${\bf B}$ has few non-zero entries

This is a more carefully worded version of this question, here tailored to professional mathematicians. Consider a matrix ${\bf A}\in{\bf M}_{n\times n}({\mathbb R})$ with possibly positive, negative ...
1
vote
0answers
51 views

inverse of asymptotic Toeplitz matrix with band limited associated function

I am reviewing a controversial paper, and the main result, a revolution within my field, comes down to whether or not the following is true. I strongly believe it is not, but would need confirmation. ...
0
votes
1answer
155 views

$P(Z)$ is matrix polynomials. Why is $s_n$ smooth in a neighbourhood of $Z$?

Let $A_j \in \mathbb{C}^{n \times n}$, ($j = 0,1,2,\ldots,m$) and $P(Z) = A_m Z^m + \cdots + A_1 Z + A_0$ is a matrix polynomial, and $Z $ is a complex variable. $Z$ is eigenvalue of $P(Z )$ if ...
5
votes
1answer
81 views

Optimization of a function of a positive definite matrix and its inverse

This question is a little ill-posed, but I've been playing with some equations and am just wondering if this resembles any known problems that have been solved. Suppose I have two real, positive ...
20
votes
0answers
567 views

Real square roots of symmetric matrices

In joint work with Andreas Fischle (TU Dresden, Germany) and Patrizio Neff (U Essen, Germany) we needed to use the following statement: If $S$ is a real $n\times n$ matrix with $S^2$ symmetric, then ...
2
votes
0answers
62 views

When is an selfadjoint operatorvalued matrix with positive semidefinite diagonal elements positive semidefinite as well?

It would be soo awesome if you could help! For $ p \in \mathbb{N}$ consider the following $\mathcal{S(H)}^{p\times p}$-matrix $\boldsymbol{\Gamma}_p := (C_{i-j})_{i,j=1, ..., p}$ of nuclear operators ...
7
votes
1answer
74 views

Add a multiple of $I$ to a matrix to minimize its operator norm

Given $A\in\mathbb{C}^{n\times n}$, what is $s_* = \arg\min \|A-sI\|$? Here $\|A\|$ is the operator norm, $\|A\|=\rho(A^*A)^{1/2}$, and $I$ is the identity. The corresponding problem for the ...
4
votes
0answers
53 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 ...
1
vote
0answers
96 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 ...
2
votes
0answers
72 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?
1
vote
0answers
36 views

Limits on a parameter $\alpha$ to get positive definite matrix

Given positive semi-definite $n\times n$ matrices $B_k$, how would I go about getting the limits on $\alpha_k$ such that the expression \begin{equation} \mathbb{I}-\sum_{k=1}^{m-1}\alpha_kB_k ...
0
votes
1answer
49 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 ...
5
votes
2answers
203 views

Induced matrix norm less than one for matrices with spectral radius less than one

Let $A$ be a square matrix with elements in $\mathbb{R}$ or $\mathbb{C}$, $\rho\left(A\right)$ stands for the spectral radius of $A$, i.e., the maximum absolute eigenvalue of $A$; $A^{*}$ is the ...
0
votes
0answers
33 views

If $A$ is doubly stochastic and reducible. Why is $A$ permutation similar to a matrix of the form $A_1 ⊕ A_2$

If $A \in M_n$ is doubly stochastic and reducible. Why is $A$ permutation similar to a matrix of the form $A_1 ⊕ A_2$, in which both $A_1$ and $A_2$ are doubly stochastic?
1
vote
0answers
75 views

Let $M = \frac{1}{2}(A + {A^T})$ be real symmetric nonnegative matrix. Why does $\rho (A) \le {\lambda _{\max }}(M)$?

Let $A \in M_n$ be nonnegative, and consider the real symmetric nonnegative matrix $M = \frac{1}{2}(A + {A^T})$. Why does $\rho (A) \le {\lambda _{\max }}(M)$?
1
vote
0answers
72 views

A question on Perron–Frobenius theorem [closed]

Let $A \in M_n$ is nonnegative(all $a_{ij}\ge0$). Suppose $A$ has a nonnegative eigenvector(all entries$\ge0$ ) with $r ≥ 1$ positive entries and $n − r$ zero entries. Why is there a permutation ...
0
votes
0answers
45 views

On the positive definiteness of RBF kernel with DTW distance

Consider an RBF kernel that is defined as $K(\mathbf{x},\mathbf{y}) = \exp\left(-\dfrac{d^2(\mathbf{x},\mathbf{y})}{2\sigma^2}\right)$, where $d(\mathbf{x},\mathbf{y})$ is usually chosen as the ...
6
votes
2answers
389 views

The space of positive definite orthogonal matrices

The matrix $\begin{bmatrix}1 & 0 \\ 0 & -1\end{bmatrix}$ is orthogonal and indefinite. $\begin{bmatrix}1 & 0 \\ 0 & 2\end{bmatrix}$ is positive definite and not orthonormal. and the ...
5
votes
1answer
117 views

On proof of the conditionally negative definiteness of a kernel

Let the kernel be $f(\mathbf{x},\mathbf{y}) = \arccos(\mathbf{x}^T \mathbf{y})$, where $\mathbf{x}$ and $\mathbf{y}$ are $\ell_2$ normalized vectors of the same dimensionality, and $\arccos(\cdot): ...
4
votes
3answers
150 views

Fast Upper Triangular Matrix Exponentiation

Let $Q_n$ be a $n\times n$ matrix with $Q_n=\begin{pmatrix} -\lambda_1-\mu_1 & \lambda_1 & 0 & \cdots\\ 0 & -\lambda_2-\mu_2 & \lambda_2 & \cdots\\ \vdots & \vdots & ...
7
votes
1answer
152 views

approximate stationary distributions of a doubly stochastic matrix and its supports

Given a doubly stochastic matrix $M$ and a distribution $v$,let $M=\sum_{\sigma\in S_n}p_{\sigma}M_{\sigma}$ be any Birkhoff decomposition of $M$, where $M_{\sigma}$ is the permutation matrix induced ...
4
votes
2answers
157 views

Non-asympototic version of Gelfand's formula

Let $A$ be a $n\times n$ matrix. Let $\|A\|$ be the spectral norm of $A$, and $\rho(A)$ be the spectral radius. I am wondering whether the following statement is true. There exists universal ...
3
votes
1answer
101 views

Horn's spectrum problem with random Hermitian matrices

An important problem in matrix analysis, completely solved in the early 2000's by A. Knutson & T. Tao (The honeycomb model of GLn(C) tensor products. I. Proof of the saturation conjecture. J. ...
0
votes
0answers
28 views

Reducing the degrees of freedom in unitary columns

Let $U = diag([U_1, U_2, ..., U_N])$ be a block-diagonal $NM \times NM$ unitary matrix, where each $U_j$ is a unitary $M \times M$ matrix. Furthermore, let $Q_e = kron(I_M, Q)$ be the Kronecker ...
8
votes
0answers
88 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}+ ...
7
votes
1answer
113 views

Efficient SVD of a matrix without some of the columns

I have a matrix $A \in \mathbb{R}^{p \times q}$ of rank $r$ and its SVD decomposition, i.e, $$ A = U S V^\top, $$ where $U \in \mathbb{R}^{p \times r}$ and $V \in \mathbb{R}^{q \times r}$ are ...
17
votes
1answer
440 views

Almost commuting unitary matrices

Suppose that $A_1,\dots, A_k$ are unitary matrices such that any two of them can be approximated by commuting unitary matrices. i.e. for any $i$ and $j$, there are unitary matrices $A_i'$ and $A_j'$ ...
-1
votes
1answer
43 views

finding a unitary submatrix inside a random matrix

Let $\mathbf{R} \in \mathbb{C}^{~m \times n} $ with $m \leq n $ be a random matrix, whose entries are i.i.d zero mean random variables with circularly symmetric Normal distribution. Let where $r$ be ...
1
vote
0answers
43 views

Triangle inequality for nonconvex functions of singular value vector

For a nonconvex function $p_\lambda(\cdot)$, with hyper-parameter $\lambda$, it can be decomposed into two parts that $p_\lambda(t) = \lambda |t| + q_\lambda(t)$, where $q_\lambda(t)$ is the concave ...
-1
votes
1answer
184 views

How bad could $\|A^k\|$ be when $\rho(A) < 1-\delta$ [closed]

(Sorry, I do hate editing this many many times but let me try the last time) Gelfand's formula says that $$\lim_{k\rightarrow \infty} \|A^k\|^{1/k} = \rho(A)$$ I am wondering whether there is any ...
1
vote
0answers
33 views

connected stable rank

There is a beautiful formula by Leonid Vaserstein relating the Bass and topological stable rank of a commutative unital Banach algebra A to that of the matrix algebra M_n(A). Is there something ...
1
vote
0answers
54 views

Log convexity for the norm of a vector-valued function

Log convexity of various functions defined on the space of Hermitian matrices plays an important role in matrix analysis and probability theory. Given $v \in \mathbb{C}^n$, $D$ a diagonal matrix with ...
2
votes
0answers
87 views

What does similar eigenvectors and eigenvalues of two matrices really mean? [closed]

Empirically I've noticed that diagonally dominant matrix G and it's diagonal version D (diagonal elements of G on the diagonal and all other elements are set to zero) produce similar eigenvalues and ...
3
votes
0answers
45 views

Isometric domain of a unital completely positive map with respect to $L_p$-norms

This question can be formulated for general ($\sigma$-finite) von Neumann algebras, but for me it is enough to consider matrix algebras. So let $M$ be a matrix algebra and $\rho$ a faithful state ...
2
votes
1answer
59 views

Regularity of decomposition of matrix-valued function

Here is the problem. Suppose I have a positive definite matrix-valued function $A\colon \mathbb{R}^n\to \mathbb{R}^{n\times n}$. Then we know that there is a matrix-valued function $B\colon ...
1
vote
1answer
83 views

Is this matrix positive semi-definite? [closed]

Consider $K$ vectors $x_1,\dots,x_K$ in $\mathbb{R}^N$. Define the $K\times K$ matrix $A$ whose $(i,j)$ entry is given as $$A_{ij}=\exp(-\frac{||x_i-x_j||^2}{2})$$ Is this matrix Positive ...
0
votes
0answers
58 views

Composition of upper semi-continuous real valued function with upper semi-continuous matrix valued function

Say that a matrix valued function $A: \mathbb{R} \rightarrow \mathbb{R}^{n \times n}$ is upper semi-continuous at $x_0$ if $$ \limsup_{x \rightarrow x_0} A(x) \preceq A(x_0), $$ where $\preceq$ ...
1
vote
0answers
157 views

3-regular (cubic) graph with adjacency eigenvalue 1

Suppose $A\in\{0,1\}^{n\times n}$ is the adjacency matrix of a 3-regular (cubic) graph $G=(V,E)$; that is, all $n$ vertices $v\in V$ in the graph have three neighbors. Is there a nice necessary ...
5
votes
1answer
82 views

when does elementwise-log preserve positive-semidefiniteness?

Let $Z$ be a positive semidefinite matrix with nonnegative entries, and define $X=\log(1+Z)$, where the $\log$ is taken entrywise, i.e., $X_{ij}=\log(1+Z_{ij})$. Are there some simple sufficient ...