Skip to main content

All Questions

479 questions with no upvoted or accepted answers
Filter by
Sorted by
Tagged with
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
117 views

Sparsest similar matrix

Given a square matrix A (say with complex entries), which is the sparsest matrix which is similar to A? I guess it has to be its Jordan normal form but I am not sure. Remarks: A matrix is sparser ...
Nacho Garcia Marco's user avatar
3 votes
0 answers
244 views

An inequality concerning the solution of a Lyapunov equation

Let $A$ be an Hurwitz stable matrix (i.e. the real part of the eigenvalues of $A$ lie in the left-half plane) and $Q$ be a positive semidefinite matrix ($Q\ge 0$, for short). Let $P>0$ be the ...
Ludwig's user avatar
  • 2,712
3 votes
0 answers
125 views

An eigenvalue of certain family of matrices

Consider the matrices $$M_n=\left[\binom{i}j+\binom{2n+1-i}{j-i}+\binom{2n+1-i}j\right]_{i,j=0}^n.$$ I am convinced and hence would like to ask: Question: Is $0$ an eigenvalue of $M_n$?
T. Amdeberhan's user avatar
3 votes
0 answers
220 views

Simultaneous Congruence of Two Matrices

Could you please let me know an answer to the following question on simultaneous congruence of two matrices. This question came up while trying to handle a system of PDE. QUESTION: Let $A,B\in M_n(...
Tatin's user avatar
  • 895
3 votes
0 answers
629 views

Diagonal elements of Hermitian matrices with given eigenvalues

Given real vectors $d = (d_1, \ldots, d_n)$ and $\lambda = (\lambda_1, \ldots, \lambda_n)$, where I will assume that their coefficients are arranged in non-increasing order, the Schur-Horn theorem ...
Dario's user avatar
  • 31
3 votes
0 answers
104 views

Rank relation to maximum subpermanent and subdeterminant?

Given a $\pm1$ matrix $M$ of rank $r$ let the largest subdeterminant be $d$ and let the largest subpermanent be $p$. Are there relations/bounds that connect $r$, $d$ and $p$? Are there geometric and ...
Turbo's user avatar
  • 13.9k
3 votes
0 answers
189 views

Is there a reasonable way to check intersection of these set of vectors?

Given $a,m,n,t\in\Bbb Z$, with $n=m^t$ and $a$ arbitrary, and given $\mathbb{Z}$-linearly independent vectors $v_1,\dots,v_n\in\Bbb Z^n$, and an arbitrary vector $w\in\Bbb Z^n$, such that $$\langle ...
Turbo's user avatar
  • 13.9k
3 votes
0 answers
420 views

(Expected) Size of smallest singular value of a Vandermonde matrix associated to roots of polynomial

Let $n,H$ two fixed positive integers. Let $P\in\mathbb{Z}[X]$ a monic integral polynomial of height $H$ and degree $n$ taken uniformly at random (i.e. each of the $n$ free coefficients of $P$ is ...
user70925's user avatar
  • 313
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
88 views

Statistical properties from the projection on Hadamard matrix

I am using Hadamard matrix to generate the measurement matrix in compressive sensing for signal acquisition. Consider all the rows except the first row, which consists of all 1's, as a candidate for ...
Amit's user avatar
  • 31
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
220 views

Eigenvalues and eigenvectors of nonsymmetric complex tridiagonal matrix

I wonder if it is possible to find analytically all eigenvalues and eigenvectors of the following $2n \times 2n$ non-symmetric complex tridiagonal matrix $$M = i \begin{pmatrix} 0 & a & 0 &...
V. M. Martinez Alvarez's user avatar
3 votes
0 answers
182 views

Spectral radius of infinite substochastic upper triangular matrix

Let $M$ be a Markov chain on $\{0, 1, 2, \dots\} \cup \{\delta\}$, where $\Pr(i \to j) > 0$ for $i, j \in \mathbb{N}$ only if $j > i$, and $\Pr(\delta \to \delta) = 1$. This represents a birth-...
Kevin's user avatar
  • 131
3 votes
0 answers
298 views

Singular value decomposition of a low rank weak diagonally dominant M-matrix. When is the unitary polar matrix positive semi-definite?

Let $A$ be an $n \times n$, non-symmetric, real, weak diagonally dominant M-Matrix. Its diagonal is strictly positive, its off-diagonal is negative or zero and all its columns sum to zero. $A$ has ...
Astor's user avatar
  • 323
3 votes
0 answers
137 views

Dimension of an algebraic subset

let $K$ be an algebraically closed field with characteristic $0$ and $E=M_n(K)\times K^n\times K^n$. We consider the algebraic set $$F=\{(B,u,v)\in E|u^TB^kv=tr(B^kvu^T)=0,k=0,\cdots,n-1\}.$$ I think ...
loup blanc's user avatar
  • 3,741
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
108 views

How to construct large sets of $m$-dimensional vectors over a finite field such that any $m$ of them are independent?

Let $m\ge 2$ be an integer and $\mathbb{F}$ be a finite field of order $p^k$. I want to construct as many as possible $m$-dimensional vectors $v_1,v_2,\ldots,v_n$ in field $\mathbb{F}$ such that any $...
W. Wang's user avatar
  • 103
3 votes
0 answers
560 views

On a matrix algorithm involving rank-one projections

Let $\{v_i\}_{i=1}^N$ be a set of $n$-dimensional real vectors spanning $\mathbb{R}^n$. Let $p\in [0,1]$ be a rational number and consider the iteration \begin{equation} X_{k+1}=\frac{1}{N}\sum_{i=1}^...
Ludwig's user avatar
  • 2,712
3 votes
0 answers
87 views

When is $\left[\begin{smallmatrix} D_1 & B \\\\ -B^T & D_2 \end{smallmatrix} \right]$ $\mathbb{R}$-diagonalizable?

Is there some block-wise characterization of $\mathbb{R}$-diagonalizability (by similarities) of $$\begin{bmatrix} D_1 & B \\\\ -B^T & D_2 \end{bmatrix},$$ where $D_1$ and $D_2$ are real ...
Vedran Šego'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
0 answers
149 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? ...
Miguel's user avatar
  • 31
3 votes
0 answers
257 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 $$A=V_{1}\...
Richard Zhang's user avatar
3 votes
0 answers
2k views

Bounds on the effect of a matrix product on the Frobenius norm

I was wondering if there was a way to put upper and lower bounds on the Frobenius norm of a matrix product in relation to the Frobenios norm of one of the individual matrices, i.e, $c_1\|A\|_F\le\|AS\...
Duncan Eason's user avatar
3 votes
0 answers
128 views

Reducing $\ell_1$ norm of non-full-rank matrices

I have two matrices ${\bf{X}}_{p\times r}$ and ${\bf{Y}}_{r\times q}$ with $r<\min(p,q)$. Matrix ${\bf Y}$ does not have full row rank (i.e., rank$({\bf Y})<r$). Can I build two new matrices ${\...
Mkl's user avatar
  • 291
3 votes
0 answers
210 views

the annihilator of cokernel in a particular case

Let $A\in Mat(m,n;R)$ for $m\le n$ and $R$ a local ring. Consider the $mn\times(m^2+n^2)$ matrix $A\otimes 1_{nn}\oplus 1_{mm}\otimes A^T$, here $1_{mm}$, $1_{nn}$ are identity matrices. I'd like to ...
Dmitry Kerner's user avatar
3 votes
0 answers
193 views

Method to Generate Random Mutually Orthogonal Unitary Matrices

The title says it all, I'd like to know if such a method exists to generate random mutually orthogonal unitary matrices. If so, any supplementary references would be very much obliged. Thanks again!
Vincent Russo's user avatar
3 votes
0 answers
526 views

Cavalieri's principle and inversion of the Vandermonde matrix

There are many examples on the Web of the use of Cavalieri's principle in determining areas and volumes of 2-D and 3-D geometrical figures. The Wikipedia link uses the principle as both a proof and ...
Tom Copeland's user avatar
  • 10.5k
3 votes
0 answers
2k views

Closed-form solution to a system of linear equations

Consider the following $n \times n$ matrix with a particularly nice structure: \begin{equation}\mathbf{P}=\begin{pmatrix} 0 & 0& \dots&0 & 0 &1\\ 0 & 0& \dots&0 & \...
MthQ's user avatar
  • 41
3 votes
0 answers
466 views

An optimization problem over real symmetric matrices

Given an $n\times s$ matrix $P$ of positive real numbers and $T\geq n$, find (either by a formula or an algorithm) the real symmetric $n\times n$ Z-matrix $A$ which maximizes $\min\limits_{1\leq i<...
Binzhou Xia's user avatar
3 votes
0 answers
125 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 ...
Felix Goldberg's user avatar
3 votes
0 answers
262 views

Matrix-tree for matrices with constant diagonal

I've got a symmetric matrix $A$ whose entries are in $\{0,-1,1\}$, with the diagonal entries all equal to $1$. I'm interested in finding a combinatorial description of the entries of the inverse of $A$...
Felix Goldberg's user avatar
3 votes
0 answers
337 views

when upper triangular matrix modulo prime ideals implies upper triangular?

Let $E/ \mathbb{Q}_p$ be a finite extension, let $\mathcal{O}$ be the ring of integers of $E$. Let $A$ be a reduced noetherian local complete $\mathcal{O}$-algebra with the maximal ideal $\mathfrak{m}$...
Przemyslaw Chojecki's user avatar
3 votes
0 answers
549 views

Canonical forms for block-positive-definite matrices

Suppose we are given a block $2\times 2$ matrix that is positive-definite, and let's suppose for simplicity that the blocks along the main diagonal are the identity. So $$ \begin{bmatrix} I & X \\\...
Laurent Lessard's user avatar
3 votes
0 answers
221 views

Eigenvalues vs.matrix sparsity

For an n X n matrix whose entries are constrained to be in some [x,y], is the maximum absolute eigenvalue of the matrix a function of its sparsity? Is there a closed-form expression that states this ...
Maniacka's user avatar
3 votes
0 answers
1k views

Matrix Operations Preserving Hurwitz Stability

I begin with terminology I use in the question. A real square matrix $A$ is negative-stable if for every eigenvalue $\lambda$ of $A$, ${\mathrm{Re}}(\lambda) < 0$; $\ast$-negative-stable if for ...
Gilles Gnacadja's user avatar
3 votes
0 answers
220 views

Could SVD be used to optimize the partial inner-products?

Suppose a set $N$ of $n$ distinct points in $m-$dimensional space is given in $X\in\mathbb{R}^{n\times m}$. Also, suppose a subset $L\subset N$, $|L|=l<m<n$, with $m-$dimensional coordinates in ...
usero's user avatar
  • 131
3 votes
0 answers
528 views

A question about the generalized Lidskii-Wielandt inequality for matrices proved by Thompson and Freede

In 1971, Thomson and Freede generalized the Lidskii-Wielandt inequalites as follows (version for singular values) Let $A$, $B$ be $n\times n$ Hermitian matrices. Suppose $\alpha_1\geq \alpha_2 \geq \...
user11870's user avatar
  • 227
3 votes
1 answer
791 views

Real part of eigenvalues and Laplacian

I am working on imaging and I am a bit puzzled by the behaviour of this matrix: $$A:=\left( \begin{array}{cccccc} 1 & 0 & 0 & -1 & 0 & 0 \\ 0 & 0 & 0 & 0 & -1 &...
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
67 views

Preserving invertibility with adding rows

Suppose I have two $m\times n$ matrices $A$ and $B$ such that an $m\times m$ submatrix of $A$ is invertible if and only if the corresponding $m \times m$ submatrix of $B$ is. Now let's say I append a ...
Kevin S.'s user avatar
2 votes
0 answers
160 views

An "almost" true inequality for Hermitian matrices

Let $A$ be an $N\times N$ Hermitian matrix. For $p+q$ even, consider the following inequality: $$\frac{1}{N}\sum_{i=1}^N (A^p)_{ii} (A^q)_{ii} \geq \Big(\frac{1}{N}\sum_{i=1}^N (A^p)_{ii} \Big) \Big(\...
WunderNatur's user avatar
2 votes
0 answers
78 views

Partitions of bent vectors

Let $H=\frac{1}{\sqrt{2}}\begin{bmatrix}1 & 1 \\ 1 & -1\end{bmatrix}.$ Let $A^{\otimes N}$ denote the tensor product of the matrix $A$ with itself taken $N$ times. We say that a vector $v$ of ...
Joseph Van Name's user avatar
2 votes
1 answer
200 views

Upper bound for the rank of a Gram-type matrix

Let $V = (v_{1},...,v_{N})$ and $W = (w_{1},...,w_{N})$ be 2 sets, each containing $N$ vectors from $\mathbb{R}^{n}$; i.e, $v_{j}, w_{j} \in \mathbb{R}^{n}$ for all $1 \leq j \leq N$. Assume that $N$ ...
Tomer Milo's user avatar
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
90 views

decidability special case of column generation problem

I have the following problem: Input: sub-spaces $V_1, \dots, V_d$ of $\mathbb{Z}^{d}$ Question: are there $v_i \in V_i$ such that the matrix $(v_1, \dots, v_d)$ has determinant $\pm 1$ (equivalently, ...
Armin Weiß's user avatar
2 votes
0 answers
97 views

How to decompose a matrix over a ring $F[X_1,\ldots,X_k]$ as a product of two matrices

Let $F$ be a field. Assume any reasonable conditions if needed, such as $F=\mathbb R$, $F=\mathbb C$, $F$ is a finite field, or $F$ has a specific characteristic, etc. Let $C$ be an $n\times1$ matrix ...
zxcv's user avatar
  • 131
2 votes
0 answers
88 views

Nuclear norm minimization of convolution matrix (circular matrix) with fast Fourier transform

I am reading a paper Recovery of Future Data via Convolution Nuclear Norm Minimization. Here, I know there is a definition for convolution matrix. Given any vector $\boldsymbol{x}=(x_1,x_2,\ldots,x_n)^...
Xinyu Chen's user avatar
2 votes
0 answers
233 views

Do you know this formula for the scalar product in barycentric coordinates?

I've found a formula for a scalar product in barycentric coordinates which I think is pretty cool. I hope that it's new. Is it? Suppose that you have points $x_1,\dots,x_n$ sitting in general position ...
Vladimir Zolotov's user avatar
2 votes
0 answers
107 views

Gradient of QZ decomposition

Let $A$ and $B$ be an $m \times n$ matrix of rank $ k_1 \le \min(m,n) $ and $ k_2 \le \min(m,n) $. Then the QZ decomposition or the generalized Schur decomposition is $A = USV^T$ and $B = UTV^T $, ...
newbie's user avatar
  • 61

1 2 3
4
5
10