Skip to main content

All Questions

Tagged with
86 questions with no upvoted or accepted answers
Filter by
Sorted by
Tagged with
32 votes
0 answers
649 views

Existence of orthogonal basis of symmetric $n\times n$ matrices, where each matrix is unitary?

For a positive integer $n$, let $S_n$ denote the set of $n\times n$ symmetric matrices over $\mathbb{C}$. As a complex vector space, this set has dimension $\mathrm{dim}(S_n)=\binom{n+1}{2}$. The ...
Mark Girard's user avatar
23 votes
0 answers
8k views

An $n \times n$ matrix $A$ is similar to its transpose $A^{\top}$: elementary proof?

A famous result in linear algebra is the following. An $n \times n$ matrix $A$ over a field $\mathbb{F}$ is similar to its transpose $A^T$. I know one proof using the Smith Normal Form (SNF). ...
Sungjin Kim's user avatar
  • 3,320
12 votes
2 answers
800 views

A (linear) optimization problem subject to (linear) matrix inequality constraints

Let $A \in \mathbb{R}^{n \times n}$ be a Hurwitz matrix, i.e. $A$ satisfies $\mathrm{Re}\,\lambda_i< 0$, where $\{\lambda_i\}_{i=1}^n$ is the set of eigenvalues of $A$. Suppose that the trace of $A$...
Ludwig's user avatar
  • 2,712
10 votes
0 answers
230 views

Matrix identities in two variables

The famous Amitsur-Levitzki Theorem states that the algebra $M_n(\mathbb C)$ satisfies no polynomial identity of degree less than $2n$ and it satisfies $$p(x_1,\dots,x_{2n}) = \sum_{\sigma \in \frak ...
Andreas Thom's user avatar
  • 25.5k
7 votes
0 answers
131 views

Approximation of a continuous curve on commuting matrices

I have a continuous curve $A:\mathbf{R}_+\rightarrow \text{M}_N(\mathbf{R})$ such that $[A(t),A(s)] \operatorname*{\longrightarrow}_{t,s\rightarrow +\infty} 0$, where $[A(t),A(s)] = A(t)A(s)-A(s)A(t)$....
Ayman Moussa's user avatar
  • 3,425
6 votes
0 answers
111 views

Factorization to sparse matrices

$\newcommand{\lrank}{\operatorname{lrank}}$ $\newcommand{\rank}{\operatorname{rank}}$ Given a matrix $A$, we can define its Hamming weight, $w(A)$, as the number of non-zero elements in it. Now, given ...
Daniel Weber's user avatar
  • 3,319
6 votes
0 answers
99 views

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

Given a rank $2r$ matrix $M\in\Bbb Q_{\geq0}^{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 at most $r$ such that $M=M_+-...
Turbo's user avatar
  • 13.9k
6 votes
0 answers
514 views

concentration for eigenvectors

I am interested in bounding from above the ratio between the maximum and minimum entries of a Perron vector. The only results that I found in the literature are from the classic masters (Ostrowski and ...
Felix Goldberg's user avatar
5 votes
0 answers
435 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
4 votes
0 answers
98 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
249 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,712
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.5k
4 votes
0 answers
435 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
  • 225
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
437 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,381
3 votes
0 answers
142 views

Solvability of a matrix exponential equation - generalized matrix logarithm

For a given invertible real matrix $G\in \mathrm{GL}_d$ with $\det G>0$, we ask for a solution $B$ of the matrix exponential equation $$ G = \exp(B) \exp\bigl(\tfrac{1}{2}(B^T-B)\bigr) . $$ Basic ...
André Schlichting's user avatar
3 votes
0 answers
255 views

Homotopicity of $a\mapsto a\otimes 1$ and $a \mapsto 1\otimes a$ as morphisms from $A$ to $A\otimes A$

let $A$ be a $C^*$ algebra. We equip $A\otimes A$ with the spatial norm. Assume that two morphisms $a\mapsto a\otimes 1$ and $a \mapsto 1\otimes a$ are homotopic morphisms, i.e, there is a curve $\...
Ali Taghavi's user avatar
3 votes
0 answers
359 views

Do we know what the impulse to "introduce" the Jordan canonical form was?

Mo-ers, Do you know how it was that the study of the Jordan canonical form began? There are certain things that may be said once one has thought about the matter: for instance, one can say that the ...
Jamai-Con's user avatar
3 votes
0 answers
122 views

Algebra of block matrices with scalar diagonals

I am interested in block matrices $A$, that is $A\in M_{n\times n}(R)$ where $R=M_{s\times s}(k)$ and $k$ is a field, such that for every positive integer $m$ the matrix $A^m$ has only scalar blocks ...
Adam Przeździecki's user avatar
3 votes
0 answers
65 views

How to show that a continuous family of symmetric matrices is uniformly positive?

My problem : I have a family of $4 \times 4$ symmetric matrices. More precisely consider an interger $d$, a real $\lambda> 0$ and define the family $S_{\lambda}$: $ \{A(\lambda,x_1,x_2) ; (x_1,...
YZ22's user avatar
  • 31
3 votes
0 answers
178 views

On a matrix inequality based on the Schur-Horn theorem

Let $A\in\mathbb{R}^{n\times n}$ be a diagonalizable matrix with real and (strictly) positive eigenvalues. (Notice that $A$ is not required to be symmetric.) Let $A_s$ denote the symmetric part of $A$...
Ludwig's user avatar
  • 2,712
3 votes
0 answers
1k views

Eigenvalues of block-hermitian matrices with zero diagonal blocks

I have a matrix of the form $$D = \left( \begin{array}{cc} 0 & C \\ C^{\dagger} & 0 \end{array} \right)$$ where $C$ is not necessarily hermitian. In general, can we say anything about the ...
Unwieldy Bob's user avatar
3 votes
0 answers
56 views

Equivalence Classes of a Subgroup of Similarity Transformations

Let $X$ be a real, finite-dimensional vector space and $A, B, C,$ and $D$ be matrices on $X$. I'm interested in the similarity classes of the block matrices $$ \begin{bmatrix} A & B\\ C & D\\ ...
JMJ's user avatar
  • 263
3 votes
0 answers
481 views

"Natural" ways of interpolating unitary matrices

Given two unitary matrices $A$ and $B$, that are "near" each other in some sense (perhaps $\left\lVert A-B\right\rVert <\epsilon$ for some norm, what are some sensible ways to interpolate between ...
Victor Liu's user avatar
3 votes
0 answers
70 views

Condition number after some "non standard" transform

Given a positive definite matrix $A$, and a diagonal matrix $B$ with positive diagonal entries, is the following inequality generally true? $$\kappa((A + B)(I + B)^{-1}) \leq \kappa(A)$$ $I$ is an ...
randomprojection's user avatar
3 votes
0 answers
611 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 $F^{...
lovewinter's user avatar
3 votes
1 answer
740 views

Finding an adjacency matrix whose cube's diagonal is equal to a given vector

How can I find all binary matrices $A$ such that $A^3$ is a non-negative, integer square matrix and $$\mbox{diag}\left(A^3\right)=b$$ for some given vector $b$? Is there a way to characterize all ...
Student88's user avatar
  • 503
2 votes
0 answers
72 views

Gradient descent over the set of complex symmetric matrices

In the course of my research (somewhat related to compressive sensing), I am trying to determine a complex, symmetric matrix $L$ (i.e. $L = L^T$) through the following optimization formulation: $$ \...
Shreyas B.'s user avatar
2 votes
0 answers
146 views

What are the name and inverse of an interesting integer matrix?

It is practicable to compute the matrix inverses \begin{align*} \begin{pmatrix} 1 & 0 & 0 \\ 1 & 1 & 1 \\ 1 & 2 & 2^2 \\ \end{pmatrix}^{-1} &=\begin{pmatrix} 1 & 0 &...
qifeng618's user avatar
  • 1,091
2 votes
0 answers
137 views

Decompose a rational matrix as an integer matrix and an inverse of integer matrix

Suppose we have a non-singular rational matrix $Q$, consider the the $\mathbb{Z}$-span of the columns of $Q$ and $Q^{-1}$, denote it as $H = {\rm Span}_{\mathbb Z} \{ Q(\mathbb Z^{n}), Q^{-1}(\...
ghc1997's user avatar
  • 823
2 votes
0 answers
502 views

Finding a basis for the range of a linear function

I realize this question is not high level but I have posted it on Math Stackexchange: Stackexchange question and have received some upvotes but no answers or comments, so I am trying here. I will need ...
Math101's user avatar
  • 121
2 votes
0 answers
112 views

Product of two involutions in $\mathrm{PSL}_2(D)$

Let $D$ be a division ring and $\mathrm{PSL}_2(D)$. Suppose that $\overline{A}\in\mathrm{PSL}_2(D)$ where $A\in \mathrm{SL}_2(D)$. If $\overline{A}$ is identity, then $\overline{A}$ can express two ...
Tran Nam Son's user avatar
2 votes
0 answers
176 views

System of matrix equations

Problem definition: Let $x_i \in \mathbb{R}^d$ and $a_i \in [0,1]$, for all $i = 1,\dots, k$ (with $k\geq d$). Define $M(a) = \sum_{i = 1}^k a_i x_ix_i^T,$ and assume $M(a) \succ 0.$ Question: Is ...
Apprentice's user avatar
2 votes
0 answers
99 views

When does a matrix subspace contain a full rank matrix?

Cross-posted at Math SE Let $S\subseteq M_{n,m}(\mathbb{C})$ be a $d$-dimensional subspace of the space of $n\times m$ complex matrices (with $n\leq m$, say). I am interested in figuring out ...
mathwizard's user avatar
2 votes
0 answers
55 views

Does there always exist a(n uniform) polynomial that makes a positive definite symmetric matrix with polynomial entries into a sum of squares?

Suppose that I have a square and positive definite for every evaluation $x\in\mathbb{R}^{n}$ symmetric matrix $M(x)\in(\mathbb{R}[x])^{s\times s}.$ Does there always exist a polynomial $p(x)\in\...
Hvjurthuk's user avatar
  • 573
2 votes
0 answers
226 views

Which matrix decompositions feature permutation matrices?

It's well known that LU decomposition is only numerically stable if it's combined with row and/or column pivoting. It makes me wonder if there are other matrix decompositions that can profitably be ...
wlad's user avatar
  • 4,943
2 votes
0 answers
172 views

Minimum of $\mathrm{rank}\left( \boldsymbol{W} \boldsymbol{H} \right)$, with $\boldsymbol{W}$ block diagonal

Let us assume that we have a full-rank $(n\cdot l)\times k$ matrix, $\boldsymbol{H}$, with no specific structure (e.g., a realization of a Gaussian i.i.d. random matrix), and an $m\times (n\cdot l)$ ...
Juan's user avatar
  • 61
2 votes
2 answers
2k views

How to compute inverse of sum of a unitary matrix and a full rank diagonal matrix?

$C = A+D$, $A$ being a unitary matrix and $D$ a full rank diagonal matrix. Is there any easy way to compute $C^{-1}$ from $A^{-1}$ and $D$, if it exists? I am interested in this question, because my ...
Rajesh D's user avatar
  • 698
2 votes
0 answers
248 views

A parametrization of stable matrices

Let $A\in\mathbb{R}^{n\times n}$ be a diagonalizable matrix with real and strictly negative eigenvalues. Furthermore, suppose that $\mathrm{tr}(A)=-1$. My question. I'm wondering whether it is ...
Ludwig's user avatar
  • 2,712
2 votes
0 answers
79 views

Characterizing a subclass of row-orthogonal matrices

Let $O\in\mathbb{R}^{n\times m}$, $m>n$, be such that $O O^\top =I_n$. (Here $\bullet^\top$ denotes transposition and $I_n$ the $n\times n$ identity matrix.) Consider the following partition of $O$,...
Ludwig's user avatar
  • 2,712
2 votes
0 answers
122 views

Number of distinct rows and columns in a matrix with bounded number of entries

How many distinct rows and columns a real square matrix can have (at least in symmetric case) such that rank of matrix is $r$ and entries: are from $\{-b,-b+1,\dots,0,\dots,b-1,b\}$? are from $\{-b,-...
Turbo's user avatar
  • 13.9k
2 votes
0 answers
171 views

Bounding the distance between two matrix power sequences

Let $A,B$ be Hermitian matrices so that $0 \le A,B < I$ and also $(1-\varepsilon)(I-B)\le I - A \le (1+\varepsilon)(I-B)$. For every $t \in \mathbb{N}$, consider the matrix $A_{t} = \sum_{i=0}^{t}...
Daniel86's user avatar
  • 225
2 votes
0 answers
167 views

Lower bound for the sum of cosines between singular vectors of diagonally dominant matrices

Let $A \in \mathbb{R}^{n \times n}$ be a nonsymmetric diagonally dominant matrix with $a_{ij} < 0$ $\forall i \ne j$ and $a_{ii}>0$. Let the singular value decomposition of $A$ be $A=U \Sigma V^...
Astor's user avatar
  • 323
2 votes
0 answers
411 views

Bound on eigenvalues of A+B (Hermitan matrices) which is better that the Lidskii and Weyl bounds

I have two positive definite $N\times N$ Hermitian matrices $A$ and $A$ and am interested in bounding the eigenvalues of $A+B$ in terms of the eigenvalues of $A$ and $B$. Let $\lambda_k(\cdot)$ be ...
Tom Steiglitz's user avatar
2 votes
0 answers
677 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 ...
Flav Monty's user avatar
2 votes
0 answers
132 views

Characterizing the singular values of a matrix with structure

Suppose we have a function from $\mathbb{R}^2\to\mathbb{C}$, $$f(x,y) = e^{\imath\pi x g(y)}$$ where $g(y)$ is periodic in $y\in[-T, T),\ T<\infty$ (e.g., a sinusoid) and $0\leq x < \infty$ ...
jqka's user avatar
  • 21
1 vote
0 answers
45 views

Rank of Hadamard product of column-wise polynomial evaluations and row-wise exponential evaluations

Consider the Hadamard product $A \odot B$ between two special matrices $A,B \in \mathbb{R}^{n \times m}$. The columns of $A$ are evaluations of polynomials, while the rows of $B$ are evaluations of ...
user31127's user avatar
1 vote
0 answers
21 views

Correlation Matrix Problem of Three Decomposition Level of DWT

I'm trying to apply a DWT with 3 composition levels and the following question arose when calculating the composition matrix. The step I'm trying to follow is: The DWT coefficientes are obtained from ...
Dragnovith's user avatar
1 vote
0 answers
255 views

Interpreting positive semidefinite matrix as a graph

Given any symmetric matrix $S \in \mathbb{R}^{n \times n}$, if $S \succeq 0$, is there a way to encode $S$ into a graph such that it takes into account the positive semidefinite constraint, and ...
patchouli's user avatar
  • 275
1 vote
0 answers
154 views

Some kind of product of two 2d tensors to create a 3d tensor?

I recently need to apply the following concept of product of two 2d tensors to create a 3d tensor (tensors understood as generalized arrays): given two 2d tensors $A_{m\times n}$ and $B_{n\times p}$, ...
Min Wu's user avatar
  • 461