All Questions
Tagged with matrices linear-algebra
1,683 questions
3
votes
1
answer
264
views
When is this matrix singular?
Consider matrix $A$ with $(j,k)$′th entry $A_{j,k}=\sin(\omega_j t_k+\phi_j),\,\forall j,k\in\{1,2,...,n\}$, where $\omega_j,t_k,\phi_j\in \mathbf R$.
1) For $t_k=k$, what is the condition on $\...
1
vote
0
answers
214
views
range of the difference-of-two-qubit-$4 \times 4$-density-matrix-determinants
The determinant of a two-qubit $4 \times 4$ density matrix--that is, a Hermitian, nonnegative definite matrix with unit trace--lies between $0$ and $(\frac{1}{2})^8$. (A "pure state" has determinant ...
7
votes
1
answer
355
views
Injectivity of matrix "fingerprint"
Consider $S$, the set of all $n\times m$ real matrices with specified row sums $(r_1,...,r_n)$, column sums $(c_1,...,c_m)$, and strictly positive entries.
For any matrix $A$, define
$$ D_A(i,j)=\...
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 & \...
13
votes
2
answers
912
views
Almost Hadamard matrices
As well-known, a Hadamard matrix is a square matrix with all coefficients $\pm 1$
and pairwise orthogonal rows or columns. Such matrices exist conjecturally
in every dimension divisible by $4$. Call ...
4
votes
1
answer
630
views
Can sparse matrices satisfy the Null Space Property?
Definition A matrix $A \in \mathbb{C}^{m \times N}$ with $m < N$ satisfies the Null Space Property (NSP) of order $s$ if
$$\|x_S\|_1 < \|x_{\bar{S}}\|_1, \quad \forall x \in \ker A \setminus \{...
2
votes
0
answers
1k
views
Incoherence of the row/column span
Due to V.Chandrasekaran., et al (p.11) : In general for any $k$-dimensional subspace of $A_{n×n}$ we have that:
$$\sqrt{(k/n)} \leq incoherence(A)\leq 1$$
where the lower bound is achieved (for ...
14
votes
4
answers
3k
views
Eigenvectors of a particular transition matrix
I am considering a Markov chain with $n$ states with a particularly nice structure. The transition matrix is as follows:
\begin{equation}\mathbf{P}=\begin{pmatrix}
0 & 0& \dots&0 & 0 &...
-1
votes
1
answer
2k
views
Inequality between two matrices
Given a full rank $n \times m$ matrix $K$ with $m<n$ and an invertible symmetric matrix $J$. Let $A$ be a symmetric positive semi-definite $n \times n$ matrix such that
\begin{equation}
(K^T K)^{-...
6
votes
1
answer
3k
views
Eigenvalues of generalized Vandermonde matrices
Given a strictly increasing sequence $0<x_1<x_2<\dots<x_n$ of $n$ strictly positive real numbers and a second strictly increasing sequence $e_1<\dots e_n$
of $n$ real numbers, the ...
13
votes
2
answers
1k
views
Determinant of $V^* V$ where $V$ is rectangular Vandermonde matrix with nodes on unit circle
Let $z_{1},\dots,z_{k}$
be distinct complex numbers with $\left|z_{j}\right|=1,\;j=1,\dots,k$. For any natural $N\geqslant k$
consider the rectangular Vandermonde matrix
$$
V_{N}=\begin{pmatrix}1 &...
0
votes
1
answer
203
views
Eigenvalues of a given parametrized matrix.
Let $\mathbf{A}$ and $\mathbf{B}$ be two complex rank-one $N\times N$ positive semi-definite matrices. Let the matrix $\mathbf{C}$ be defined as
\begin{align}
\mathbf{C}=\left(\mathbf{I}*\frac{1}{\...
1
vote
0
answers
305
views
how to find all the solutions to $I+A+\cdots+A^n=0.$ [closed]
Let $GL_3(\mathbb{Z}[i])$ be the group of invertible $3\times 3$ matrices whose coefficients are Gaussian integers.I want to find all the pair $(A\in GL_3(\mathbb{Z}[i]),n\in\mathbb{Z})$ satisfying
$$...
3
votes
3
answers
1k
views
Applications of rank factorization or full rank decomposition [closed]
I am teaching a course on linear algebra and came to this theorem: every $m \times n$ matrix $A$ with rank $r$ admits a factorization $A = CR$ where $C$ is an $m \times r$ matrix and $R$ is an $r \...
4
votes
1
answer
189
views
Weak ergodicity of nonhomogenous products of 0-1 matrices
Here is a question which probably has a negative answer, but I couldn't find any literature directly on it.
Let $(A_n)$ be a sequence of rectangular 0-1 matrices (that is, the entries are restricted ...
11
votes
2
answers
821
views
Determinant and eigenvalues of a specific matrix
This came up in a conversation with an engineer friend of mine.
Let $c>0$ be a constant. Let $A_{ij}$ be an $n$ by $n$ matrix with entries
$$
A_{ij} = e^{-c(i-j)^2}.
$$
Is there a name for this ...
3
votes
2
answers
367
views
norm of the matrix series
The goal is to obtain an upper bound for the norm of the vector
$$
\left\|\sum\limits_{k=0}^{\infty}(I−A)^kAw_k\right\|
$$
for any symmetric matrix $A\in{\mathbb R}^{n×n}$ which $0\preceq A\preceq I$ ...
0
votes
1
answer
268
views
Nonnegative Matrix
Let $A=E+\sqrt{-1}B$, where $E=diag\{0,1,\cdots,1\}$, $B$ is a real symmetric matrix. Let $A^*$ denote the adjoint matrix of $A$, i.e. $AA^*=\det A\cdot I$. I hope the real part of adjoint matrix ${\...
9
votes
1
answer
598
views
Trouble with Jordan form of the truncated Carleman-matrix for $\sin(x)$ as size $n$ goes to infinity
I'm currently trying to get familiar with the Jordan normal form for matrices; and after some example I ask for the possible Jordan-form for the Carleman matrix for the function $f(x) = \sin(x)$ when ...
2
votes
1
answer
1k
views
Form of a block upper triangular matrix of finite order
If I take a diagonalizable block upper triangular matrix whose diagonal blocks are of finite order, is it true that away from the leading block diagonal, the matrix is zero?
I think the statement is ...
2
votes
2
answers
824
views
Designing almost orthogonal vectors in a deterministic manner
Consider the vector space $\mathbb{R}^n$, the standard inner product $\langle \cdot,\cdot \rangle:\mathbb{R}^n\times\mathbb{R}^n\rightarrow \mathbb{R}$, and some $0<\epsilon\leq \frac{1}{\sqrt{n}}$....
2
votes
0
answers
529
views
Inverting a matrix with entries equal to positive or negative infinity
I would like to define an inverse on matrices whose entries may be positive or negative infinity.
To formulate my problem precisely, suppose that I have a matrix $A$ and another matrix $B$. How do I ...
3
votes
3
answers
1k
views
Are the finite dimensional von Neumann algebras, singly generated?
Let $\mathcal{M}$ be a finite dimensional von Neumann algebra, then :
$$\mathcal{M} \simeq \bigoplus_i M_{n_i}(\mathbb{C})$$
Question : Is it singly generated (as von Neumann algebra)? how ?
...
3
votes
1
answer
494
views
A question on Grassmannian
Let $V$ be the space of $4$ by $4$ Hermitian matrices, that
is a vector space of dimension $16$ over $\mathbb{R}$. Is the uniform
measure of
$$
\left\{ W\in Gr\left(5,V\right):W \text{contains no ...
3
votes
1
answer
965
views
A submanifold of the space positive definite matrices
Consider the space of $n \times n$ positive definite symmetric matrices and let $\Sigma$ be one such matrix. We make this space into a Riemannian manifold $M$ by means of the metric $$ds^2=tr(\Sigma^{-...
8
votes
1
answer
541
views
A question on eigenvalues
Let $A_{1}$, $A_{2}$, $A_{3}$, $A_{4}$, $A_{5}$ be linearly independent Hermitian matrices in the the space of $6$ by $6$ Hermitian matrices as a vector space over $\mathbb{R}$. Does there always ...
5
votes
1
answer
419
views
Which positive definite symmetric matrices have solvable characteristic polynomial?
I am interested in the structure of the space of $n \times n$ positive definite symmetric matrices with rational entries whose characteristic polynomials are solvable (i.e. the Galois group is ...
2
votes
2
answers
765
views
Why eigenvectors optimize this orthogonally constrained nonlinear minimization problem?
Given a $p \times p$ positive definite matrix $\Sigma$, why eigenvectors of $\Sigma$, stacked as columns of a matrix $R \equiv [r_1 \, r_2 \, \ldots \, r_p]$, optimize the following orthogonally ...
9
votes
1
answer
3k
views
Frobenius-Perron eigenvalue and eigenvector of sum of two matrices
Suppose that I have two positive matrices, $A$, and $B$, and I know their Frobenius-Perron eigenvalues ($\lambda_A$, $\lambda_B$) and eigenvectors ($v_A$, $v_B$). I'm interested in what I can say ...
5
votes
2
answers
480
views
Decomposition of a semi-definite matrix into sums of sparse semi-definite matrices
I'll first provide the background.
Let $x\in\mathbb{R}^N$ be decomposed into $n$ non-overlapping blocks of variables
$x^{(1)},\ldots,x^{(n)}$.
We say that $f:\mathbb{R}^N\rightarrow\mathbb{R}$ is ...
6
votes
1
answer
305
views
For a set of matrices $S$, find $X$ such that the elements of $SX$ commute
Let $S := \{A_0, A_1, \dots, A_d\}$, where $A_k \in \mathbb{C}^{n \times n}$, be a set of (generally noncommuting) matrices. I am interested in finding a nonsingular $X \in \mathbb{C}^{n \times n}$ ...
2
votes
1
answer
1k
views
Updating $LU$ decomposition after adding a sparse matrix
How many elements of $LU$ decomposition of a symmetric matrix change after adding a sparse symmetric matrix? Is it more efficient to recompute $LU$ decomposition after adding a sparse matrix comparing ...
2
votes
0
answers
130
views
A - B is semidefinite, what the relationship about their eigenvalues? [closed]
$A, B$ are two symmetric matrices, if $ A-B $ is semidefinite (i.e.$ A - B \geq 0$), if we rearrange the eigenvalues of two matrices, $\lambda_1 (A) \geq \lambda_2 (A) \geq ... \geq \lambda_n (A)$, ...
19
votes
4
answers
7k
views
Sherman-Morrison type formula for Moore-Penrose pseudoinverse
Given an $n\times n$ invertible matrix $\mathbf A$ and two column vectors $\mathbf u$, $\mathbf v\in\mathbb R^n$, suppose that $1 + {\mathbf v}^T {\mathbf A}^{-1}\mathbf u \neq 0$.
Then the Sherman-...
0
votes
0
answers
704
views
expected matrix inverse of circulant plus diagonal matrix with chi-square variables
Let $R$ be a semi-definite $N\times N$ circulant Toeplitz matrix and let $N\to \infty$.
Let $D$ be an $N\times N$ diagonal matrix where the elements on the main diagonal are independent chi-square ...
7
votes
3
answers
2k
views
Optimization problem on trace of rotated positive definite matrices
Given two $n \times n$ symmetric positive definite matrices $A$ and $B$, I am interested in solving the following optimization problem over $n \times n$ unitary matrices $R$:
$$
\mathrm{arg}\max_R \,\...
2
votes
1
answer
359
views
Dimension independent computational complexity of singular value decomposition
Suppose $X$ is a $m \times n$ real matrix, which has only $k$ number of nonzero elements ($k \ll mn$).
Given a vector $y$, the sparsity of $X$ allows $X y$ to be computed in $O(k)$ time
which is ...
7
votes
2
answers
2k
views
Powers of singular matrices and pairs of identical rows
Let $A$ be a square real or complex matrix. We’ll call $A$ special if among its rows (or among its columns) there are two identical ones, different from the zero vector, (Added:) and if it has no ...
15
votes
3
answers
24k
views
How to solve this quadratic matrix equation?
I would like to solve for $X$ in the matrix equation
$$
XCX + AX = I
$$
where all the matrices are $n\times n$, have real components, $X$ is positive semidefinite and $C$ is symmetric. My (possibly ...
7
votes
0
answers
384
views
Concept of eigenvector restricted to nonnegative entries
Let $X\in \mathbb{R}^{n\times n}$ be a positive semidefinite matrix. The leading eigenvector $v\in \mathbb{R}^n$ of $X$ is the solution to the problem
$\arg \max_{v:\lVert v\rVert_2=1} \lambda\quad$ ...
3
votes
1
answer
2k
views
Fast algorithm for maximizing smallest eigenvalue of linear combination of hermitian matrices
I have an engineering back ground. Due to work, I came across this problem
\begin{align}
&\max_{\lambda,y_i\in \mathbb{R}}~\lambda \\\
s.t.~&\left(\mathbf{A}_0+\sum_{i=1}^{K}y_i\mathbf{A}_i\...
2
votes
1
answer
474
views
When is there a solution to these coupled eigenvalue equations?
I am trying to find the fixed point of a dynamical system, which requires solving two coupled eigenvalue-like equations. These equations are, in general, overconstrained. I'd like to have a simple ...
21
votes
4
answers
9k
views
Condition for two matrices to share at least one eigenvector?
Suppose that I have two matrices $A$ and $B$, and I want them to share a common eigenvector $x$. For simplicity let's just assume that the eigenvalue associated with $x$ is $1$ for both matrices, so $...
7
votes
2
answers
605
views
Sum of Difference of anti-diagonal matrix elements
Let $A \in \mathbb{R}^{n \times n}$, with elements $a_{ij}$
What conditions on $A$ are required for the following to be true?
There exists some vector $x \in \mathbb{R}^n_+$, $x \neq 0$ such that ...
3
votes
1
answer
138
views
On matrices conjugated in a faithful representation
Let $k$ an algebraically closed field.
Let $O=k[[\pi]]$ and $F=k((\pi))$ and $G\rightarrow GL_{n}$ a faithful representation of a semisimple group.
Let $A, B\in G(O)\cap G(F)^{rs}$ (rs for regular ...
5
votes
0
answers
231
views
Singularity of an $l\times l$ matrix whose entries are $2l$-th roots of unity
Let $l$ be a positive integer, $\zeta$ be a primitive $2l$-th root of unity in $\mathbb{C}$, and $\alpha,\beta$ be $\pm1$ sequences of length $l$, i.e. $\alpha_k=\pm1,\beta_k=\pm1$ for $k=0,\dots,l-1$....
15
votes
2
answers
7k
views
Efficient rank-two updates of an eigenvalue decomposition (or more generally SVD)
Let $A$ be a symmetric matrix with eigenvalue decomposition $UDU^T$. Golub, et al.1 and Bunch, et al.2 have shown that given such an $A$, the eigenvalue decomposition of $A+\rho xx^t$ may be computed ...
5
votes
0
answers
392
views
Preconditioner for finding the smallest eigenpairs of a large, but structured, matrix
I'm trying to find the eigenvector corresponding to the second smallest eigenvalue of a large $(4,000,000 \times 4,000,000)$ matrix $L$. $L$ is a graph Laplacian, with the following structure: $L = D -...
2
votes
0
answers
212
views
Compute the discriminant for reductive groups
Consider $G=GL_{2}$ and $F=k((\pi))$, and a diagonal matrix $t=\left(\begin{array}{cc}a&0\\0&b\end{array}\right)$.
The characteristic polynomial of $t$ is $X^{2}-(a+b)X+ab$, and the ...
2
votes
3
answers
755
views
On matrices in linear forms with vanishing determinant
This is a cross-post from my original question at math.se. I decided to post here because it seems more difficult than I originally thought.
Let $R=\mathbb C[x_1,\ldots,x_r]$ be a polynomial ring. ...