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...
| Authors: | , , , |
|---|---|
| Format: | article |
| Publication Date: | 2015 |
| Country: | España |
| Institution: | Conselleria de Salut i Consum del Govern de les Illes Balears |
| Repository: | Docusalut |
| Language: | English |
| OAI Identifier: | oai:docusalut.com:20.500.13003/10666 |
| Online Access: | https://hdl.handle.net/20.500.13003/10666 |
| Access Level: | Open access |
| Keyword: | topological poset extended quasi-metric Hausdorff monotone fixed point asymptotic complexity analysis |
| Summary: | 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. |
|---|