Timeline for Norm of triangular truncation operator on rank deficient matrices
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 24, 2014 at 1:36 | vote | accept | sb945 | ||
| Sep 27, 2014 at 5:21 | answer | added | Mikael de la Salle | timeline score: 5 | |
| Jul 28, 2014 at 19:42 | history | edited | sb945 | CC BY-SA 3.0 |
deleted 1 character in body
|
| Jul 28, 2014 at 19:29 | history | edited | sb945 | CC BY-SA 3.0 |
added 309 characters in body
|
| Jul 28, 2014 at 5:23 | answer | added | Mustafa Said | timeline score: 0 | |
| Jul 27, 2014 at 21:45 | comment | added | Christian Remling | Also, at the risk of being pedantic, we can add some precision to the question: let $f(r)=\sup \| T\circ A\|/\|A\|$, where the $\sup$ is over all (non-zero) $n\times n$ matrices of rank $r$, with arbitrary $n$. Then we would like to know if $\liminf r^{-1/2}f(r)>0$. (In your version, if taken at face value, any expression can go on the RHS since I can always absorb everything by the constant $c$; we need to send $r\to\infty$ also eventually.) | |
| Jul 27, 2014 at 20:59 | comment | added | Christian Remling | It is perhaps useful to point out that what you and Bhatia (in the linked paper) refer to as the "Frobenius norm" is called the Hilbert-Schmidt norm by many (including me). | |
| Jul 27, 2014 at 18:03 | answer | added | Desiderius Severus | timeline score: 0 | |
| Jul 27, 2014 at 17:01 | review | First posts | |||
| Jul 27, 2014 at 17:13 | |||||
| Jul 27, 2014 at 16:56 | history | asked | sb945 | CC BY-SA 3.0 |