Results 81 to 90 of about 65,905 (181)
Semantically Resolving Type Mismatches in Scientific Workflows
, 2007 Scientists are increasingly utilizing Grids to manage large data sets and execute scientific experiments on distributed resources. Scientific workflows are used as means for modeling and enacting scientific experiments.
Derouiche, Kheiredine, Nicole, Denis A
core
Common fixed points for weakly compatible maps
Proceedings Mathematical Sciences, 2001 The authors give a common fixed point theorem for four maps in a metric space. No relevant examples are given.
Chugh, Renu, Kumar, Sanjay
openaire +2 more sources
Common Fixed Point Theorems for Weakly Compatible Mappings
Rocky Mountain Journal of Mathematics, 2003 Let \((X,d)\) be a metric space, \(F\), \(G: X \multimap X\) be set-valued mappings and \(I\), \(J:X\to X\) two mappings. The author gives metric conditions which imply that there exists \(x \in X\) such that \(F(x)=G(x)=\{x\}\) and \(I(x)=J(x)=x\).
openaire +3 more sources
Occasionally weakly compatible mappings and fixed points
Bulletin of the Belgian Mathematical Society - Simon Stevin, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pant, R. P., Bisht, R. K.
openaire +3 more sources
Common fixed point theorems in 2 non-Archimedean Menger PM-space
International Journal of Mathematics and Mathematical Sciences, 2001 We introduce the concept of a 2 non-Archimedean Menger PM-space and prove a common fixed point theorem for weak compatible mappings of type (A).
Renu Chugh, Sumitra
doaj +1 more source
GENERAL FIXED POINT THEOREMS FOR WEAKLY COMPATIBLE MAPS
Demonstratio Mathematica, 2005 Summary: The purpose of this note is to use general expansive and conditions minimal type commutativity without continuity requirements to prove some fixed point theorems. The theorems extend known results from the class of compatible continuous expansive maps to a wider class of mappings.
openaire +1 more source
Time Blocks Decomposition of Multistage Stochastic Optimization Problems
, 2018 Multistage stochastic optimization problems are, by essence, complex because their solutions are indexed both by stages (time) and by uncertainties (scenarios). Their large scale nature makes decomposition methods appealing.The most common approaches are
Carpentier, Pierre +3 more
core
Compatible Mapping And Common Fixed Point For Five Mappings
, 2018 In this paper, it is proved that the existence of unique common fixed point theorem involving for five mappings with semi-compatibility, weak compatibility and commutativity on Metric space. This result improves and generalizes some known result of Imdad and Khan [7] by using functional expressions. Subject Classification.
openaire +1 more source
Common fixed point theorems for compatible and weakly compatible mappings
, 2000 The authors prove a common fixed points theorem for a pair of generalized contraction self-maps and a pair of set-valued mappings on a complete metric space. They are using notions due to \textit{G. Jungck} [Int. J. Math. Math. Sci. 11, No. 2, 285-288 (1988; Zbl 0647.54035)].
Elamrani, M., Mehdaoui, B.
openaire +2 more sources
International Journal of Analysis and Applications, 2019 The aim of this paper is to introduce a new class of pair of contraction mappings, called φ − (γ, η, n, m)-contraction pairs, and obtain common fixed point theorems for a pair of mappings in this class, satisfying a weakly compatible condition.
Hasanen A. Hammad, Manuel De la Sen
doaj +2 more sources