All Questions
Tagged with linear-algebra matrix-analysis
364 questions
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.
...
CommunityBot
- 1
1
vote
0
answers
56
views
Matrix diagonalization after a completely positive transformation
I have a hermitian matrix $A$ which can be diagonalized:
$$A=UDU^+,$$
where U is the unitary matrix and D is the diagonal matrix.
Next, I have a completely positive transformation over it, which is ...
- 171
0
votes
1
answer
246
views
$P(Z)$ is matrix polynomials. Why is $s_n$ smooth in a neighbourhood of $Z$?
Let $A_j \in \mathbb{C}^{n \times n}$, ($j = 0,1,2,\ldots,m$) and
$P(Z) = A_m Z^m + \cdots + A_1 Z + A_0$ is a matrix polynomial, and $Z $ is a complex variable.
$Z$ is eigenvalue of $P(Z )$ if $\...
- 570
1
vote
0
answers
72
views
Triangle inequality for nonconvex functions of singular value vector
For a nonconvex function $p_\lambda(\cdot)$, with hyper-parameter $\lambda$, it can be decomposed into two parts that $p_\lambda(t) = \lambda |t| + q_\lambda(t)$, where $q_\lambda(t)$ is the concave ...
- 19.6k
1
vote
1
answer
940
views
Uniqueness and invariance of the LDLT decomposition
A real symmetric positive semi-definite matrix $A$ can be decomposed in the form
$A = P^TLDL^TP$,
where $P$ is a permutation matrix, $L$ is a lower unit triangular matrix and $D$ is a diagonal ...
- 20.2k
1
vote
0
answers
137
views
Boundary of pseudospectra
Suppose:
$B_i \in \mathbb{C}^{n \times n}$, $0<w_i\in \mathbb{R}$ $(i = 0,1,2,\ldots,m)$
${\rm P}(x) ={\rm{B}_m} x ^m + \cdots + B_1 x + B_0$ is a matrix polynomial, and $x $ is a complex ...
- 2,118
1
vote
1
answer
896
views
sign-flipping inverse
Consider this matrix:
$Z=\begin{bmatrix}23.9 & -7 & -17 \\\\ -7 & 23.9 & -17 \\\\ -17 & -17 & 33.9 \end{bmatrix}$
Its inverse is entrywise negative (you can check...) and ...
CommunityBot
- 1
4
votes
0
answers
676
views
Weyl-type inequality for non-Hermitian matrices?
What is the weakest known condition under which a Weyl-type eigenvalue perturbation inequality holds? Does some analogue hold for normal matrices, for example?
- 1,590
7
votes
2
answers
4k
views
Induced matrix norm less than one for matrices with spectral radius less than one
Let $A$ be a square matrix with elements in $\mathbb{R}$ or $\mathbb{C}$,
$\rho\left(A\right)$ stands for the spectral radius of $A$, i.e.,
the maximum absolute eigenvalue of $A$; $A^{*}$ is the ...
- 1,590
1
vote
0
answers
96
views
Let $M = \frac{1}{2}(A + {A^T})$ be real symmetric nonnegative matrix. Why does $\rho (A) \le {\lambda _{\max }}(M)$?
Let $A \in M_n$ be nonnegative, and consider the real symmetric nonnegative matrix
$M = \frac{1}{2}(A + {A^T})$.
Why does $\rho (A) \le {\lambda _{\max }}(M)$?
- 11
17
votes
2
answers
4k
views
Optimizing the condition number
Suppose I have a set $S$ of $N$ vectors in $W=\mathbb{R}^m,$ with $N \gg m.$ I want to choose a subset $\{v_1, \dots, v_m\}$ of $S$ in such a way that the condition number of the matrix with columns $...
CommunityBot
- 1
7
votes
1
answer
250
views
approximate stationary distributions of a doubly stochastic matrix and its supports
Given a doubly stochastic matrix $M$ and a distribution $v$,let $M=\sum_{\sigma\in S_n}p_{\sigma}M_{\sigma}$ be any Birkhoff decomposition of $M$, where $M_{\sigma}$ is the permutation matrix induced ...
- 363
1
vote
0
answers
114
views
A question on Perron–Frobenius theorem [closed]
Let $A \in M_n$ is nonnegative(all $a_{ij}\ge0$).
Suppose $A$ has a nonnegative eigenvector(all entries$\ge0$ ) with $r ≥ 1$ positive entries and $n − r$ zero entries.
Why is there a permutation ...
- 11
12
votes
0
answers
218
views
Which ordering of factors is needed to obtain this kind of determinantal inequalities?
Let $A$ and $B$ be $n\times n$ Hermitian positive definite matrices. The curious determinantal inequality given here, which can be stated as $$\det (A^{4}+ ABBA+BAAB+B^{4})\ge\det(A^{4}+ AABB+BBAA+B^{...
CommunityBot
- 1
-1
votes
1
answer
173
views
finding a unitary submatrix inside a random matrix
Let $\mathbf{R} \in \mathbb{C}^{~m \times n} $ with $m \leq n $ be a random matrix, whose entries are i.i.d zero mean random variables with circularly symmetric Normal distribution. Let where $r$ be ...
- 482
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$) $...
CommunityBot
- 1
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 ...
CommunityBot
- 1
2
votes
0
answers
476
views
What does similar eigenvectors and eigenvalues of two matrices really mean? [closed]
Empirically I've noticed that diagonally dominant matrix G and it's diagonal version D (diagonal elements of G on the diagonal and all other elements are set to zero) produce similar eigenvalues and ...
- 29
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, $...
- 1,538
4
votes
2
answers
202
views
Integral roots of circulant matrix
When does the circulant matrix have only integral roots?
For example: all roots of the adjacency matrix of the complete graph $K_n$ are integer, which its adjacency matrix is circulant, but in case ...
- 4,784
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$ ...
- 3,984
8
votes
2
answers
426
views
Existence and characterization of transitive matrices?
We call a matrix $M \in \mathbb{R}^{d \times d}$ transitive if it satisfies the following:
For any three vectors $u, v, w$ in $\mathbb{R}^d$. If $u^T M v > 0$ and $v^T M w > 0$ then $u^TMw &...
CommunityBot
- 1
0
votes
0
answers
84
views
Can we increase spectral norms of All maximum size square submatrices by orthogonal perturbation?
Let the matrix $A$ consist of $k$ columns from some $n \times n$ orthogonal (unitary) matrix. It is obvious that there is no perturbation of $A$ which
leaves its columns orthonormal,
increases ...
- 26.9k
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.,...
CommunityBot
- 1
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, ...
- 20.2k
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 ...
- 121
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 ...
CommunityBot
- 1
3
votes
1
answer
211
views
Generalizing the spectral radius of a unistochastic matrix
Consider a square matrix $A$, and from it construct $B$ whose entries are the squared magnitudes of those in $A$. What can we say about the spectral radius of $B$? I know that for a unitary matrix $A$,...
- 10.9k
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(...
- 1
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 ...
- 2,361
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
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}...
- 20.2k
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}$ ...
- 131
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
132
views
Matrices with a common Fischer basis
Let $A$ be a real symmetric $n\times n$ matrix, normalized such that $Tr[A]=1$. Define a 'Fischer basis' as the basis in which all diagonal elements are equal to $\frac{1}{n}$. The motivation for ...
- 13.4k
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
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
-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.
- 20.9k
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
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 ...
- 6,962
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 ...
- 15.4k
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
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
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 \...
- 28.6k
-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}...
- 3,741
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{\...
- 9,486
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 \...
- 54.2k