Questions tagged [matrix-theory]

Matrix theory is the study of matrices as concrete objects, rather than as abstract linear operators between vector spaces (whose study belongs to linear algebra). For instance, this involves matrix factorizations and decompositions, nonnegative matrices and Perron-Frobenius theory, Schur complements, structured and special matrices, matrix functions and equations.

Filter by
Sorted by
Tagged with
5 votes
2 answers
344 views

How expressive is $e^A$ in the sense of universal approximation?

For any real matrix $B\in\mathbb{R}^{n\times n},n\ge 2$ and precision $\varepsilon$, is there a real matrix $A\in\mathbb{R}^{n\times n}$ such that $\|e^A-B\|_F<\varepsilon$? ($F$ refers to ...
li ang Duan's user avatar
5 votes
1 answer
480 views

Isomorphism between the hyperbolic space and the manifold of SPD matrices with constant determinant

I'm studying properties of the manifold of symmetric positive-definite (SPD) matrices and I've learnt about the following connection to the hyperbolic space [1, Section 2.2], $$\mathcal{P}(n) = \...
Călin's user avatar
  • 271
5 votes
1 answer
468 views

Do matrices with only elements along the main and anti-diagonals have a name?

To expand upon the title, I am wondering if there is a specific name for square matrices of the form: $$M = \begin{bmatrix} a_{11} & 0 & \cdots & 0 & \cdots & & 0 & b_{1n} ...
Victoria M's user avatar
5 votes
2 answers
523 views

On the existence of integer square root of a $3 \times 3$ positive definite matrix

As far as I know, a real square matrix $M$ has a real square root if $M$ is positive semidefinite, i.e., if all eigenvalues are nonnegative. And, in fact, its square root is unique. I have read some ...
Pops's user avatar
  • 61
5 votes
2 answers
304 views

Stabilization of the pencil of skew symmetric matrices by the orthogonal group

During my researches I've come across the following question. Let $A$ and $B$ be a couple of square $k\times k$ skew symmetric matrices on $\mathbb R$. Let us consider the (real) pencil generated by $...
user avatar
5 votes
1 answer
375 views

Best orthogonal approximation of rank 1 matrix

Let $X=\lambda_0u_0v_0^T\in\mathbb{R}^{n\times n}$ be a rank 1 matrix where $\lambda_0\in\mathbb{R}$, $u_0,v_0$ are of unit Euclidean norm. What is the solution of the following problem? $$\hat{X}=\...
neverevernever's user avatar
5 votes
1 answer
376 views

almost diagonal Positive semidefinite Matrix

Consider the set $\mathcal{D}_n$ of $n$-dimensional positive semidefinite matrices. A matrix $M\in \mathcal{D}_n$ is called $\epsilon$ diagonal in trace distance if there is a diagonal matrix $D\in \...
gondolf's user avatar
  • 1,493
5 votes
1 answer
2k views

Clebsch–Gordan decomposition for $\mathrm{SU}(2)$, in indices

Let $\pi_m$, $m \geq 0$, be the unitary irreps of $\mathrm{SU}(2)$. The Clebsch–Gordan decomposition then gives that $$ \pi_m \otimes \pi_n = \bigoplus_{k=0}^{\min(m,n)}\pi_{m+n-2k}.$$ But suppose I ...
onamoonlessnight's user avatar
5 votes
1 answer
872 views

LU decomposition for orthogonal or unitary matrices?

Is there any references on LU decomposition for orthogonal or unitary matrices? It seems to me that the diagonal entries of $U$ has some nice structure regarding to the Euler angles of the original ...
Jiyuan Zhang's user avatar
5 votes
1 answer
547 views

Can I assign the term "is eigenvector" and "is eigenmatrix" of matrix $P$ in my specific (infinite-size) case?

Remark: I asked this in MSE, the question got views and votes but seemingly no one had an answer so far. Background: I'm rereading a couple of my exploratory (surely not research-level) math-essays ...
Gottfried Helms's user avatar
5 votes
1 answer
686 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 ...
Nick's user avatar
  • 51
5 votes
2 answers
369 views

Ergodic theory reference for converging sequences of matrices

I have been told that the following is a well known theorem in ergodic theory & have been given the book by Furstenberg as a reference. However, I cannot find such a statement in it. Would anyone ...
Catherine Pfaff's user avatar
5 votes
1 answer
710 views

Row-based iterative algorithms for computing the kernel of a matrix

Suppose $A$ is an $m \times n$ matrix in the form $$A=\begin{pmatrix} — a_1 —\\ — a_2 —\\ \vdots \\ — a_m — \end{pmatrix}$$ where $a_i \in R^n$ is the $i$-th row of $A$. I know that it is possible ...
Kamil Tog's user avatar
5 votes
2 answers
195 views

Coloring in Combinatorial Design Generalizing Latin Square

I have a question about a combinatorial design very similar to a Latin Square, which is arising out of an open problem in graph theory. The design is an $n \times n$ matrix whose entries we want to ...
John Samples's user avatar
5 votes
3 answers
228 views

Determine unknown matrix function of particular form from known points

I encountered the following problem recently in a practical context. Fix $n \ge 1$. Suppose $f$ is an unknown function $\mathbb C ^ {n \times n} \to \mathbb C ^ {n \times n}$ of the form $$ X \mapsto ...
user avatar
5 votes
0 answers
415 views

When is a Hankel matrix invertible?

I would like to have some conditions that render a general Hankel matrix of the form \begin{pmatrix}a_1 & a_2 & a_3 &\cdots & a_n \\ a_2 & a_3 & a_4 & \cdots & a_{n+1} \...
baronbrixius's user avatar
5 votes
0 answers
401 views

On the linear transformation between matrix space

Suppose we have two matrix subspaces, $n\times n$ matrix subspace $S_1$ and $m\times m$ matrix subspace $S_2$. Every element of $S_1$ and $S_2$ is complex symmetric matrix. Suppose there exists ...
gondolf's user avatar
  • 1,493
4 votes
2 answers
310 views

Solving $\text{trace}\left[\left(I + pY\right)^{-1} \left(I - p^{2}Y\right)\right] = 0$ for scalar $p$

For given $n\times n$ real symmetric positive definite matrices $X_{1}, X_{2}$, let $Y := X_{1}^{-1}X_{2}$, and let $I$ be the identity matrix. I would like to solve the following equation for the ...
Abhishek Halder's user avatar
4 votes
3 answers
231 views

Properties of matrix $X=\left[\frac{1}{1-\bar\alpha_i \alpha_j}\right]_{ij}$

Let $\{\alpha_i\}_{i=1}^n$ be complex numbers such that $|\alpha_i|<1$, and consider the following $n\times n$ structured matrix $$ X=\left[\frac{1}{1-\bar\alpha_i \alpha_j}\right]_{ij}. $$ Such ...
Ludwig's user avatar
  • 2,682
4 votes
1 answer
541 views

No arbitrary product of matrices has eigenvalue 1?

Consider the matrix $D$, adjacency matrix of an undirected graph $G$ on $n$ vertices, with the notation that $d_{i,i}=0,\forall i$. The matrices $A_i$ are constructed from Identity matrices, $I_{n*n}$...
Phani Raj's user avatar
  • 143
4 votes
2 answers
611 views

Is Ryser's conjecture on permanent minimizers still open?

Let $A(k,n)$ be the set of $\{0,1\}$ matrices of order $n$ with all their line sums equal to $k$. Conjecture number 5 on the list from Minc's book, attributed to Ryser, says that if $A(k,n)$ ...
Felix Goldberg's user avatar
4 votes
1 answer
440 views

A potential new norm for matrices and Horn's inequalities

I am investigating a function defined in terms of the singular values of matrices. Initially, I simplified the problem by focusing on the eigenvalues of $2 \times 2$ Hermitian, positive-definite ...
Pedro Poitevin's user avatar
4 votes
2 answers
363 views

system of homogeneous matrix equations

Edit: Maybe I should make it clear that by a solution I mean a pair of matrices $(A,B)$ such that the identity below holds for any complex numbers $x,y$. One of my friend asked me the following ...
Qingyun's user avatar
  • 411
4 votes
2 answers
2k views

Probability of a submatrix to be full rank in a N x N Random Matrix of rank m.

Consider a random matrix $\mathbf{A} \in \mathbb{C}^{N \times N}$ of rank $m$ with $m < N$ that follows the Wishart distribution ( http://en.wikipedia.org/wiki/Wishart_distribution ). I have a ...
George's user avatar
  • 43
4 votes
2 answers
401 views

Frobenius normal form of a doubly stochastic matrix

If $A \in M_n(\mathbb{C})$, then $A$ is called reducible if there is a permuation matrix $P$ such that $$ P^\top A P = \begin{bmatrix} A_{11} & A_{12} \\ 0 & A_{22} \end{bmatrix}, $$ in ...
Pietro Paparella's user avatar
4 votes
2 answers
5k views

Estimating a spectral gap

Suppose you have a real positive definite matrix $A$ who eigenvalues are $\lambda_{1} \leq \lambda_{2} \leq \ldots \leq \lambda_{n}$. I am interested in bounding from below $\lambda_{2}-\lambda_{1}$. (...
Felix Goldberg's user avatar
4 votes
1 answer
101 views

Total positivity tests: optimal in the number of minors vs. the computational cost

A real matrix is called totally positive if all of its minors are positive. Of course, to check that a given matrix is totally positive it is not necessary to check all the minors: for example, it ...
Andrei Smolensky's user avatar
4 votes
1 answer
694 views

Generalization of Jordan's Lemma $A^2=B^2=I$ can be 2-block diagonalized

One of Jordan's lemma states that if two orthogonal matrices $A,B$ are such that $A^2=B^2=I$, then they can be co-diagonalized by block of size 2. (the proof is easy, consider $x$ an eigenvector of $A+...
MarcO's user avatar
  • 553
4 votes
1 answer
291 views

What is this matrix decomposition called and does it exist always?

Given a rank $2r$ matrix $M\in\Bbb Q^{n\times n}$ can we find two matrices $M_+\in\Bbb Q_{\geq0}^{n\times n}$ and $M_-\in\Bbb Q_{\geq0}^{n\times n}$ each of rank $r$ such that $M=M_+-M_-$ holds? ...
Turbo's user avatar
  • 13.7k
4 votes
1 answer
443 views

A variant of Specht's Theorem using sum of elements (rather than trace) of complex matrices?

Let us first recall Specht's Theorem. Denote by $\text{Mat}_{\mathbb{C}}(n)$ the set of all $n\times n$ matrices over the complex field $\mathbb{C}$. Let $A$ be a matrix in $\text{Mat}_{\mathbb{C}}(n)$...
Sirolf's user avatar
  • 493
4 votes
1 answer
343 views

A Handbook of Matrix Factorizations

I am looking for a good collection of facts regarding the various types of matrix factorizations, something like a "Handbook of Matrix Factorizations" or a very-thorough review paper. I am hoping for ...
Fixed Point's user avatar
4 votes
1 answer
257 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 ...
J. E. Pascoe's user avatar
  • 1,429
4 votes
1 answer
253 views

Why do these polynomials split almost in the middle?

Start with a palindromic sequence of integers $(a_0, a_1, \ldots, a_{n+1})$, i.e. $a_j=a_{n+1-j}$, and put $a_j:=0$ for $j<0$ and $j>n+1$. You may readily guess that the choice of the binomial ...
Wolfgang's user avatar
  • 13.2k
4 votes
1 answer
623 views

Singular value decomposition of truncated discrete Fourier transform matrix

Let $\mathbf{F}$ be a discrete Fourier transform (DFT) matrix such that \begin{align} F_{m,n}=e^{-j2\pi(m-1)(n-1)/N},\quad m,n=1,\ldots,N. \end{align} What we can say about the singular value ...
Math_Y's user avatar
  • 311
4 votes
1 answer
265 views

Positive system of algebraic integers

Let $\mathbb{A}$ be the ring of algebraic integers. Consider a sequence $(d_i)_{i \in I}$, with $I$ a finite set and $d_i \in \mathbb{A} \cap \mathbb{R}_{\ge 1}$, such that $$d_i d_j = \sum_{k \in I} ...
Sebastien Palcoux's user avatar
4 votes
1 answer
418 views

Is it hard to decide whether a matrix is a square of another matrix?

According to the well-know quadratic residue (QR) theory over integers, we know that it is hard to decide whether a given integer $m\in\mathbb Z_N$ is a quadratic residue (i.e., a square of another ...
Licheng Wang's user avatar
4 votes
1 answer
121 views

How to compute an indefinite generalisation of QR decomposition

Given an arbitrary complex matrix $M$ and real, diagonal but possibly indefinite matrix $\Delta$, the problem is to solve the following system of equations: $$\begin{aligned} M^*\Delta M &= LD^2L^*...
wlad's user avatar
  • 4,843
4 votes
1 answer
7k views

Eigenvalues and eigenvectors of tridiagonal matrices

What can I say about the eigenvalues and eigenvectors of the tridiagonal matrix $T$ given as $T = \begin{pmatrix} a_1 & b_1 \\ c_1 & a_2 & b_2 \\ & c_2 & \ddots & \ddots \\ &...
Guilherme's user avatar
4 votes
1 answer
2k views

Diagonalization of real symmetric matrices with symplectic matrices

Consider the following real symmetric matrix $M=\left[\begin{array}{ccc} A & B\\ B^T & D \end{array}\right]$ Both A and D are real symmetric $n\times n$ matrices. B is a real $n\times n$...
fagd's user avatar
  • 41
4 votes
0 answers
95 views

A question on products of linear combinations of complex matrices

Suppose that $A_1, \dots , A_n, B_1, \dots , B_n \in \Bbb C^{d \times d}$ and that, for every $x \in \mathbb{C}^n$, the following holds $$\left( \sum_i x_i A_i \right) \left( \sum_i x_i A_i \right)^{...
user493645's user avatar
4 votes
0 answers
242 views

Is every stable matrix orthogonally similar to a $D$-skew-symmetric matrix?

Let $\mathrm{diag}(A)$ denote the diagonal matrix with diagonal entries of $A\in\mathbb{R}^{n\times n}$ and let $\succeq$ denote the standard partial order in the cone of (symmetric) positive definite ...
Ludwig's user avatar
  • 2,682
4 votes
0 answers
1k views

Generalizing Autonne-Takagi factorization

Autonne-Takagi factorization (Léon Autonne (1915) and Teiji Takagi (1925)) says that: A complex symmetric matrix can be 'diagonalized' using a unitary matrix: If $A$ is a rank-$n$ complex symmetric ...
wonderich's user avatar
  • 10.3k
4 votes
0 answers
393 views

An upper bound on the Jordan condition number of a matrix

The Jordan condition number of a matrix $A$ is defined to be $\min_{V}\kappa(V)$, where $V$ ranges over complex matrices that satisfy $A = VJV^{-1}$ for $J$ being the unique Jordan normal form matrix ...
Daniel86's user avatar
  • 215
4 votes
0 answers
112 views

Inducing surjections on $GL_n(-)$?

Suppose $A,\,B$ are (possibly noncommutative) rings, and $GL_n(-)$ is the group of invertible $n\times n$ matrices over a given ring. Suppose $f:A\to B$ is surjective, does it necessarily follow that $...
BillScroggs's user avatar
4 votes
0 answers
433 views

A sum of Ramanujan sums

I have the following question about Ramanujan sums. (All vectors and matrices here will be understood to have integer entries.) Let $X_q=\{ (x_1,...,x_R)|1\leq x_i\leq q\} $ and let, for any $R\...
tomos's user avatar
  • 1,166
4 votes
0 answers
2k views

eigenvalues of a symmetric tridiagonal matrix with zero diagonals

I was investigating a problem and came up with the following symmetric tridiagonal matrix (with zero diagonal elements): $$ \left(\begin{array}{cccccc} 0 & a & 0 & \ldots & 0 \\ a &...
Xiao Junhui's user avatar
3 votes
2 answers
235 views

Generating $\mathbf{PGL}_2(\mathbb{Z})$ and $\mathbf{PGL}_2(\mathbb{Q})$

It is well known that $\mathbf{PGL}_2(\mathbb{Z})$ is finitely generated, and that $\mathbf{PGL}_2(\mathbb{Q})$ isn't. My question is: what is a fast, natural way to see these properties without ...
THC's user avatar
  • 4,353
3 votes
2 answers
2k views

matrices whose entries sum to zero

Let $A$ be a non-singular matrix and let $s(A)$ be the sum of its entries. Under which conditions can it be assured that $s(A) \neq 0$? if you like, you can assume that $A$ is symmetric. Here is an ...
Felix Goldberg's user avatar
3 votes
1 answer
538 views

Differentiability of operator norm [closed]

Is there any known results about differentiability properties of the function $\mathbb f:\mathbb R \to\mathbb R,$ $f(t):=\|A+tB\|_{op}$ where $\|.\|_{op}$ denotes the usual operator norm of the ...
A beginner mathmatician's user avatar
3 votes
2 answers
2k views

Generalized Hölder's inequality for operator (subordinate) norms

While perusing the Matrix norms section of Wikipedia, I came across this generalized version of Holder's inequality. $$ \|A\|_2^2 \leq \|A \|_1 \|A \|_\infty\,, $$ where, $$ \|A \|_p = \max_{\|x\|_p ...
GraspIt's user avatar
  • 35

1 2
3
4 5
10