On fixed point theory in topological posets, extended quasi-metric spaces and an application to asymptotic complexity of algorithms
In this paper we present a few fixed point results in the framework of topological posets. To this end, we introduce an appropriate notion of completeness and order-continuity. Special attention is paid to the case that the topology of the topological poset is induced by an extended quasi-metric. Fi...
Gespeichert in:
| Veröffentlicht in: | Fixed point theory and algorithms for sciences and engineering Jg. 2015; H. 1; S. 1 - 13 |
|---|---|
| Hauptverfasser: | , , , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Cham
Springer International Publishing
06.10.2015
Springer Nature B.V |
| Schlagworte: | |
| ISSN: | 1687-1812, 1687-1812, 2730-5422 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | In this paper we present a few fixed point results in the framework of topological posets. To this end, we introduce an appropriate notion of completeness and order-continuity. Special attention is paid to the case that the topology of the topological poset is induced by an extended quasi-metric. Finally, the applicability of the exposed results is illustrated providing a methodology to determine the asymptotic upper bound of the complexity of those algorithms whose running time of computing is the solution to a special type of recurrence equation. |
|---|---|
| Bibliographie: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 content type line 23 |
| ISSN: | 1687-1812 1687-1812 2730-5422 |
| DOI: | 10.1186/s13663-015-0419-x |