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 matrices
Search options not deleted
user 82122
Questions where the notion matrix has an important or crucial role (for the latter, note the tag matrix-theory for potential use). Matrices appear in various parts of mathematics, and this tag is typically combined with other tags to make the general subject clear, such as an appropriate top-level tag ra.rings-and-algebras, co.combinatorics, etc. and other tags that might be applicable. There are also several more specialized tags concerning matrices.
-1
votes
1
answer
230
views
How bad could $\|A^k\|$ be when $\rho(A) < 1-\delta$ [closed]
Gelfand's formula says that
$$\lim_{k\rightarrow \infty} \|A^k\|^{1/k} = \rho(A)$$
I am wondering whether there is any way to make this non-asymptotic. for example, I would like to have a set $S$ of matrices …
- 181
4
votes
2
answers
470
views
Non-asympototic version of Gelfand's formula
Let $A$ be a $n\times n$ matrix. Let $\|A\|$ be the spectral norm of $A$, and $\rho(A)$ be the spectral radius. I am wondering whether the following statement is true.
There exists universal constan …
- 181