Search Results
Search type | Search syntax |
---|---|
Tags | [tag] |
Exact | "words here" |
Author |
user:1234 user:me (yours) |
Score |
score:3 (3+) score:0 (none) |
Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
Views | views:250 |
Code | code:"if (foo != bar)" |
Sections |
title:apples body:"apples oranges" |
URL | url:"*.example.com" |
Saves | in:saves |
Status |
closed:yes duplicate:no migrated:no wiki:no |
Types |
is:question is:answer |
Exclude |
-[tag] -apples |
For more details on advanced search visit our help page |
Questions about the properties of vector spaces and linear transformations, including linear systems in general.
2
votes
How do we show this matrix has full rank?
I use Christian Remling idea,In fact,I can find the matrix $$B_{ij}=\min{\{i,j\}}$$eigenvalue is
$$\dfrac{1}{4\sin^2{\dfrac{j\pi}{2(n+1)}}},j=1,2,\cdots,n$$
proof:
then we have
$$B=\begin{bmatrix}
…
3
votes
1
answer
728
views
A similar Cauchy-Schwarz inequality with linear-algebra
Let $A$ be matrix in $M_{n}$ (i.e., $n\times n$ complex matrices), and $\|A\|\le 1$, we call it a contraction.
Assume that $A$ and $B$ are contractions such that
$I-AA^*$ and $I-BB^*$ are positive-d …
13
votes
3
answers
3k
views
How do we show this matrix has full rank?
I met with the following difficulty reading the paper Li, Rong Xiu "The properties of a matrix order column" (1988):
Define the matrix $A=(a_{jk})_{n\times n}$, where
$$a_{jk}=\begin{cases} …
5
votes
0
answers
2k
views
A stronger Cauchy-Schwarz inequality for traces of compression matrices
Assume that $A$ and $B$ are contractions, so
$I-AA^T$ and $I-BB^T$ are positive-definite matrices. Let
$C=(I-AB^T)^{-1}(I-AA^{T})(I-BA^{T})^{-1}$, and show that:
$$Tr\left(\frac{1}{1-AA^T}\right) …