Prešić Type Operators on Ordered Vector Metric Spaces (original) (raw)
2021, Journal of Science and Arts
In this paper we present a fixed point theorem for order-preserving Prešić type operators on ordered vector metric spaces. This result extends many results in the literature obtained for Prešić type operators both on metric spaces and partially ordered metric spaces. We also emphasize the relationships between our work and the previous ones in the literature. Finally we give an example showing the fact that neither results for Prešić type contractions on metric spaces nor the results for ordered Prešić type contractions on ordered metric space is applicable to it.
Related papers
Transactions of the Japanese Society for Artificial Intelligence, 2005
This paper presents several extensions of order-sorted logic based on the notion of property classification in formal ontology. The refined order-sorted language contains types (as rigid sorts), anti-rigid sorts, and unary predicates in order to distinctly express the following properties: substantial sorts, nonsubstantial sorts, and non-sortal properties. For many separated knowledge bases constructed using the logic, we propose an enriched reasoning mechanism such that each independent knowledge base can extract rigid property information from other knowledge bases (called rigid property derivation). Additionally, we classify (i) anti-rigid properties on the basis of their dependences on time, situation, and belief and (ii) non-sortal properties on the basis of the countability of the elements of the properties.
Structured Singular Value of Symmetric Matrix and Its Lower Bound
Robust stability and performance analysis are reduced to the computation of a structured singular value problem. However its computation is a difficult task and forms a bottleneck of the analysis because it is based on the numerical optimization. We show that this computational burden can be reduced in the case where the matrix under consideration is symmetric. In this case, the computation is equivalent to the maximization of spectral radius over (S+w-1)-parameters, where S is the number of the repeated scalar blocks and w is the total size of full blocks.
Loading Preview
Sorry, preview is currently unavailable. You can download the paper by clicking the button above.