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 ...

learn more… | top users | synonyms (1)

0
votes
0answers
25 views

Connected components $0-1$ matrices

Let $M$ be a $0-1$ matrix. Here a matrix has one component means we can traverse from a matrix entry $(i,j)$ which is $1$ to any other one by moving step of $(i\pm1,j),(i,j\pm1),(i\pm1,j\pm1)$ where ...
8
votes
0answers
126 views

ULU Decomposition of a matrix

Let $g \in GL_n(\mathbb{F}_q)$. Is it true that we can always write $g = u_1lu_2$, where $u_1$ and $u_2$ are upper-triangular and $l$ is lower-triangular? Note that I'm not requiring that the matrices ...
-3
votes
0answers
25 views

Should simulation from a student-t copula distribution yield the input correlation matrix [on hold]

I am using mathematica to simulate random variates from a student-t copula distribution. Assuming that I input in the correlation matrix R, after generating a certain number of random variates, should ...
0
votes
0answers
29 views

Canonical forms of symmetric/skewsymmetric quaternionic matrix

$A$ belongs to $n$-dimensional quaternion symmetric matrix, in the sense that $A=A^T$, where $T$ means transpose. Under transformation $U$, $A\rightarrow U\cdot A\cdot U^T$, where $U$ is $n$-dim ...
10
votes
2answers
874 views

How to transform matrix to this form by unitary transformation?

Without loss of gernerality, we can only consider $n$-dimensional diagonal matrix $M$ whose elements are all nonnegative, i.e. $$M=\operatorname{diag}(m_1,m_2,\cdots,m_n)\ (m_i \geq 0).$$ Then is ...
1
vote
0answers
93 views

when can I say that $UV^T$ is a permutation matrix? [on hold]

suppose we have two p.s.d matrices A and B: so we can diagonalize them like this: A= $UΛU^T$ and $B=VΣV^T$ 1: on what condition for $A$ and $B$ I can say that $UV^T$ is a permutation matrix? 2: how ...
1
vote
1answer
101 views

finding permutation matrix I which minimizes TRACE( I* C*( I^T)* D) matrix

I have a problem that is really important for my thesis and i am not studding math so i will be very glad if you help me in this case... thanks for your help in advance I want to find permutation ...
1
vote
1answer
58 views

Bringing a (Least Squares Problem) Matrix into Block Upper-triangular Shape via Matrix-reordering

I have the problem of solving very large and very sparse least squares problems and, a bit dissatisfied with the run-times of the full-fledged QR-algorithm, I would like to bring the instances into ...
-1
votes
0answers
46 views

The invertibility of matrix (I - XX')? [closed]

I is an identity matrix of size n*n. X is a matrix of size n*k(Assuming k<= n). As we know, (I+XX') is invertible. Because (I+XX') = (I X)*(I X)', where (I X) is invertible. So I'm wondering ...
0
votes
1answer
132 views

Bounded domain matrix factorization

Assume we're trying to find $A\in [-1,1]^{n\times d}, B\in [-1,1]^{m\times d}$, from an observed matrix $C\in [-d,d]^{n\times m}$, where $C=AB^T$. The goal is to return $\widehat A, \widehat B$ such ...
-2
votes
0answers
28 views

Linear momentum balance of principle of virtual power [closed]

So I have this problem, and I am totally lost. Any help is much appreciated. Problem statement: http://i.stack.imgur.com/gHq36.jpg
1
vote
2answers
136 views

Characteristic polynomial of Kronecker/tensor product

This was asked before on stackexchange but no answer was given. The question is the following: Let $A$ and $B$ be matrices in $GL(n)$ and $GL(m)$ respectively. Their tensor product $A\otimes B$ is ...
1
vote
0answers
90 views

How to prove the following claim about Pseudoinverse

For real symmetric matrices $K$ and $\hat{K}$, if $u^{T}{K}u\le u^{T}\hat{K}u\le C u^{T}{K}u$ for all $u$ in the row space of $K$, then $u^{T}{K^{+}}u\ge u^{T}\hat{K}^{+}u\ge u^{T}{K^{+}}u/C$ for all ...
4
votes
1answer
122 views

Compute adjugate matrix over commutative ring

Let $A$ be a $n\times n$ matrix over a commutative ring. I'm looking for a good method to compute its adjugate matrix. My current approach is to use the Cayley-Hamilton theorem: $$\text{adj}(A) = ...
5
votes
1answer
534 views

Proving that the kernel of this matrix is of dimension 2

(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 ...
6
votes
3answers
470 views

A question about symmetric matrix

Let $A= (a_{ij})_{ij}, 1 \leq i, j \leq n$ be a symmetric $n \times n$ matrix. Suppose (1) $a_{ij} \geq 0$ are real numbers; (2) The sum of each row $\sum_{j=1}^{n} a_{ij} = 1$ for $1 \leq i \leq ...
4
votes
1answer
84 views

Calculating the dimension of the algebra generated by some given matrices

Let $X_1, X_2, \ldots, X_d$ be $n \times n$ matrices over some field $K.$ I want to calculate the dimension of the unital algebra generated by $X_1, X_2, \ldots, X_d$ for some examples in a problem I ...
3
votes
1answer
81 views

Hankel matrix commuting with a Jacobi matrix

Assume the semi-infinite Hankel matrix $H$ with entries $$H_{i,j}=\alpha_{i+j-1}, \quad i,j\geq1,$$ where $\alpha_{n}\in\mathbb{R}$, is given. It turns out that in some special situations a ...
3
votes
1answer
1k views

Matrix approximation

Let A be an $m\times n$ matrix and $k$ be an integer. Assume that $A$ is non-negative. We want to find a scalar $\epsilon$ and an $n\times n$ matrix $B$ such that $A\leq A(\epsilon I + B)$ (where ...
5
votes
1answer
73 views

metric on ${\bf SPD}_n({\mathbb R})$

The cone ${\bf SPD}_n({\mathbb R})$ of symmetric positive definite matrices is endowed with a nice geometrical structure. The midpoint of the (unique) geodesic between $A$ and $B$ is the so-called ...
2
votes
0answers
47 views

Sum of the entries of the inverse covariance matrix

Let $T \in\left(0,1\right)$, $n\in\mathbb{N}$ and $e_n = [1,\ldots,1]\in\mathbb{R}^n$. Consider the covariance matrix $\mathfrak{A}_n = ...
4
votes
1answer
144 views

Rank 1 Approximation of Elementwise Inverse Matrix

I'm wondering whether there is a good way to solve the following optimisation problem. Given a strictly positive quadratic matrix $A$, find two diagonal matrices $D_1$ and $D_2$ so that $$ \| D_1 A ...
0
votes
1answer
475 views

eigen-decomposition solution? is it unique?

Assume an N*N covariance matrix (Q) which is a positive definite matrix. The decoder X is assumed to be N*s, where s<=N. X is calculated to be s eigenvectors corresponding to s minimum eigenvalues. ...
4
votes
2answers
115 views

perturbation of Invariant subspaces

Let $A,B$ be matrices in $GL(n,\mathbb{R})$ sufficiently close in the usual metric on matrices. Suppose $A$, resp., $B$ stabilizes a $k$-dimensional subspace $U$, resp., $V$ of $\mathbb{R}^n$, where ...
1
vote
4answers
2k views

Eigenvalues of Symmetric Tridiagonal Matrices

Suppose I have the symmetric tridiagonal matrix: $ \begin{pmatrix} a & b_{1} & 0 & ... & 0 \\\ b_{1} & a & b_{2} & & ... \\\ 0 & b_{2} & a & ... & 0 ...
9
votes
1answer
334 views

Sum of commuting semisimple operators

Let $V$ be a finite dimensional vector space over a field $K$. An operator $T:V\to V$ is called semi-simple if every $T$-invariant subspace of $V$ has a $T$-invariant complement(for algebraically ...
1
vote
1answer
296 views

Under what conditions there is a one-to-one mapping between a product of matrices and the sequence of matrices leading to the product?

I have a set of matrices $A_1,\ldots,A_n$. Let $\mathcal{A} = \{A_i\}$. What are some simple conditions under which for any sequence of indices between $1$ and $n$, $a_1,\ldots,a_m$, the product ...
3
votes
2answers
243 views

Convergence of iterated stochastic matrices

It is well-known that for a stochastic aperiodic matrix $M$, the sequence $(M^n)_n$ converges. Here I would like to a have a more precise analysis. Consider now a sequence of stochastic matrices ...
3
votes
1answer
101 views

Characterizing space that preserves positive-definiteness property

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. ...
2
votes
1answer
108 views

Unitary factor in polar decompositions

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 ...
1
vote
0answers
127 views

Finding an overgroup or a subgroup in PGL

Let k be a nonperfect field of characteristic $2$. Let $a\in k\backslash k^2$, $G=PGL_4(k)$ and and $$H= \left\{ \small\left[\begin{array}{cccc} x ...
2
votes
0answers
120 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 ...
1
vote
1answer
51 views

Efficient computation of null space of large symbolic matrices?

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 ...
-3
votes
3answers
291 views

Determinant of matrix from set {-1, 1} [closed]

Let $A \in \mathbb{R}^{11 \times 11}$ and it's elements are form set $\{ -1,1 \}$. $\mathbb{P}(-1) = \mathbb{P}(1) = 0.5$. What is a probability to get such a matrix, that $\det A > 4000$? I have ...
1
vote
1answer
217 views

Diagonalization of 4th order tensors

I have been wondering about the following problem... Let $n$ be a positive integer and denote by $M_n^s$ the space of symmetric $n\times n$ real matrices. Now, we look at the space $\mathcal ...
7
votes
2answers
261 views

Closure of the orbits of the $SL(2,\mathbb{Z})$-action on $\mathbb{R}^2$

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$ ...
0
votes
2answers
128 views

Uniqueness of solution of a nonconvex optimization problem

What conditions need to be hold for a nonconvex optimization problem to have a unique solution? Specifically, I have the following minimization problem that I'd like to know whether it has a unique ...
10
votes
1answer
288 views

LU factorization for $I+A$ (A skew-symmetric)

The matrix $M=I+A\in \mathbb{R}^{n\times n}$, where $I$ is the identity and $A=-A^T$ is skew-symmetric satisfies $$ Mx\cdot x = \|x\|^2 \quad\text{for all }x\in\mathbb{R}^n. $$ Therefore, $M=LU$ has ...
38
votes
1answer
762 views

Determinant of a determinant

Consider an $mn \times mn$ matrix over a commutative ring $A$, divided into $n \times n$ blocks that commute pairwise. One can pretend that each of the $m^2$ blocks is a number and apply the $m ...
1
vote
0answers
28 views

Modified Orthonormal Procrustes Problem

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 ...
1
vote
0answers
34 views

Distributing partially known data between n parties

Assume that $n = 2r+1$. There are $n$ elements $a_1,a_2,\ldots,a_n$ from a finite field $\mathcal{F}$, and $n$ parties. Each party knows the values of at least $r+1$ elements out of those $n$ ...
3
votes
0answers
34 views

Counting cosets of matrices of determinant > 1 under the action of a congruence subgroup

I tried asking this on math exchange, but no luck, so thought I'd try here. Let $M_2(m,\mathbb{Z}) $ be the $2\times 2$ matrices with integer entries and determinant $m$. Let $\Gamma^0(N)$ be the ...
3
votes
0answers
110 views

Commutative decomposition for full-rank $A$ and low-rank $B$ matrices that do not commute

1. Motivation Consider symmetric matrices $A,B\in\mathbb{R}^{n\times n}$, and let $A$ be full-rank and $B$ be low-rank. The simultaneous block-diagonalization, defined as the following ...
0
votes
0answers
18 views

Composition of Lossless Systems from Delay and Mixing regarding junction admittance

Given $m_1, \dots m_N \in \mathbb{N}$ and matrix $\mathbf{A} \in \mathbb{C}^{N\times N}$. Let us define a diagonal matrix $\mathbf{D}(z) = diag(z^{-m_1}, \dots, z^{-m_N})$ with $z\in\mathbb{C}$. ...
11
votes
0answers
227 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 - ...
5
votes
1answer
149 views

A coalgebra structure on compact operators

Is there a coalgebra structure $\Delta_{n}$ on $M_{n}(\mathbb{C})$ which is compatible with the natural embedding $i_{n:}M_{n}(\mathbb{C})\to M_{n+1}(\mathbb{C})$ with $i_{n}(A)= A\oplus ...
2
votes
0answers
81 views

Copositivity under tensor products

Is there any symmetric real matrix $A$ such that $A^{\otimes n}$ is copositive for all positive integers $n$, but such that A is neither positive semidefinite nor has just non-negative entries? ...
14
votes
4answers
713 views

Eigenvectors of a particular transition matrix

I am considering a Markov chain with $n$ states with a particularly nice structure. The transition matrix is as follows: \begin{equation}\mathbf{P}=\begin{pmatrix} 0 & 0& \dots&0 & 0 ...
5
votes
2answers
262 views

Partial inverse of a matrix - or does it have its own name?

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 ...
5
votes
0answers
508 views

A stronger Cauchy-Schwarz inequality for traces of compression matrices

Assume that $A$ and $B$ are contractions, so $I-AA^T$ and $I-BB^T$ are positive-definite matrices. Let $C=(I-AB^T)^{-1}(I-AA^{T})(I-BA^{T})^{-1}$, and show that: ...