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 fixed-point-theorems
Search options not deleted
user 62673
A fixed-point theorem is a result saying that a function $F$ will have at least one fixed point (a point $x$ for which $F(x) = x$), under some conditions on $F$ that can be stated in general terms.
3
votes
0
answers
252
views
On the existence of fixed points of a matrix iteration
Let $A\in\mathbb{R}^{n\times n}$ be a Hurwitz stable matrix (i.e. all eigenvalues of $A$ have negative real part). Let $\succeq$ denote the standard partial order in the cone of positive semidefinite …
- 2,712
0
votes
0
answers
272
views
Fixed-point iteration depending on a parameter
Let $f\colon X\times \mathbb{R}\to X, (x,\varepsilon)\mapsto y$, with $X$ open, be a continuous function in both arguments. Consider the following fixed-point iteration
\begin{align}
x_{k+1} = f(x_k,\ …
- 2,712
3
votes
0
answers
558
views
On a matrix algorithm involving rank-one projections
Let $\{v_i\}_{i=1}^N$ be a set of $n$-dimensional real vectors spanning $\mathbb{R}^n$. Let $p\in [0,1]$ be a rational number and consider the iteration
\begin{equation}
X_{k+1}=\frac{1}{N}\sum_{i=1}^ …
- 2,712