We provide fuzzy quasi-metric versions of a fixed point theorem ofGregori and Sapena for fuzzy contractive mappings in G-complete fuzzy metricspaces and apply the results to obtain fixed points for contractive mappingsin the domain of words.

In this paper, we focus on the application of the Peaceman-Rachford splitting method (PRSM) to a convex minimization model with linear constraints and a separable objective function. Compared to the Douglas-Rachford splitting method (DRSM), another splitting method from which the alternating direction method of multipliers originates, PRSM requires more restrictive assumptions to ensure its con...

In this paper, we consider double sequence iteration processes for strongly $rho$-contractive mapping in modular space. It is proved, these sequences, convergence strongly to a fixed point of the strongly $rho$-contractive mapping.

‎‎‎Recently Samet et al. introduced the notion of $alpha$-$psi$-contractive type mappings and established some fixed point theorems in complete metric spaces. In this paper, we introduce $alpha$-$(psi,varphi)$-contractive mappings and stablish coincidence and common fixed point theorems for two mapping in complete metric spaces. We present some examples to illustrate our results. As application...

In this paper, we introduce a new concept in set-valued mappings which we have called condition $(UHS)$. Then, adding this condition to a new type of contractive set-valued mappings, recently has been introduced by Amini-Harandi [Fixed and coupled fixed points of a new type contractive set-valued mapping in complete metric spaces, Fixed point theory and applications, 215 (2012)], we prove that ...

We study the robustness of quantum computers under the influence of errors modelled by strictly contractive channels. A channel T is defined to be strictly contractive if, for any pair of density operators ρ, σ in its domain, ‖Tρ− Tσ‖1 ≤ k ‖ρ− σ‖1 for some 0 ≤ k < 1 (here ‖·‖1 denotes the trace norm). In other words, strictly contractive channels render the states of the computer less distingui...

Important problems in wireless networks can often be solved by computing fixed points of standard or contractive interference mappings, and the conventional fixed point algorithm is widely used for this purpose. Knowing that the mapping used in the algorithm is not only standard but also contractive (or only contractive) is valuable information because we obtain a guarantee of geometric converg...

We show that every logmodular subalgebra of Mn(C) is unitary equivalent to an algebra of block upper triangular matrices, which was conjectured in [5]. In particular, this shows that every unital contractive representation of a logmodular subalgebra of Mn(C) is automatically completely contractive.

A new method is given to optimize parameters of a dynamical model by supplementing the conventional methods with a contractive mapping procedure. Numerical results indicate that the present method is more efficient than conventional methods. Key-Words: Parameter optimization; Contractive mapping; Complexity