All Questions
Tagged with linear-algebra matrix-analysis
364 questions
0
votes
0
answers
50
views
Eigenvalues of functions on finite discrete sets
Suppose I have an arbitrary function on a finite and discrete set $S$ defined as
$$f: S \times S \to \mathbb{C}^{|S|\times |S|}.$$
The $|S| \times |S|$ matrix $M$ is defined as
$$(M)_{ij}=f(s_i, s_j) \...
1
vote
0
answers
93
views
Similarity of non-standard matrices
I am researching numerical methods for PDEs. I particular, I am looking at methods for the linear hyperbolic PDE
$$
u_t+au_x=0.
$$
This is a common approach, because successful methods for this model ...
0
votes
1
answer
127
views
Under what conditions does $x^TA^{-1}y> 0$ hold? $A$ is a symmetric positive definite matrix,$A\in \mathbb{R}^{n\times n}_+, x,y\in \mathbb{R}^{n}_+$
This is a tricky problem I encountered in my research. $A\in \mathbb{R}^{n\times n}_+, x,y\in \mathbb{R}^{n}_+$, i.e. $\forall 1\leq i \leq n, 1 \leq j\leq n, A(i, j)>0, x(i), y(i)>0$.
As known, ...
0
votes
0
answers
68
views
Inequality between product of companion matrices and power of Pisot number
Let $d\geqslant 2$ be an integer and consider a convergent sequence of "companion" matrices
$$A_k := \begin{pmatrix}
a_{k,1} & a_{k,2} & \cdots & a_{k,d} \\\
& ...
1
vote
1
answer
151
views
How to prove that each element of $A(A^TA)^{-1}A^Ty$ is greater than 0, if $A(i,j)>0$ and $y=[1, 1, 1, ..., 1]^T$
Let $A\in \mathbb{R}^{m\times n}$, $m>n$, $rank(A)=n$, and $\forall 1 \leq i \leq m, 1 \leq j \leq n, A(i, j)>0$, $y=[1, 1, 1, ..., 1]^T$. Let $\beta=A(A^TA)^{-1}A^Ty$, how to prove that each ...
1
vote
1
answer
153
views
How to solve for bounds restricting ${\Sigma}$ to symmetric-positive-semi-definiteness?
Scenario
I have a equation for a covariance matrix ${\Sigma}$ where everything but a vector of correlations is known aka $x=(x_{1}, \dots, x_{D})$ for $x_{i}\in [-1, 1]$.
Problem
I know that ${x}$ ...
10
votes
3
answers
455
views
When does $\det(\frac{A+A^T}{2})=\det(A)$ for positive-definite $\frac{A+A^T}{2}$?
Setup: Let $A$ be a real square matrix and assume its symmetric part $\frac{A+A^T}{2}$ is positive-definite. The inequality
$$
\det\left(\frac{A+A^T}{2}\right) \leq \lvert\det(A)\rvert
$$
is known as ...
7
votes
1
answer
271
views
Existence of a linear map resulting in the determinant being an elementary symmetric polynomial
Let $1 \leq k \leq n$ be fixed integers. Let $\mathcal{M}_n^{\mathrm{H}}$ be the set of $n \times n$ complex Hermitian matrices (if it makes it easier to answer this question, you may instead use the ...
7
votes
1
answer
390
views
Questions on symmetric Hadamard matrices
Definitions: An $n\times n$ Hadamard matrix (HM for short) is a matrix whose entries are either $1$ or $−1$ and whose rows are mutually orthogonal.
If $A$ is a symmetric matrix, then $A = A^T$ and if $...
2
votes
1
answer
215
views
Forming real positive semidefinite matrices from complex matrices
I have asked this question on the Mathematics Stack Exchange: https://math.stackexchange.com/questions/4924554/forming-real-symmetric-positive-semidefinite-matrices-from-complex-matrices.
Let $Q \in \...
3
votes
1
answer
286
views
Unitary transformations of Vandermonde matrices forms a smooth manifold?
The space of all Vandermonde matrices $V$ with $r$ variables and degree $n$ (as below) forms an embedded submanifold of $\mathbb{R}^{(n+1) \times r}$ when $x_{i} \in \mathbb{R}$. It is naturally a ...
1
vote
1
answer
87
views
Where does $V$ from the spectral decomposition $A = VDV^*$ lie, if $A$ has only imaginary entries?
The spectral theorem says that for every Hermitian matrix $A \in \mathbb{C}^{n \times n}$ there is a unitary matrix $V \in U(n)$ and a diagonal matrix $D \in \mathbb{R}^{n \times n}$ such that $A = ...
5
votes
1
answer
196
views
What is the "natural" or "physical" norm on the Hessian matrix (and other higher derivatives)?
Let $u : \mathbb R^n \rightarrow \mathbb R$ and let $H : \mathbb R^n \rightarrow \mathbb R^{n \times n}$ be its Hessian matrix. What is the "natural" choice of pointwise norm on the Hessian ...
0
votes
0
answers
55
views
Johnson-Lindenstrauss type result for matrix factorization
The type of result I want is: given matrix $A\in \mathbb{R}^{m\times n}$ and error tolerance $\epsilon$, what is a lower bound on $k$ such that $\|A - UV\|_{??}\le \epsilon$, where $U \in\mathbb{R}^{m\...
0
votes
0
answers
43
views
Given two rectangular matrices and they yield the same results when they are multiplied by their own transposes. What can we say about them?
Suppose we have $MM^T = NN^T$, where $M$ and $N$ are both $n$ by $d$ matrices. Assume that $n$ is (much) larger than $d$, are there anything we could conclude about $M$ and $N$, aside from that $N$ ...
1
vote
0
answers
29
views
Can all real positive semidefinite Hankel matrices be decomposed into sum of rank 1 real positive semidefinite Hankel matrices?
Denote the set of real positive semidefinite $d\times d$ Hankel matrices as $\mathcal{S}$. Can we always decompose one $S\in \mathcal{S}$ into sum of rank $1$ $S_i\in \mathcal{S}$, i.e., $S=\sum_i S_i$...
2
votes
1
answer
87
views
Symmetric and anti-symmetric matrices and maximal eigenvalues
Suppose we start with a symmetric $n \times n$ matrix $A$, the elements of which are either $1$ or $0$. All the diagonal elements of this matrix are set to be $0$. So, $\lambda_{\text{max}}=\sup \...
0
votes
1
answer
91
views
Matrix quantization and effect on singular values
Let $A$ and $B$ be an $N\times n$ matrix with $n\le N$, and let $\sigma_1(X),\dots \sigma_n(X)$ denote the singular values of $X\in \{A,B\}$. Do we have upper and lower bounds for
$$
\|
\sigma_i(A)-\...
6
votes
2
answers
647
views
Is there a name for matrices of the form $a_{ij}=\frac{1}{a_{ji}}$?
I have a matrix that is “kind of symmetric.” Specifically, it is an $n \times n$ real matrix such that the entries $a_{ij}=1/a_{ji}$ whenever $j \ne i$. I want to investigate the properties of this ...
1
vote
1
answer
118
views
A sine type Chebyshev system
A sequence of real functions $\{\phi_1,\cdots,\phi_n\}$ is called a Chebyshev system on an interval $I\subseteq\mathbb{R}$, if any real linear combination $\sum_{l=1}^n a_l\phi_l$ has at most $n-1$ ...
1
vote
0
answers
91
views
Positive semidefinite maximum principle
Let $K\in\{\mathbb{R},\mathbb{C},\mathbb{H}\}$. Let $\mu$ be a Borel probability measure on $M_n(K)$ supported on a compact set $C$ of positive semidefinite matrices with $\mathbf{0}\not\in C$. ...
2
votes
1
answer
200
views
An inequality related to matrix trace
$$Tr(A|A^T U \Sigma U^T|) \leq Tr(AA^T U \Sigma U^T)$$ where $A \in \mathbb{R}^{m\times n}$ is a real rectangular matrix, $U \in \mathbb{R}^{n \times n}$ is a orthonormal matrix and $\Sigma$ is a ...
3
votes
0
answers
49
views
Which invertible linear maps preserve the set of Hurwitz stable matrices?
Let $V = M_n(\mathbb{R})$ be the set of all $n\times n$ matrices with real elements and $V_{-}$ be a subset of Hurwitz stable matrices, i.e. matrices such that all their eigenvalues have strictly ...
1
vote
2
answers
137
views
Methods to solve for a matrix whose entries satisfy certain properties
(This question is a repost of a deleted question I asked, because the previous version had several elements missing)
Setting
For fixed $N \in \mathbb{N}$, I wish to compute the entries of a matrix $...
0
votes
0
answers
99
views
Efficient method to determine minimum eigenvalue of $2 \times 2$ block diagonal matrix
Suppose $H$ is a $2 \times 2$ block-diagonal symmetric matrix in $\mathbb{R}^{2^N \times 2^N} $. That is
$$ H = \begin{pmatrix} A_1 & 0 & \cdots & 0\\ 0 & A_2 & \cdots & 0 \\
...
8
votes
1
answer
324
views
On a matrix inequality
$\newcommand{\R}{\mathbb R}\newcommand{\tr}{\operatorname{tr}}$It follows from Proposition 7 and this recent answer that, for any positive-definite $n\times n$ symmetric real matrices $A$ and $B$,
$$\...
0
votes
0
answers
83
views
When is the sum of matrices (circulant + [super upper triangular]) not diagonalizable?
By the circulant matrix $C \in M_n(\mathbb{R})$, we mean that
$$ C = \left[\begin{array}{c|c|c|c} e_n & e_1 & \cdots & e_{n-1} \end{array}\right] $$
where $e_1,\dots,e_n$ are the standard ...
4
votes
1
answer
141
views
Sum of holomorphic squares?
Consider a variable $z \in \mathbb{R}^n$ and assume $u(z) \in \mathbb{R}^m$ and $H(z) \in \mathbb{R}^{m \times m}$. Further assume that $H(z)$ is symmetric positive definite for every $z$. Consider ...
2
votes
1
answer
112
views
The eigenvectors of adding a particular rank one matrix to the circulant matrix
Suppose that $e_1, \cdots, e_n$ are the standard vectors of the Euclidean space $\mathbb{R}^n$.
Let us consider the backward shift operator $T:\mathbb{R}^n\to \mathbb{R}^n$ given by $Te_k=e_{k-1}$ ...
0
votes
0
answers
146
views
Maximizing the norm of a sum of Hermitian matrices
Consider the following problem:
Problem: Given $n\times n$-Hermitian matrices $A_1,\dots,A_r$, find $e_1,\dots,e_r\in\{-1,1\}$ such that $\|e_1A_1+\dots+e_rA_r\|_\infty$ is maximized. Here the norm is ...
3
votes
1
answer
168
views
Condition for 3×3 block matrix to be stable
Given a square symmetric matrix $H\in\mathbb{R}^{n\times n}$, design a symmetric positive definite matrix $M\in\mathbb{R}^{n\times n}$ and positive scalar $\alpha$ such that the following ${3n\times ...
1
vote
1
answer
404
views
Norm inequality
In an article I read, I have the following inequality:
$\|A-B\|_1 \geq \max \{ \|A 1_m- B 1_m \|_1, \|A^T 1_n - B^T1_n\|_1 \}$
Where $A, B \in \mathbb{R}_+^{m\times n}$.
The $\|\cdot\|_1$ refers ...
3
votes
1
answer
455
views
Approximating sum of entries of $\exp(A-B)$ for diagonal $A$ and rank-$1$ $B$?
I have non-negative $d\times d$ matrices $A$, $B$ and need a tractable way to compute the sum of all entries of $\exp(-t(A-B))$ where $A$ is diagonal and $B$ symmetric rank-$1$. IE
$$f(t)=\langle\exp(-...
0
votes
0
answers
107
views
The eigenstructure of the symmetric tridiagonal matrix whose entries are $a_{kk}=\cos\frac{k\pi}{n+1}$ and $$a_{1,2}=\cdots=a_{n-1,n}=1$$
Suppose that $A=(a_{kl})_{k,l=1}^n$ is a symmetric tri-diagonal matix in $M_n(\mathbb{R})$ whose diagonal entries are $a_{kk}=\cos\frac{k\pi}{n+1}$ and
$$a_{1,2}=\cdots=a_{n-1,n}=1$$
Any approach to ...
0
votes
0
answers
124
views
Eigenvectors of the symmetric tridiagonal matrices whose entries above the diagonal are all the same
Let us consider the real symmetric tridiagonal matrix $T=(t_{kl})$ in $M_n(\mathbb{R})$ with
$$t_{1,2}=t_{2,3}=\cdots=t_{n-1,n}=1$$
How can we compute the eigenvectors of $T$?
0
votes
1
answer
75
views
The spectrum of the product $JA$ where $J=I_n\oplus (-I_n)$
Let $A$ be a real symmetric matrix in $M_{2n}(\mathbb{R})$with $A^2=I_{2n}$. Suppose that the Schur decomposition of $A$ is given by $A=\Lambda^t D \Lambda$. Let us consider the following matrix.
$$...
3
votes
0
answers
115
views
Recovering the matrix when the Schur decomposition of its blocks are known
Let E be a real symmetric matrix in $M_n(\mathbb{R})$ where $ n=2m$ and
$$E=\left(\begin{array}{cc}
G & X \\
X^t & H
\end{array}\right)$$
where $G,H,X$ are $m\times m$ matrices.
Suppose that $...
1
vote
2
answers
184
views
Generate a low-rank sparse covariance matrix
May I ask how to generate a low-rank sparse covariance matrix? Thank you!
1
vote
1
answer
1k
views
Reference for (general case) of uniqueness of singular value decomposition (SVD)
My statistics research requires me to understand the non-uniqueness of SVD in the degenerate case of repeated singular values.
I believe that the statements and proofs on this StackExchange posts are ...
3
votes
1
answer
144
views
On the bounds of the sum of the squares of spectral variation of two real symmetric matrices
Suppose $A$ and $B$ are two symmetric real $\{0,1,-1\}$ matrices of order $n$ with diagonal elements as zeros (therefore the traces are zeros) and eigenvalues $\lambda_1\ge \lambda_2\ge \dotsb \ge \...
3
votes
0
answers
173
views
Can the Jordan decomposition of a matrix be computed in a backwards stable way?
Let $PJP^{-1}$ denote the Jordan decomposition of $M$. The matrix $J$ is a direct sum of Jordan blocks; it is unique up to permutation of the Jordan blocks. The matrix $P$ is not unique.
There are two ...
1
vote
0
answers
72
views
Solve linear matrix equation involving convolution
I am facing following equation:
$$
A * X + C \cdot X = D
$$
with:
$A, C, D \in \mathbb{R}^{n \times n}$ some known matrices without any particular structure,
$X \in \mathbb{R}^{n \times n}$ the ...
1
vote
1
answer
70
views
A question about the sign of quadratic forms on nonnegative vectors
Let $M$ be a real square matrix of order $n\ge 3$.
Assume that for every nonnegative vector $\textbf{z}\in \mathbb R^n$ which has at lease one zero entry we have $\textbf{z}^T M \textbf{z} \ge 0$.
Can ...
6
votes
1
answer
886
views
One question on block-circulant matrices
Circulant matrices are very useful in digital image processing.
I found the general formula for determinant of circulant matrix.
But I think it is not suitable for block-circulant matrices.
For ...
1
vote
0
answers
163
views
An estimation of the largest eigenvalue of a submatrix of $\left(\cos(\frac{kl\pi}{4n})\right)_{k,l=1}^n$
Let us consider the following matrix $A=(a_{k,l})$ where
$$A=\left(\cos(\frac{kl\pi}{4n})\right)_{k,l=1}^n$$
Let us consider the submatrix $A_0$ of $A$ whose entries are those $a_{k,l}$ where $k\...
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)^...
5
votes
1
answer
319
views
Analytical form for the nuclear norm of an $n \times n$ matrix
I get the follow equation in a paper. Let $A \in \mathbb{R}^{2 \times 2}$, then $M = A^TA$ is a positive semi-definite matrix, the nuclear norm of $A$ is:
$$ \Vert A \Vert_* = \sqrt{\operatorname{tr}(...
2
votes
0
answers
43
views
Selecting some linearly independent columns of a particular matrix
Let us consider the matrix $C=A_1+A_2$ where :
$A_1=(a_{k,l})_{k,l=0}^{n-1}$ is the $n$ by $n$ matrix given by $a_{k,l}=\frac{2}{\sqrt{n}}(\cos\frac{2kl\pi}{n})$
$A_2$ is the the $n$ by $n$ block ...
2
votes
0
answers
45
views
Combining SVD subspaces for low dimensional representations
Suppose we have matrix $A$ of size $N_t \times N_m$, containing $N_m$ measurements corrupted by some (e.g. Gaussian) noise. An SVD of this data $A = U_AS_A{V_A}^T$ can reveal the singular vectors $U_A$...
4
votes
0
answers
990
views
Lower bound minimum eigenvalue of a positive semi-definite Hermitian matrix with bounded entries
Let $M \in \mathbb{C}^{n \times n}$ be a matrix with the following properties:
$M$ is Hermitian and positive semi-definite (all the eigenvalues are real and nonnegative).
The diagonal entries of $M$ ...