Tagged Questions

Questions where the notion matrix has an important or crucial role (for the latter, note the tag matrix-theory for potential use). Matrices appear in various parts of mathematics, and this tag is typically combined with other tags to make the general subject clear, such as an appropriate top-level ...

Let $A, B$ be $n$-square (Hermitian) positive definite matrices. Let $AB=U|AB|$ be the polar decomposition of $AB$. So $U$ is unitary (called the unitary factor of $AB$). What is the optimal constant ...

Are there any computer algebra system/libraries that can compute the null space of a large symbolic matrix in parallel? This problem arises when finding invariant polynomials of a continuous linear ...

I'm coming with a very basic question for which I can't find an answer. Please forgive me if I didn't search efficiently enough.
What can the closure of an orbit of an element $X$ of $\mathbb{R}^2$ ...

In the general orthonormal Procrustes problem, we want to find an orthonormal matrix $C$ to minimize $\|Y-XC\|_F^2$, where $Y$ is a known $n\times q$ matrix, $X$ is a known $n \times m$ matrix, and ...

Given a symmetric positive-definite matrix $\Sigma$, consider the space $\mathcal{D}$ of diagonal matrices such that $\forall D\in\mathcal{D}$, the matrix $\Sigma-D\Sigma^{-1}D$ is positive definite. ...

In my calculations I need to use something which is "between" a matrix and its inverse. That is, I invert only some dimensions. I am interested if it has an established name.
That is, a matrix (here ...

(Edit : see at the bottom of the question for an additional surprising possible hint.)
Using a computational software program, I found that the kernel of the following matrix is of dimension 2 when ...

Let $Q$ be a (say 4x4) unitary matrix, distributed according to the Haar distribution. Denote the upper left 2x2 submatrix of $Q$ as $Q_{1:2,1:2}$. I am interested in the following expectation:
$E(I ...

Consider a large, probably sparse graph with Markovian random walkers on it. Define discovery time as time to first
reach a vertex by random walk
from uniform start. Are there effective ways to find ...

Let $Q\in O(n,\mathbb C)$ be a complex orthogonal matrix. I would like to know if $Q$ can always be written as $Q = T^{-1}ST$, where $T\in O(n,\mathbb R)\subset O(n,\mathbb C)$ and $S$ belongs to some ...

I originally posted this on math.stackexchange, but it quickly got buried. I removed it not too long after, thinking of rewriting it for MO, but I didn’t have a chance to post it until now. Apologies ...

Suppose we are given a $d \times d$ matrix $M$ with rows $m_1, \dots, m_d$.
This matrix describes a simplex, namely the convex closure of the origin with the vectors $m_1, \dots, m_d$.
Now, scaling ...

It is mentioned here that if $A, B, C\in M_{n}(\mathbb C)$ are positive semidefinite, then $$\det (A+B+C)+\det C\ge \det (A+C)+\det (B+C)$$ (quoted from this article) and the special case ($C=\bf 0$) ...

Assume that we have two real symmetric matrices A and B, where A is a positive diagonal matrix, and B is a symmetric matrix with one eigenvalue λ = 0. Assume that H= AB;
is it possible to proof that ...

Update: see below
Let $M$ be an $n\times n$ matrix that's constructed as follows. Construct the right-most column of $M$ as $[\alpha_1(x_1),\cdots,\alpha_n(x_n)]^T$ for some class of fixed functions ...