All Questions
Tagged with linear-algebra matrix-analysis
364 questions
35
votes
3
answers
4k
views
A curious determinantal inequality
In my study, I come across the following curious inequality, which I do not know a proof yet (so I am asking it here).
Let $A, B$ be $n\times n$ (Hermitian) positive definite matrices. It is very ...
- 1,748
4
votes
0
answers
233
views
Determining Nullspace Basis such that only one column is deleted or added as row is added or deleted, and remaining columns of basis stay the same
I would like to compute, in MATLAB, the basis Z for the nullspace of an m by n matrix A, such that if one row of A is added (resulting in A_a), the basis for A_a is n-m-1 of the n-m columns of Z, i.e.,...
- 1,517
1
vote
0
answers
148
views
Perturbation of eigenvalues of some special matrices
In perturbation theory of linear operators, one major question is how the eigenvalues of a linear operator $A$ change under a small perturbation, $A(x) = A + xP$, with $x\in\mathbb{R}$. For instance, ...
- 61
7
votes
1
answer
6k
views
Eigenvectors as continuous functions of matrix - diagonal perturbations
The general question has been treated here, and the response was negative. My question is about more particular perturbations. The counterexamples given in the previous question have variations not ...
- 2,222
9
votes
1
answer
954
views
Convexity of the product of two exponential matrices
Let $S\subset\mathbb{R}$ be a convex set and $\mathbb{S}^{n}$ be the set of real symmetric matrices of order $n\times n$.
A matrix valued function $\Gamma: S \rightarrow \mathbb{S}^{n}$ is said to ...
- 1,590
3
votes
1
answer
119
views
Create matrix containing values in [0,1] where sum of all diagonals and anti-diagonals is fixed
The problem I am facing sounds at first glance pretty simple. However, as very often, it seems more complicated than I first assumed:
I want to calculate a matrix $P = (p_{j,k}) \in \mathbb{R}^{n \...
1
vote
0
answers
113
views
Is my particular finite dimension Toeplitz matrix always strictly positive?
Let $H(\omega), \; -\pi \leq \omega \leq \pi$ be a real-valued function with a continuous band of zeros, that is (for simplicity) $H(\omega)=0, \; |\omega|\geq \beta \pi$.
Define a sequence of banded ...
- 21
1
vote
0
answers
631
views
Bounding the largest Singular value
D is a $n \times n$ diagonal matrix whose diagonal entries lies in $(0,1]$.
B is any $n \times n$ n.n.d. matrix.
What will be the sharpest upper bound on the largest eigenvalue of:
$(D+B)^{-1}D^2(...
9
votes
1
answer
396
views
Bound on the ratio of top 2 eigenvalues
Let $P$ be a $n \times n$ stochastic matrix such that $P_{ij}=\tau$ if $i \neq j$ and $P_{ii} = 1 - (n-1)\tau$ where $0<\tau < \frac{1}{n}$.
It is clear that the largest eigenvalue of $P$ is 1, ...
user31317
2
votes
1
answer
843
views
Bounds on Hilbert-Schmidt norm of difference of products of matrices
I suspect the following is well-known, but don't know of a reference (and it is not close to the area I normally work in).
I have two sequences of matrices $Q_{1},\ldots,Q_{k}$ and $R_{1},\ldots,R_{k}...
- 98
13
votes
1
answer
1k
views
A generalization of the Powers-Stormer inequality
The well-known Powers-Stormer inequality says the following: for positive semidefinite operators $A, B$, we have that $\mathrm{Tr}((A - B)(A - B)) \leq \| A^2 - B^2 \|_1$, where $\| \cdot \|_1$ ...
- 2,019
3
votes
1
answer
296
views
Upper bounds on elements of a matrix
During my research I have come across matrices this type
$$C=B\left(B^T B\right)^{-1}B^T\ ,$$
where $B$ is an $m\times n$ real matrix. If $B^TB$ is not invertible, then $\left(B^T B\right)^{-1}$ ...
- 265
6
votes
2
answers
880
views
Matrix-convexity of inverse of the cofactor matrix
Consider the matrix-valued function $f(A) = \frac{A}{\det(A)}$ on the set of $3\times 3$ positive-definite matrices. Is this function matrix-convex ? (i.e., is $tf(A) + (1-t)f(B) - f(tA+(1-t)B)$ ...
- 3,383
3
votes
2
answers
939
views
Positive definiteness of infinite tridiagonal matrices
I am interested in the following problem: I have an infinite symmetric tridiagonal matrix
$$
A=
\begin{bmatrix}
a_1 & b_1 & & & \\
b_1 & a_2 & b_2 & & \...
- 692
1
vote
0
answers
90
views
Algorithms to compute the rank of a parametrized matrix [closed]
Motivated by my question on Mathematics StackExchange and by a question by Anirbit on the same site, I ask for some references on the problem of rank computation for a parametrized matrix. References ...
- 111
1
vote
0
answers
127
views
Unitary transformation of a Hermitian indefinite pencil to a real non-symmetric pencil
Given a Hermitian indefinite pencil $(A-\lambda B)$ where both $A=A^H$ and $B=B^H \in \mathbb{C}^{n\times n}$ are possibly indefinite, it is straightforward to show that the eigenvalues are either ...
- 757
3
votes
1
answer
163
views
Normalizing a matrix via triangular transformations
Consider the following $n\times n$ real-valued matrix:
$$
A=\begin{bmatrix}
\alpha_1 & \beta_1 & 0 &\cdots & 0 &\gamma_n\\
\gamma_1 & \alpha_2 & \beta_2 & \cdots & ...
- 2,712
5
votes
2
answers
2k
views
How to calculate the square root of matrix $A+B$ perturbatively?
$A=diag\{\lambda_1,...,\lambda_n\}$ and $\lambda_i>0$, $B$ is a positive definite symmetric matrix and $max\{B_{ij} \}\ll min\{\lambda_i\}$
Note that the perturbative calculation of square root ...
- 977
-1
votes
1
answer
1k
views
How to show the square root function of a positive semidefinite matrix is differentiable? [closed]
How to show the square root function of a positive semidefinite matrix is differentiable?
In this context PSD means symmetric PSD.
- 111
1
vote
0
answers
244
views
Distribution of a signal covariance matrix
A common estimation problem in signal processing assumes the following signal model
\begin{equation}
\mathbf{r} = \sum_{i=1}^{Q}\alpha_i\mathbf{s}\left(w_i\right)+\mathbf{n}
\end{equation}
where $\...
- 345
0
votes
0
answers
182
views
Question about majorization of eigenvalues after conjugation
Let $A$ and $B$ be $n \times n$ positive semidefinite matrices with eigenvalues $\alpha_1 \ge \alpha_2 \ge \ldots \ge \alpha_n$ and $\beta_1 \ge \beta_2 \ge \ldots \ge \beta_n$ respectively. ...
- 2,339
6
votes
1
answer
277
views
Diagonalization of the matrix $(1/(i+j+\rm{const}))_{i,j}$
Consider the following infinite matrix: $A_{i,j}=\frac1{i+j+\gamma}$, $0\leq i,j<\infty$, $\gamma>0$ is a constant. Is it known how to diagonalize $A$, or, say, calculate $(I+tA)^{-1}$ for ...
- 109k
8
votes
2
answers
362
views
Unitary factor in polar decompositions
Let $A, B$ be $n$-square (Hermitian) positive definite matrices. Let $AB=U|AB|$ be the polar decomposition of $AB$. So $U$ is unitary (called the unitary factor of $AB$). What is the optimal constant $...
- 1,748
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^{...
- 103
8
votes
2
answers
5k
views
About Sylvester's determinant
If $A$ is any $n \times m$ matrix and $B$ is any $m \times n$ matrix then one familiar form of the Sylvester's identity is $\det(I + AB) = \det(I + BA)$.
Now somehow curiously this above identity is ...
- 617
12
votes
0
answers
314
views
Ratio of entries of A and log A where A is a triangular matrix
Consider triangular matrices $A = \left( {a(n,k)} \right)$ of arbitrary order with $a(n,k) = 0$ if $n + k$ is odd and $a(n,n - 2k) = \frac{{n!}}{{k!(n - 2k)!}}\frac{{(m + n - k - 1)!}}{{(m + n - 1)!}}$...
- 5,622
10
votes
2
answers
733
views
Product $PVPVP$ is elementwise nonnegative?
Let $P\in \mathbb{R}^{n\times n}$ be the inverse of a positive definite M-matrix and $V\in \mathbb{R}^{n\times n}$ be any diagonal matrix. Prove (or disprove) that $PVPVP$ is elementwise nonnegative.
...
- 143
11
votes
2
answers
3k
views
Do singular values dominate eigenvalues?
Suppose $A$ is an $n \times n$ complex matrix with singular values $s_1 \ge s_2 \ge \cdots \ge s_n$ and eigenvalues $(\lambda_i)_{i=1}^{n}$ arranged so that $|\lambda_1| \ge |\lambda_2| \ge \cdots \...
- 1,135
17
votes
1
answer
2k
views
Hlawka inequality for determinants of positive definite matrices
It is mentioned here that if $A, B, C\in M_{n}(\mathbb C)$ are positive semidefinite, then $$\det (A+B+C)+\det C\ge \det (A+C)+\det (B+C)$$ (quoted from this article) and the special case ($C=\bf 0$) $...
- 13.4k
3
votes
1
answer
2k
views
Connection between eigenvalues of A and its LDL decomposition
Consider an undirected graph $G$ with $N$ vertices and its adjacency matrix $n_{ij}$: $n_{ij} = 1$ if vertices $i$ and $j$ are connected by an edge and $n_{ij} = 0$ otherwise. Consider $A_{ij} \equiv \...
- 343
7
votes
2
answers
507
views
What are the upper bound and stability conditions for the following simple linear system?
Consider the following linear system
$$\dot{x}=\sum\limits_{i=1}^{m}{{{\alpha }_{i}}}\left( t \right)\cdot {{A}_{i}}\cdot x \quad (1)
$$
where, $x\in {{\mathbb{R}}^{n}}$ represents the state vector, $...
- 103
15
votes
3
answers
3k
views
Determinant of a $k \times k$ block matrix
Consider the $k \times k$ block matrix:
$$C = \left(\begin{array}{ccccc} A & B & B & \cdots & B \\ B & A & B &\cdots & B \\ \vdots & \vdots & \vdots & \...
- 301
4
votes
2
answers
292
views
Is there an easy way to tell if all eigenvalues of a unitary or self-adjoint matrix only have eigenvalues of multiplicity two?
I am interested in a class of $2n\times 2n$ unitary matrices with complex entries (if you prefer, we can replace "unitary" with "self-adjoint").
I know that all the eigenvalues of matrices in this ...
- 785
0
votes
1
answer
1k
views
Efficient way to find SVD of sum of projection matrices?
Lets say that we have n matrices of data $X_i : i \in [1, n]$. All $X_i$ have the same number of rows.
Their associated projection matrices are $P_i = X_i(X_i^T X_i)^{-1}X_i^T$
Also say that we have ...
- 720
0
votes
1
answer
836
views
Relation between the subordinate norm and the spectral radius of a matrix
Let's define the following subordinate norm of a $(NM \times NM)$ matrix A norm as follows
\begin{eqnarray*}
||A||_{2,b} = \mathrm{max}_{x \in \mathbb{C}^{NM}} \left \{ \frac{||A x||_b}{||x||_2} \...
2
votes
1
answer
346
views
Alike looking matrices imply convergence of eigenvalues?
This is a question about convergence of eigenvalues which essentially came up in studying the spectrum of St.-Liouville operators.
We want to look at matrices that agree in most of their entries and ...
user54300
5
votes
3
answers
693
views
Norm of triangular truncation operator on rank deficient matrices
Let $T_{n\times n}$ be a triangular truncation matrix, i.e.
$$T_{i,j}=\begin{cases}1 & i\ge j\\ 0 & i<j \end{cases}$$
It is known that for arbitrary $A_{n\times n}$
$$\|T\circ A\|\le\frac{\...
- 153
0
votes
1
answer
546
views
Solution of infinite dimension linear system
Suppose that ${a_n}$ and $b_n$ is decreasing sequence such that $a_0=A$, $lim_{n->\infty}a_n=0$ and $b_0=B$, $lim_{n->\infty}b_n=0$.
For fix n,
we can construct n dimension linear equation ...
- 111
2
votes
0
answers
1k
views
Cholesky decomposition of a large covariance matrix
I have a tricky problem concerning a covariance matrix cholesky decomposition.
What I need is to obtain the cholesky decomposition of the estimated variance matrix of the set of samples stored in a ...
24
votes
0
answers
1k
views
conjectures regarding a new Renyi information quantity
In a recent paper http://arxiv.org/abs/1403.6102, we defined a quantity that we called the "Renyi conditional mutual information" and investigated several of its properties. We have some open ...
- 483
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!
- 133
-1
votes
1
answer
293
views
spectrum of a special class of tridiagonal matrices
Consider a real and symmetric tridiagonal matrix with zero diagonals and where subdiagonals and superdiagonals are equal to 1 except the (1,2)-th component being equal to $a$, i.e.,
$$\begin{bmatrix}...
- 15
4
votes
1
answer
299
views
variation of the Lieb concavity theorem
A special case of the well known Lieb concavity theorem states that the following function is concave on positive operators A and B:
$$
(A,B) \to \text{Tr} \{A^s X B^{1-s} X^\dagger \}
$$
for $s \in ...
- 483
1
vote
1
answer
136
views
Any generic way to move a psd matrix to its neighbors?
Given a two positive matrices $A,B$. For simplicity, let's assume that $Tr A=Tr B=1$. Assume that $\|A-B\|_1\leq\varepsilon$, for some small $\varepsilon>0$, where $\|\cdot\|_1$ is the $l_1$-norm, ...
- 363
6
votes
0
answers
489
views
Symmetric matrices with $\rho(A)\gg\|A\|_\infty$
For a symmetric real matrix $A$, denote by $\rho(A)$ the spectral radius of $A$, and by $\sigma(A)$ the largest absolute row sum of $A$; that is, $\sigma(A)=\max_i \sum_j |a_{ij}|$, where $a_{ij}$ are ...
- 23k
2
votes
0
answers
477
views
Norm bound of a complex resolvent
A well known result by Varah states that if $A$ is a strictly diagonally dominant matrix of dimension $n$, then
$\|A^{-1}\|_{\infty} \le \max_i\frac{1}{|a_{kk}|-\sum_{j \neq k}|a_{kj}|}$, where the ...
- 73
6
votes
1
answer
417
views
Simultaneous Tridiagonalization of a given set of hermitian matrices?
I have a set of $N\times N$ hermitian matrices $A_i,~i=1,\dots,M$. Are there any results on the possibility of simultaneously tridiagonalizing them?
- 1,421
5
votes
3
answers
2k
views
How to check whether a matrix is completely positive or not?
The definition:
cone of completely positive matrices
$$
\mathcal{C}=\left\{
\sum_{i=1}^kx_ix_i^T : \text{$x_i\in\mathbb{R}^n_+$ for $i=1,2,\ldots,k$}
\right\}.
$$
I just don't know how to check ...
- 187
3
votes
1
answer
414
views
Known Results on Convexity of Numerical Range
Let $A_1,A_2,\dots,A_M$ be given $N\times N$ hermitian matrices. The numerical range is defined as the set
\begin{align}
\mathbb{S}=\{(u^HA_1u,\dots,u^HA_Mu)\in \mathbb{R}^M\mid u^Hu=1\}
\end{align}
...
- 1,421
7
votes
1
answer
443
views
How much can I perturb a symmetric stochastic matrix and keep positive solutions?
Suppose $A$ is a symmetric stochastic $n \times n$ matrix with least eigenvalue $\lambda_n>0$. Consider real symmetric perturbations $\widehat{A}$.
How large can I take $\epsilon$ such that $\...
- 1,081