| Publication Type |
technical report |
| School or College |
College of Engineering |
| Department |
Kahlert School of Computing |
| Program |
Advanced Research Projects Agency |
| Creator |
Sikorski, Kris |
| Other Author |
Shellman, S. |
| Title |
A note on optimal algorithms for fixed points |
| Date |
2009 |
| Description |
We present a constructive lemma that we believe will make possible the design of nearly optimal 0(dlog | ) cost algorithms for computing eresidual approximations to the fixed points of d-dimensional nonexpansive mappings with respect to the infinity norm. This lemma is a generalization of a two-dimensional result that we proved in [lj. |
| Type |
Text |
| Publisher |
University of Utah |
| Subject |
Fixed points; Constructive lemma |
| Subject LCSH |
Fixed point theory |
| Language |
eng |
| Bibliographic Citation |
Sikorski, K., & Shellman, S. (2009). A note on optimal algorithms for fixed points. UUCS-09-006. |
| Series |
University of Utah Computer Science Technical Report |
| Relation is Part of |
ARPANET |
| Rights Management |
©University of Utah |
| Format Medium |
application/pdf |
| Format Extent |
227,062 bytes |
| Source |
University of Utah School of Computing |
| ARK |
ark:/87278/s65m6qbq |
| Setname |
ir_uspace |
| ID |
706854 |
| Reference URL |
https://collections.lib.utah.edu/ark:/87278/s65m6qbq |
