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)

1
vote
0answers
73 views

Diagonalization of the matrix $(1/(i+j+\rm{const}))_{i,j}$

Consider the following infinite matrix: $A_{i,j}=\frac1{i+j+\gamma}$, $0\leq i,j<\infty$, $\gamma>0$ is a constant. Is it known how to diagonalize $A$, or, say, calculate $(I+tA)^{-1}$ for ...
0
votes
0answers
22 views

Is there any study about positive definiteness of some matrix space whose matrices don't have to be positive-definite?

Suppose we have a space of symmetric, real matrices, M, with some particular structure. And there is a vector space V (or it could be a subspace of V). Matrices in M may be positive-definite, may be ...
0
votes
0answers
61 views

Connected components $0-1$ matrices [on hold]

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 ...
12
votes
1answer
237 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
30 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 ...
1
vote
0answers
95 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
103 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
votes
0answers
47 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 ...
-2
votes
0answers
29 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
0answers
91 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 ...
6
votes
3answers
471 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 ...
1
vote
1answer
59 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 ...
4
votes
1answer
123 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) = ...
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 ...
1
vote
2answers
137 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 ...
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 = ...
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 ...
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 ...
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 ...
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 ...
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 ...
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$ ...
-3
votes
3answers
292 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
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 ...
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. ...
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
35 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 ...
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}$. ...
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? ...
3
votes
0answers
111 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 ...
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
2answers
264 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 ...
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 ...
6
votes
0answers
167 views

Product $PVPVP$ is elementwise nonnegative?

Let $P\in \mathbb{R}^{n\times n}$ be the inverse of a positive definite M-matrix and $V\in \mathbb{R}^{n\times n}$ be any diagonal matrix. Prove (or disprove) that $PVPVP$ is elementwise nonnegative. ...
5
votes
1answer
191 views

Anti-bidiagonal matrix with main anti-diagonal {1,2,3,…} and first sub-anti-diagonal {-1,-2,-3,…} has eigenvalues lambda={1,-2,3,-4,…}

Consider the anti-bidiagonal matrix $B_6\in\mathbb{R}^{6\times 6}$, defined along its anti-diagonals as follows $$ B_6=\begin{bmatrix} & & & & & 6\\ & & & ...
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 ...
1
vote
1answer
71 views

Expected value of the inverse of a random, truncated Haar matrix

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

How to construct a semi-positive definite matrix in this form: (L=D-A')

As known, the graph Laplacian $L = D - A$ is semi-positive definite. What if there is a matrix $A'$ where $$ A'_{ij} = \begin{cases} A_{ij}, \quad if A_{ij} >0 \\ -\varepsilon, \quad if A_{ij} = ...
3
votes
1answer
140 views

the eigenvalues of a generalized circulant matrix

A $2k\times 2k$ circulant matrix $\ C$ takes the form \begin{align} C= \begin{bmatrix} c_0 & c_{2k-1} & \dots & c_{2} & c_{1} \\ c_{1} & c_0 & c_{2k-1} & & c_{2} ...
0
votes
0answers
38 views

Questions about some special tensor transformation

Suppose tensor $U_{i\alpha\beta}$ with dimension $M*N*N$ satisfy following condition: $$U_{i\beta\alpha}=W^1_{\alpha\alpha'}W^2_{\beta\beta'}U_{i\alpha'\beta'}$$ where $W^1$ and $W^2$ are $N*N$ ...
0
votes
0answers
21 views

Is there effective algorithm for finding “minimal discovery time” for large graphs?

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

Which nonnegative matrices have exact nonnegative matrix factors of smaller dimensionality?

The nonnegative matrix $V = \left( \begin{array}{cc} 1 & 1 \\ 1 & 1 \end{array} \right)$ has nonnegative matrix factors $W = \left( \begin{array}{c} 1 \\ 1 \end{array} \right)$ and $H = ...
2
votes
0answers
66 views

Is there an efficient way to compute the “complete subset regression”?

Background: Let $X \in \mathbb{R}^{N\times K}$ and $y \in \mathbb{R}^{N\times 1}$ be data for a regression problem. The aim is to find $\beta \in \mathbb{R}^{K\times 1}$ such that $X\beta \approx y$ ...
1
vote
0answers
26 views

How to restructure adjacency matrix $A$ from shortest distance matrix $B$ in Network topology inference

An undirected graph with $n$ nodes could be referred to as an adjacency matrix $A$. $A=[a_{ij}]_{n×n}$ with $a_{ij}=a_{ji}=1$ standing for there being an edge between node $i$ and node $j$, and no ...
4
votes
2answers
127 views

The eigenvectors and eigenvalues of matrix geometric mean

This is a follow up question on from How to solve a non-homogeneous quadratic matrix equation?. Given the matrix $G = A(A^{-1}M)^{1/2}=A^{1/2}(A^{-1/2}MA^{-1/2})^{1/2}A^{1/2}$, where $A=-H^{-1}$, ...
4
votes
1answer
118 views

Writing a complex orthogonal matrix as a conjugation by real orthogonal matrices

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 ...
1
vote
1answer
44 views

Partial Constraint of Low Rank Matrix

Suppose $X \in \mathbb{R}^{m \times n}$ is a rank $r$ matrix. Let $\Omega$ be a generic subset of $\in \{1, \ldots, m\} \times \{1, \ldots, n\}$ of cardinality $r(m + n - r)$. Denote by $X_{\Omega}$ ...