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
1answer
13 views

Reorder rows and columns to find as close to block diagonal structure in a non-symmetric sparse matrix

I have a sparse matrix with no apparent structure and am wanting to reorder the rows and columns in such a way that the matrix becomes as close to block diagonal as possible. I am using R and have ...
5
votes
1answer
388 views

Some calculus in the orthogonal group $O(n)$

How can one compute each of the following matrices, explicitly: $$\int_{O(n)} e^{g}dg$$ or $$\int_{O(n)} g^{n}dg \;\;\;\;n\in \mathbb{N} \;\;n>1$$ What is the explicite entries of the resulting ...
0
votes
0answers
23 views

Way to parameterise sparse multi diagonal matrix

I have an NxN matrix S that looks like this: $$ S^{-1} = K^{-1} + \Lambda $$ where N is a multiple of 3, both K and S are positive definite matrices, and Lambda is $$ \Lambda = \begin{bmatrix} x ...
4
votes
0answers
69 views

Can we replace 2-fold cover by n rectangles with 1-fold cover by n rectangles?

Suppose that $n$ rectangles cover every point of their union exactly twice (except for points on their boundaries). Can we partition this union into at most $n$ rectangles? I think it's pretty ...
3
votes
1answer
90 views

Is there a standard notation for off-diagonal transpose?

Given a matrix $A=\begin{pmatrix}a&b\\c&d\end{pmatrix}$, its transpose, obviously, is $A^T=\begin{pmatrix}a&c\\b&d\end{pmatrix}$. But is there a conventional way of notating the matrix ...
3
votes
0answers
75 views

Maximal compact subgroup of SL(2,|H)

The exceptional isomorphism $Spin(5,1)\simeq SL(2,\mathbb{H})$ is well-known, and I can find references that say the maximal compact of $Spin(5,1)$ is $Spin(5) \simeq Sp(2)$. So I know the answer to ...
1
vote
1answer
350 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? [on hold]

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

Finding sparsest solution of a linear system

I want to find the solution with most zero-components for the following problem: $Ax=b$ for $A\in \mathbb{R}^{k\times n}, b \in \mathbb{R}^{k},k<n$, where $x$ is real and has no additional ...
1
vote
0answers
173 views
+50

A (possible) equivalent relation on the space of vector bundles

Edit: According to the essential comment of Alex Degtyarev, we revise the question as follows; Assume that $\alpha$ and $\beta$ are two oriention preserving automorphism of Lie groups $O(n)$ and ...
-3
votes
0answers
37 views

Matrix Algebra reduction [closed]

I am trying to reduce the following: $x$ and $y$ column vectors $y^t$ is the transposed column vector $(I - \frac{1}{(1+ y^t x)} * x y^t) (I + x y^t) = I$ I am stuck at $x y^t * y^t X = x y^t (x ...
5
votes
2answers
235 views

Polynomial identities for mod p matrices

Can there be a polynomial over the field $F_p$ of $p$ elements ($p$ prime) in non-commuting variables $X_1,..., X_r$ such that: 1) $f(A_1,...,A_r)=0$ for every $n \times n$ matrices $A_1,...,A_r$ ...
4
votes
2answers
195 views

An algorithm to compare two representations of a simple Lie algebra?

I have two representations of a simple (complex or real) finite-dimensional Lie algebra $S$, both given in terms of their structure constants on a given basis. the first one is the adjoint ...
3
votes
1answer
76 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
1answer
172 views

Explicit Isomorphism between $Cl(8)$ and $\mathbb{R}(16)$

I am looking for a explicit isomorphism between $Cl(8)$ (Clifford algebra over $\mathbb{R}^8$ with standard Euclidean metric) and $\mathbb{R}(16)$ (algebra of $16\times 16$ matrices over ...
2
votes
1answer
250 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 ...
1
vote
0answers
119 views

Zariski dense subgroups and conjugates

Let $H \leq \mathrm{SL}_3(\mathbb{Z})$ be a finitely generated subgroup which is not Zariski dense, and let $g \in \mathrm{SL}_3(\mathbb{Z})$. Must there be some $a \in \mathrm{SL}_3(\mathbb{Z})$ such ...
6
votes
1answer
205 views

Subadditivity of the square root for matrices

For positive numbers $a$ and $b$ we have the inequality $\sqrt{a+b} \leqslant \sqrt{a} + \sqrt{b}$. Is it true that the same holds if we take $a$ and $b$ to be positive semidefinite matrices? If not, ...
2
votes
2answers
231 views

Solving a matrix equation $X=c \cdot AXA' +I$ with a diagonal corrections

I am now struggling to solve the matrix $X \in R^{n \times n}$ in the following equation: $X=c \cdot AXA' - diag(c \cdot AXA')+ I$, where (1) $A \in R^{n \times n}$ is a given matrix whose element ...
0
votes
0answers
45 views

About bi-stochastic and symmetric matrix

If you have an bi-stochastisc and symmetric matrix, what you can say about the second largest eigenvalue of this matrix? To be more precise, I would like to find upper bounds for it looking for the ...
1
vote
1answer
57 views

Are certain normal matrices circulant? (Part 2)

Let $\mathcal{F}$ denote the family of real normal matrices $A$ such that $ A^TA=\begin{pmatrix} a & b \\ b & \ddots \end{pmatrix}$, for $b>0$. As a user observed in the solution of Part 1 ...
1
vote
1answer
69 views

QR decomposition of matrix [closed]

I have matrix $M = \begin{pmatrix} A & B \\ B^T & 0\end{pmatrix}$, where $A$ is $N\times N$, $B$ is $N\times 2$ and I have $Q$, $R$ such that $A = QR$. What is the fastest way to find $Q'$ and ...
5
votes
2answers
181 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) = ...
0
votes
2answers
68 views

Simple Spectrum of Jacobi matrices

I want to call a matrix a Jacobi matrix (cause there may be different notions of Jacobi matrices) if it is a tridiagonal matrix with positive off-diagonal entries. Now, I read that the spectrum of ...
6
votes
2answers
125 views

Is a normal matrix satisfying $A^TA=…$ circulant?

Let $A=\{a_{ij}\}$ be a normal matrix such that $a_{ij}\geq 0$ with equality iff $i=j$. Suppose that $$ A^TA=\begin{pmatrix} a & b & \cdots & b\\ b & a & \ddots & \vdots\\ ...
4
votes
0answers
51 views

Eigenvalues of Random Regular Bipartite Graphs

I am looking for a way of getting a good estimate of the eigenvalues of random bipartite d-regular graphs. The literature has very precise values the proofs of which are very involved and since I am ...
0
votes
1answer
137 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 ...
0
votes
2answers
62 views

About adding a negative definite rank-1 matrix to a symmetric matrix

If $B$ is a symmetric matrix then how do its eigenvalues compare to the eigenvalues of $B - vv^T$? ( where $v$ is a vector of the same dimension as $B$) I guess that the eigenvalues of $B - vv^T$ ...
0
votes
1answer
125 views

Are these particular kinds of matrices well known?

Given two positive integers $n$ and $a \leq \frac{n}{2}$ consider a $n \times n$ matrix $A$ such that, all the diagonal entries are either $a$ or $a+1$ all the non-zero off-diagonal entries are ...
5
votes
0answers
178 views

Existence of a matrix product from its eigenvalues

Let A and B be two positive definite, real, symmetric matrices. The eigenvalues of A, B and AB, denoted by $\lambda(X)$, obey the relation (from Bhatia): $$ \lambda^\downarrow(A) \cdot ...
1
vote
0answers
29 views

Tools to bound the singular values of a finite sum of random matrices from below?

Matrix Chernoff bounds (see also this arXiv paper) are usually used to give upper bounds on the largest eigenvalue of a finite sum of random matrices. Sometimes it can also be used to give a lower ...
3
votes
2answers
198 views

A natural bijection between the orbit spaces of $p$-nilpotent matrices for varying $p$

Let $k$ be an algebraically closed field of characteristic $p$, call a matrix $X\in\mathfrak{gl}_n(k)$ $p$-nilpotent if $X^p=0$, and let $\mathcal{N}_1=\mathcal{N}_1(\mathfrak{gl}_n(k))$ be the set of ...
1
vote
1answer
133 views

Are there good ways of relating a minor to the full determinant?

Say $A$ is a $(n-1)\times (n-1)$ matrix and we augment it by a $n^{th}$ row and a column and get a $n \times n$ matrix $B$. Is there a nice way to relate $det(B)$ and $det(A)$ and the added row and ...
-1
votes
1answer
69 views

How to show the square root function of a positive semidefinite matrix is differentiable? [closed]

How to show the square root function of a positive semidefinite matrix is differentiable? In this context PSD means symmetric PSD.
2
votes
0answers
65 views

Determinant of the sum of a psd (Kronecker) matrix and a diagonal matrix?

Let $K = K1 \otimes K2$ where $K1$ and $K2$ are positive semidefinite matrices. Let $W$ be a diagonal matrix with positive entries. (Everything is real-valued.) I want to calculate or bound $\det ...
5
votes
1answer
563 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 ...
12
votes
3answers
826 views

How do we show this matrix has full rank?

I met with the following difficulty reading the paper Li, Rong Xiu "The properties of a matrix order column" (1988): Define the matrix $A=(a_{jk})_{n\times n}$, where $$a_{jk}=\begin{cases} ...
5
votes
0answers
243 views

Transforming a binary matrix into triangular form using permutation matrices

I am interested in the complexity of the following problem: Given an $m\times n$ binary matrix $M$, can we permute its rows/columns to obtain a triangular matrix? I am also interested in ...
3
votes
1answer
97 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 ...
1
vote
0answers
53 views

Bounds on smallest Eigenvalue of the Sum of a Standard Laplacian and a Diagonal Matrix

I'm trying to find upper boundaries on the smallest Eigenvalue $\lambda_1$ of $L + E$, where $L$ is a standard Laplacian of an unweighted digraph, with $\lambda_1(L) = 0$ and $E \in \{0,1\}^{n \times ...
0
votes
1answer
513 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. ...
1
vote
1answer
2k views

Matrix Factorization Model [closed]

Hello, While reading the article Matrix Factorization Techniques for Recommender Systems I came across the following description: "Matrix factorization models map both users and items to a joint ...
0
votes
0answers
66 views

The norm of a Finite Hilbert matrix

Let $H$ be an $n\times n$ Hilbert matrix, $$h_{ij}=(i+j-1)^{-1}.$$ The matrix $p$-norm corresponding to the p-norm for vectors is: $\left \| A \right \| _p = \sup \limits _{x \ne 0} \frac{\left ...
7
votes
2answers
396 views

Dimension of incomplete matrix over finite fields.

Hi, Suppose one has an incompletely specified $2^n \times 2^n$ matrix over some fixed finite field $\mathbb{F}_{p^k}$. In fact, one knows that the diagonal entries are zero and all other entries are ...
1
vote
1answer
38 views

Maximizing a certain concave function over a non-convex set

I have been working on a problem which involves maximizing a concave function over a non convex constraint set. The problem is the following $$max. \frac{1}{2}x^TBx\\ s.t.\ x_i(1-x_i)=0,\ \ ...
0
votes
1answer
217 views

Books or references on multidimensional matrix operations [closed]

Have the 2D matrix operations been generalized to n-dimensional matrices? Are there any books that define various operations on multidimensional matrix? I'd like to see operations such as ...
3
votes
0answers
100 views

Copositivity in matrix pencils

Given two square symmetric matrices $A,B$ of the same order, the matrix pencil $P(A,B)$ is the set of linear combinations of $A$ and $B$. Finsler's theorem gives an elegant criterion for $P(A,B)$ to ...
15
votes
0answers
436 views

Noncommutative arithmetic mean geometric mean inequality and symmetric polynomials

While analyzing convergence speed of stochastic-gradient methods for convex optimization problems, Recht et al (2011) posed a tantalizing conjecture. It seems quite tricky, so after having struggled a ...
0
votes
2answers
140 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 ...
4
votes
0answers
79 views

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

--Updated description-- I'm trying to investigate the stability of tensegrity structures, and this question is related to the second order test. Suppose there is a vector space ...
15
votes
2answers
393 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 ...