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 spectral-radius
Search options answers only
not deleted
user 1044
In mathematics, the spectral radius of a square matrix or a bounded linear operator is the supremum among the absolute values of the elements in its spectrum.
5
votes
Accepted
Minimize spectral norm under diagonal similarity
You cannot get an upper bound in general in terms of the spectral radius $\rho(A)$. Counterexample: if
$$
A = \begin{bmatrix} x & 1 \\ -x^2 & -x \end{bmatrix}
$$
then $\rho(A) = 0$ and $s(A) = 2|x|$. …
- 11.4k