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 questions only
not deleted
user 6094
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.
19
votes
4
answers
823
views
How much redundancy resides in an $n \times n$ orthogonal matrix?
Suppose one has an $n \times n$ orthogonal matrix $M$:
$$
\left(
\begin{array}{ccc}
0.239326 & 0.846726 &
0.475161 \\
0.768893 & 0.13356 &
-0.625272 \\
0.592897 & -0.514992 &
0.619077 \\
\ …
- 151k
8
votes
7
answers
2k
views
Source for roots of matrix polynomials?
A
matrix polynomial
is a polynomial whose variables are square $n \times n$ matrices,
let's say with entries in $\mathbb{C}$, and with coefficients in $\mathbb{C}$.
I am seeking a source of results on …
- 151k
13
votes
5
answers
1k
views
Packing obtuse vectors in $\mathbb{R}^d$
I came across this attractive theorem:
Theorem. In $\mathbb{R}^d$, there can be at most $d+1$ vectors that
form an obtuse angle with one another.
This was proved1 as a corollary of a lemma about i …
- 151k