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 | |
Results tagged with matrix-analysis
Search options answers only
not deleted
user 14830
The study of the properties of real and complex matrices that are more close to analysis and operator theory. For instance: the properties of positive definite matrices, matrix inequalities, perturbation analysis, matrix functions, inequalities between eigenvectors and singular values, majorization.
29
votes
Accepted
Matrix inequality $(A-B)^2 \leq c (A+B)^2$ ?
There is no such $c$ even if we use only $2 \times 2$ matrices.
For any $c \geq 1$ let $A,B$ be the positive-semidefinite matrices
$$
A = \left( \begin{array}{lc} c^2 & c \cr c & 1 \end{array} \right) …
- 79.9k
5
votes
Is this inequality involving the Frobenius norm right?
As stated$^*$ this problem has nothing to do with the Frobenius norm.
The map $T: A \mapsto AG$ is a linear transformation from a
finite-dimensional vector space, so for any norms we have
a constant $ …
- 79.9k