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 |
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.
5
votes
1
answer
163
views
Orthogonal projection onto cones in inner product spaces
Let $H_n$ denote the space of $n\times n$ Hermitian matrices. For every $A\in H_n$, using the spectral decompostion of $A$,
$$A=\sum_i \lambda_i x_ix_i^*,$$
one can define the positive and negative pa …
12
votes
0
answers
757
views
Does this matrix norm inequality have interesting application in other areas of mathematics?
In my new paper, one of the main theorems gives an upper bound for the spectral distance of a general real symmetric matrix to diagonal matrices:
Theorem 3. Let $A=[a_{ij}]$ be a real symmetric matr …
10
votes
1
answer
624
views
Minimum distance of a symmetric matrix to diagonal matrices
Let $A=(a_{ij})$ be an arbitrary $n \times n$ real symmetric matrix and $n\geq 2$. Let $\| \cdot \|$ denote the operator $2$-norm or equivalently the maximum absolute value of eigenvalues for symmetri …
16
votes
0
answers
466
views
An inequality for matrix norms
Working on a problem in combinatorics I come up with the following inequality on matrix norms, which I checked it also numerically:
Let $A=(a_{ij})$ be a real symmetric $n\times n$ matrix with tra …
9
votes
2
answers
299
views
Maximum of a quantity for two normal orthogonal vectors in $\mathbb{R}^n$
Let's define for every pair of vectors $u,v\in\mathbb{R}^n$, a quantity as follows:
$$f(u,v) = \sum_{1\leq i,j\leq n}|u_iu_j-v_iv_j|.$$
I want to find:
$$M(n)= \max \{f(u,v): u,v\in \mathbb{R}^n, |u| …