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 where the notion matrix has an important or crucial role (for the latter, note the tag matrix-theory for potential use). Matrices appear in various parts of mathematics, and this tag is typically combined with other tags to make the general subject clear, such as an appropriate top-level tag ra.rings-and-algebras, co.combinatorics, etc. and other tags that might be applicable. There are also several more specialized tags concerning matrices.
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}
…
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. …