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 linear-algebra
Search options not deleted
user 130361
Questions about the properties of vector spaces and linear transformations, including linear systems in general.
0
votes
1
answer
117
views
Matrix iteration for non-negative matrices. Does it converge to some eigenvector?
Let $A$ be a non-negative (entrywise) matrix such that $A(1,1)>0$. Set $u=(1,0,0,...,0)^T$. Is it always true that there exists a non-negative eigenvector $v$ of $A$ such that $\lim_{n\rightarrow\inft …
- 21
1
vote
Accepted
Matrix iteration for non-negative matrices. Does it converge to some eigenvector?
The statement is not true. Let $a>1$ and define
\begin{equation}
A:=\begin{bmatrix}1&0&0\\1&0&a\\0&a&0 \end{bmatrix}.
\end{equation}
Suppose there is $v\in\mathbb{R}^n\backslash\{0\}$ such that $\l …
- 21