Identifier to cite or link to this item: http://hdl.handle.net/20.500.13003/10666
On fixed point theory in topological posets, extended quasi-metric spaces and an application to asymptotic complexity of algorithms
StatisticsItem usage statistics
MetadataShow Dublin Core item record
Document typeresearch article
CitationShahzad N, Valero O, Alghamdi MA, Alghamdi Maryam A. On fixed point theory in topological posets, extended quasi-metric spaces and an application to asymptotic complexity of algorithms. Fixed Point Theory Appl. 2015 Oct 06;:179.
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.
asymptotic complexity analysis