In this paper, we improve some recent coupled fixed point resultsfor single-valued operators in the framework of ordered $b$-metricspaces established by Bota et al. [M-F. Bota, A. Petrusel, G.Petrusel and B. Samet, Coupled fixed point theorems forsingle-valued operators in b-metric spaces, Fixed Point TheoryAppl. (2015) 2015:231]. Also, we prove that Perov-type fix...

A new rank-two variable-metric method is derived using Greenstadt's variational approach [Math. Comp., this issue]. Like the Davidon-Fletcher-Powell (DFP) variable-metric method, the new method preserves the positive-definiteness of the approximating matrix. Together with Greenstadt's method, the new method gives rise to a one-parameter family of variable-metric methods that includes the DFP an...

Latency measures the delay caused by communication between processors and memory modules over the network in a parallel system. Using intensive measurements and simulation, we show that network latency forms a major obstacle to improve parallel computing performance and scalability. We present an experimental metric, using network latency to measure and evaluate the scalability of parallel prog...

Metric nearness refers to the problem of optimally restoring metric properties to distance measurements that happen to be non-metric due to measurement errors or otherwise. Metric data can be important in various settings, for example in clustering, classification, metric-based indexing, query processing and graph theoretic approximation algorithms. This paper formulates and solves the metric n...

A new method for solving domain equations in categories of metric spaces is studied. The categories CMS≈ and KMS≈ are introduced, having complete and compact metric spaces as objects and -adjoint pairs as arrows. The existence and uniqueness of fixed points for certain endofunctors on these categories is established. The classes of complete and compact metric spaces are considered as pseudo-met...

The main purpose of this research is to extend some fixed point results in orthogonal metric spaces. For this purpose, first, we investigate new mappings in this spaces. We introduce the new notions of functions. Then by using it, we define contractive mappings and then we establish and prove some fixed point theorems for such mappings in orthogonal metric spaces. Then by utilizing examples of ...

A new method for solving domain equations in categories of metric spaces is studied. The categories CMS and KMS are introduced, having complete and compact metric spaces as objects and-adjoint pairs as arrows. The existence and uniqueness of xed points for certain endofunctors on these categories is established. The classes of complete and compact metric spaces are considered as pseudo-metric s...

In this paper, a new complexity metric based on cognitive informatics is proposed for object oriented(OO) code. This is the single metric, which covers cognitive complexity of the OO system, method complexity and complexity due to inheritance together. The proposed metric was evaluated against Weyuker set of measurement principles. It was found that seven Weyuker properties are satisfied by thi...

In this paper, a concept of generalized weakly contraction mappings in partially ordered fuzzy metric spaces is introduced and  coincidence point  theorems on partially ordered fuzzy metric spaces are proved. Also, as the corollary of these theorems, some common fixed point theorems on partially ordered fuzzy metric spaces are presented.

In this paper, we define the concepts of modified intuitionistic probabilistic metric spaces, the property (E.A.) and  the common property (E.A.) in   modified  intuitionistic probabilistic metric spaces.Then, by the commonproperty (E.A.), we prove some common fixed point theorems in modified intuitionistic Menger probabilistic metric spaces satisfying an implicit relation.