88,018 research outputs found
Fixed point results for generalized cyclic contraction mappings in partial metric spaces
Rus (Approx. Convexity 3:171–178, 2005) introduced the concept of cyclic contraction
mapping. P˘acurar and Rus (Nonlinear Anal. 72:1181–1187, 2010) proved some fixed
point results for cyclic φ-contraction mappings on a metric space. Karapinar (Appl. Math.
Lett. 24:822–825, 2011) obtained a unique fixed point of cyclic weak φ- contraction mappings
and studied well-posedness problem for such mappings. On the other hand, Matthews
(Ann. New York Acad. Sci. 728:183–197, 1994) introduced the concept of a partial metric
as a part of the study of denotational semantics of dataflow networks. He gave a modified
version of the Banach contraction principle, more suitable in this context. In this paper, we
initiate the study of fixed points of generalized cyclic contraction in the framework of partial
metric spaces. We also present some examples to validate our results.S. Romaguera acknowledges the support of the Ministry of Science and Innovation of Spain, grant MTM2009-12872-C02-01.Abbas, M.; Nazir, T.; Romaguera Bonilla, S. (2012). Fixed point results for generalized cyclic contraction mappings in partial metric spaces. Revista- Real Academia de Ciencias Exactas Fisicas Y Naturales Serie a Matematicas. 106(2):287-297. https://doi.org/10.1007/s13398-011-0051-5S2872971062Abdeljawad T., Karapinar E., Tas K.: Existence and uniqueness of a common fixed point on partial metric spaces. Appl. Math. Lett. 24(11), 1894–1899 (2011). doi: 10.1016/j.aml.2011.5.014Altun, I., Erduran A.: Fixed point theorems for monotone mappings on partial metric spaces. Fixed Point Theory Appl. article ID 508730 (2011). doi: 10.1155/2011/508730Altun I., Sadarangani K.: Corrigendum to “Generalized contractions on partial metric spaces” [Topology Appl. 157 (2010), 2778–2785]. Topol. Appl. 158, 1738–1740 (2011)Altun I., Simsek H.: Some fixed point theorems on dualistic partial metric spaces. J. Adv. Math. Stud. 1, 1–8 (2008)Altun I., Sola F., Simsek H.: Generalized contractions on partial metric spaces. Topol. Appl. 157, 2778–2785 (2010)Aydi, H.: Some fixed point results in ordered partial metric spaces. arxiv:1103.3680v1 [math.GN](2011)Boyd D.W., Wong J.S.W.: On nonlinear contractions. Proc. Am. Math. Soc. 20, 458–464 (1969)Bukatin M., Kopperman R., Matthews S., Pajoohesh H.: Partial metric spaces. Am. Math. Monthly 116, 708–718 (2009)Bukatin M.A., Shorina S.Yu. et al.: Partial metrics and co-continuous valuations. In: Nivat, M. (eds) Foundations of software science and computation structure Lecture notes in computer science vol 1378., pp. 125–139. Springer, Berlin (1998)Derafshpour M., Rezapour S., Shahzad N.: On the existence of best proximity points of cyclic contractions. Adv. Dyn. Syst. Appl. 6, 33–40 (2011)Heckmann R.: Approximation of metric spaces by partial metric spaces. Appl. Cat. Struct. 7, 71–83 (1999)Karapinar E.: Fixed point theory for cyclic weak -contraction. App. Math. Lett. 24, 822–825 (2011)Karapinar, E.: Generalizations of Caristi Kirk’s theorem on partial metric spaces. Fixed Point Theory Appl. 2011,4 (2011). doi: 10.1186/1687-1812-2011-4Karapinar E.: Weak -contraction on partial metric spaces and existence of fixed points in partially ordered sets. Math. Aeterna. 1(4), 237–244 (2011)Karapinar E., Erhan I.M.: Fixed point theorems for operators on partial metric spaces. Appl. Math. Lett. 24, 1894–1899 (2011)Karpagam S., Agrawal S.: Best proximity point theorems for cyclic orbital Meir–Keeler contraction maps. Nonlinear Anal. 74, 1040–1046 (2011)Kirk W.A., Srinavasan P.S., Veeramani P.: Fixed points for mapping satisfying cylical contractive conditions. Fixed Point Theory. 4, 79–89 (2003)Kosuru, G.S.R., Veeramani, P.: Cyclic contractions and best proximity pair theorems). arXiv:1012.1434v2 [math.FA] 29 May (2011)Matthews S.G.: Partial metric topology. in: Proc. 8th Summer Conference on General Topology and Applications. Ann. New York Acad. Sci. 728, 183–197 (1994)Neammanee K., Kaewkhao A.: Fixed points and best proximity points for multi-valued mapping satisfying cyclical condition. Int. J. Math. Sci. Appl. 1, 9 (2011)Oltra S., Valero O.: Banach’s fixed theorem for partial metric spaces. Rend. Istit. Mat. Univ. Trieste. 36, 17–26 (2004)Păcurar M., Rus I.A.: Fixed point theory for cyclic -contractions. Nonlinear Anal. 72, 1181–1187 (2010)Petric M.A.: Best proximity point theorems for weak cyclic Kannan contractions. Filomat. 25, 145–154 (2011)Romaguera, S.: A Kirk type characterization of completeness for partial metric spaces. Fixed Point Theory Appl. (2010, article ID 493298, 6 pages).Romaguera, S.: Fixed point theorems for generalized contractions on partial metric spaces. Topol. Appl. (2011). doi: 10.1016/j.topol.2011.08.026Romaguera S., Valero O.: A quantitative computational model for complete partial metric spaces via formal balls. Math. Struct. Comput. Sci. 19, 541–563 (2009)Rus, I.A.: Cyclic representations and fixed points. Annals of the Tiberiu Popoviciu Seminar of Functional equations. Approx. Convexity 3, 171–178 (2005), ISSN 1584-4536Schellekens M.P.: The correspondence between partial metrics and semivaluations. Theoret. Comput. Sci. 315, 135–149 (2004)Valero O.: On Banach fixed point theorems for partial metric spaces. Appl. Gen. Top. 6, 229–240 (2005)Waszkiewicz P.: Quantitative continuous domains. Appl. Cat. Struct. 11, 41–67 (2003
Topological and Computational Models for Fuzzy Metric Spaces via Domain Theory
This doctoral thesis is devoted to investigate the problem of establishing
connections between Domain Theory and the theory of fuzzy metric spaces, in
the sense of Kramosil and Michalek, by means of the notion of a formal ball,
and then constructing topological and computational models for (complete)
fuzzy metric spaces.
The antecedents of this research are mainly the well-known articles of A.
Edalat and R. Heckmann [A computational model for metric spaces, Theoret-
ical Computer Science 193 (1998), 53-73], and R. Heckmann [Approximation
of metric spaces by partial metric spaces, Applied Categorical Structures 7
(1999), 71-83], where the authors obtained nice and direct links between Do-
main Theory and the theory of metric spaces - two crucial tools in the study
of denotational semantics - by using formal balls.
Since every metric induces a fuzzy metric (the so-called standard fuzzy
metric), the problem of extending Edalat and Heckmann's works to the fuzzy
framework arises in a natural way.
In our study we essentially propose two di erent approaches. For the
rst one, valid for those fuzzy metric spaces whose continuous t-norm is
the minimum, we introduce a new notion of fuzzy metric completeness (the
so-called standard completeness) that allows us to construct a (topological)
model that includes the classical theory as a special case. The second one,
valid for those fuzzy metric spaces whose continuous t-norm is greater or
equal than the Lukasiewicz t-norm, allows us to construct, among other
satisfactory results, a fuzzy quasi-metric on the continuous domain of formal
balls whose restriction to the set of maximal elements is isometric to the
given fuzzy metric. Thus we obtain a computational model for complete
fuzzy metric spaces.
We also prove some new xed point theorems in complete fuzzy metric
spaces with versions to the intuitionistic case and the ordered case, respec-
tively.
Finally, we discuss the problem of extending the obtained results to the
asymmetric framework.Ricarte Moreno, L. (2013). Topological and Computational Models for Fuzzy Metric Spaces via Domain Theory [Tesis doctoral no publicada]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/34670TESI
Complete partial metric spaces have partially metrizable computational models
We show that the domain of formal balls of a complete partial metric space (X, p) can be endowed with a complete partial metric that extends p and induces the Scott topology. This result, that generalizes well-known constructions of Edalat and Heckmann [A computational model for metric spaces, Theoret. Comput. Sci. 193 (1998), pp. 53-73] and Heckmann [Approximation of metric spaces by partial metric spaces, Appl. Cat. Struct. 7 (1999), pp. 71-83] for metric spaces and improves a recent result of Romaguera and Valero [A quantitative computational model for complete partial metric spaces via formal balls, Math. Struct. Comput. Sci. 19 (2009), pp. 541-563], motivates a notion of a partially metrizable computational model which allows us to characterize those topological spaces that admit a compatible complete partial metric via this model.The authors acknowledge the support of the Spanish Ministry of Science and Innovation, under grant MTM2009-12872-C02-01.Romaguera Bonilla, S.; Tirado Peláez, P.; Valero Sierra, Ó. (2012). Complete partial metric spaces have partially metrizable computational models. International Journal of Computer Mathematics. 89(3):284-290. https://doi.org/10.1080/00207160.2011.559229S284290893ALI-AKBARI, M., HONARI, B., POURMAHDIAN, M., & REZAII, M. M. (2009). The space of formal balls and models of quasi-metric spaces. Mathematical Structures in Computer Science, 19(2), 337-355. doi:10.1017/s0960129509007439Edalat, A., & Heckmann, R. (1998). A computational model for metric spaces. Theoretical Computer Science, 193(1-2), 53-73. doi:10.1016/s0304-3975(96)00243-5Edalat, A., & Sünderhauf, P. (1999). Computable Banach spaces via domain theory. Theoretical Computer Science, 219(1-2), 169-184. doi:10.1016/s0304-3975(98)00288-6Flagg, B., & Kopperman, R. (1997). Computational Models for Ultrametric Spaces. Electronic Notes in Theoretical Computer Science, 6, 151-159. doi:10.1016/s1571-0661(05)80164-1Heckmann, R. (1999). Applied Categorical Structures, 7(1/2), 71-83. doi:10.1023/a:1008684018933Kopperman, R., Künzi, H.-P. A., & Waszkiewicz, P. (2004). Bounded complete models of topological spaces. Topology and its Applications, 139(1-3), 285-297. doi:10.1016/j.topol.2003.12.001Krötzsch, M. (2006). Generalized ultrametric spaces in quantitative domain theory. Theoretical Computer Science, 368(1-2), 30-49. doi:10.1016/j.tcs.2006.05.037Künzi, H.-P. A. (2001). Nonsymmetric Distances and Their Associated Topologies: About the Origins of Basic Ideas in the Area of Asymmetric Topology. History of Topology, 853-968. doi:10.1007/978-94-017-0470-0_3LAWSON, J. (1997). Spaces of maximal points. Mathematical Structures in Computer Science, 7(5), 543-555. doi:10.1017/s0960129597002363Martin, K. (1998). Domain theoretic models of topological spaces. Electronic Notes in Theoretical Computer Science, 13, 173-181. doi:10.1016/s1571-0661(05)80221-xMatthews, S. G.Partial metric topology. Procedings of the 8th Summer Conference on General Topology and Applications, Ann. New York Acad. Sci. 728 (1994), pp. 183–197Rodríguez-López, J., Romaguera, S., & Valero, O. (2008). Denotational semantics for programming languages, balanced quasi-metrics and fixed points. International Journal of Computer Mathematics, 85(3-4), 623-630. doi:10.1080/00207160701210653Romaguera, S., & Valero, O. (2009). A quasi-metric computational model from modular functions on monoids. International Journal of Computer Mathematics, 86(10-11), 1668-1677. doi:10.1080/00207160802691652ROMAGUERA, S., & VALERO, O. (2009). A quantitative computational model for complete partial metric spaces via formal balls. Mathematical Structures in Computer Science, 19(3), 541-563. doi:10.1017/s0960129509007671ROMAGUERA, S., & VALERO, O. (2010). Domain theoretic characterisations of quasi-metric completeness in terms of formal balls. Mathematical Structures in Computer Science, 20(3), 453-472. doi:10.1017/s0960129510000010Rutten, J. J. M. M. (1998). Weighted colimits and formal balls in generalized metric spaces. Topology and its Applications, 89(1-2), 179-202. doi:10.1016/s0166-8641(97)00224-1Schellekens, M. P. (2003). A characterization of partial metrizability: domains are quantifiable. Theoretical Computer Science, 305(1-3), 409-432. doi:10.1016/s0304-3975(02)00705-3Smyth, M. B. (2006). The constructive maximal point space and partial metrizability. Annals of Pure and Applied Logic, 137(1-3), 360-379. doi:10.1016/j.apal.2005.05.032Waszkiewicz, P. (2003). Applied Categorical Structures, 11(1), 41-67. doi:10.1023/a:1023012924892WASZKIEWICZ, P. (2006). Partial metrisability of continuous posets. Mathematical Structures in Computer Science, 16(02), 359. doi:10.1017/s096012950600519
Quasi-Triangular Spaces, Pompeiu-Hausdorff Quasi-Distances, and Periodic and Fixed Point Theorems of Banach and Nadler Types
Let C={Cα}α∈A∈[1;∞)A, A-index set. A quasi-triangular space (X,PC;A) is a set X with family PC;A={pα:X2→[0,∞), α∈A} satisfying ∀α∈A ∀u,v,w∈X {pα(u,w)≤Cα[pα(u,v)+pα(v,w)]}. For any PC;A, a left (right) family JC;A generated by PC;A is defined to be JC;A={Jα:X2→[0,∞), α∈A}, where ∀α∈A ∀u,v,w∈X {Jα(u,w)≤Cα[Jα(u,v)+Jα(v,w)]} and furthermore the property ∀α∈A {limm→∞pα(wm,um)=0} (∀α∈A {limm→∞pα(um,wm)=0}) holds whenever two sequences (um:m∈N) and (wm:m∈N) in X satisfy ∀α∈A {limm→∞supn>mJα(um,un)=0 and limm→∞Jα(wm,um)=0} (∀α∈A {limm→∞supn>mJα(un,um)=0 and limm→∞Jα(um,wm)=0}). In (X,PC;A), using the left (right) families JC;A generated by PC;A (PC;A is a special case of JC;A), we construct three types of Pompeiu-Hausdorff left (right) quasi-distances on 2X; for each type we construct of left (right) set-valued quasi-contraction T:X→2X, and we prove the convergence, existence, and periodic point theorem for such quasi-contractions. We also construct two types of left (right) single-valued quasi-contractions T:X→X and we prove the convergence, existence, approximation, uniqueness, periodic point, and fixed point theorem for such quasi-contractions. (X,PC;A) generalize ultra quasi-triangular and partiall quasi-triangular spaces (in particular, generalize metric, ultra metric, quasi-metric, ultra quasi-metric, b-metric, partial metric, partial b-metric, pseudometric, quasi-pseudometric, ultra quasi-pseudometric, partial quasi-pseudometric, topological, uniform, quasi-uniform, gauge, ultra gauge, partial gauge, quasi-gauge, ultra quasi-gauge, and partial quasi-gauge spaces)
Variational Methods for Evolution
The meeting focused on the last advances in the applications of variational methods to evolution problems governed by partial differential equations. The talks covered a broad range of topics, including large deviation and variational principles, rate-independent evolutions and gradient flows, heat flows in metric-measure spaces, propagation of fracture, applications of optimal transport and entropy-entropy dissipation methods, phase-transitions, viscous approximation, and singular-perturbation problems
Kernel-based discretisation for solving matrix-valued PDEs
In this paper, we discuss the numerical solution of certain matrix-valued partial differential equations. Such PDEs arise, for example, when constructing a Riemannian contraction metric for a dynamical system given by an autonomous ODE. We develop and analyse a new meshfree discretisation scheme using kernel-based approximation spaces. However, since these pproximation spaces have now to be matrix-valued, the kernels we need to use are fourth order tensors. We will review and extend recent results on even more general reproducing kernel Hilbert spaces. We will then apply this general theory to solve a matrix-valued PDE and derive error estimates for the approximate solution. The paper ends with applications to typical examples from dynamical system
Approximation in quantale-enriched categories
Our work is a fundamental study of the notion of approximation in
V-categories and in (U,V)-categories, for a quantale V and the ultrafilter
monad U. We introduce auxiliary, approximating and Scott-continuous
distributors, the way-below distributor, and continuity of V- and
(U,V)-categories. We fully characterize continuous V-categories (resp.
(U,V)-categories) among all cocomplete V-categories (resp. (U,V)-categories) in
the same ways as continuous domains are characterized among all dcpos. By
varying the choice of the quantale V and the notion of ideals, and by further
allowing the ultrafilter monad to act on the quantale, we obtain a flexible
theory of continuity that applies to partial orders and to metric and
topological spaces. We demonstrate on examples that our theory unifies some
major approaches to quantitative domain theory.Comment: 17 page
Variational Methods for Evolution: Abstracts from the workshop held December 4–10, 2011
The meeting focused on the last advances in the applications of
variational methods to evolution problems governed by partial differential
equations. The talks covered a broad range of topics, including large deviation
and variational principles, rate-independent evolutions and gradient
flows, heat flows in metric-measure spaces, propagation of fracture, applications
of optimal transport and entropy-entropy dissipation methods, phasetransitions,
viscous approximation, and singular-perturbation problems
A structure-preserving split finite element discretization of the split wave equations
We introduce a new finite element (FE) discretization framework applicable for covariant split equations. The introduction of additional differential forms (DF) that form pairs with the original ones permits the splitting of the equations into topological momentum and continuity equations and metric-dependent closure equations that apply the Hodge-star operator. Our discretization framework conserves this geometrical structure and provides for all DFs proper FE spaces such that the differential operators hold in strong form. We introduce lowest possible order discretizations of the split 1D wave equations, in which the discrete momentum and continuity equations follow by trivial projections onto piecewise constant FE spaces, omitting partial integrations. Approximating the Hodge-star by nontrivial Galerkin projections (GP), the two discrete metric equations follow by projections onto either the piecewise constant (GP0) or piecewise linear (GP1) space. Our framework gives us three schemes with significantly different behavior. The split scheme using twice GP1 is unstable and shares the dispersion relation with the P1-P1 FE scheme that approximates both variables by piecewise linear spaces (P1). The split schemes that apply a mixture of GP1 and GP0 share the dispersion relation with the stable P1-P0 FE scheme that applies piecewise linear and piecewise constant (P0) spaces. However, the split schemes exhibit second order convergence for both quantities of interest. For the split scheme applying twice GP0, we are not aware of a corresponding standard formulation to compare with. Though it does not provide a satisfactory approximation of the dispersion relation as short waves are propagated much too fast, the discovery of the new scheme illustrates the potential of our discretization framework as a toolbox to study and find FE schemes by new combinations of FE spaces
Approximation systems for functions in topological and in metric spaces
A notable feature of the TTE approach to computability is the representation
of the argument values and the corresponding function values by means of
infinitistic names. Two ways to eliminate the using of such names in certain
cases are indicated in the paper. The first one is intended for the case of
topological spaces with selected indexed denumerable bases. Suppose a partial
function is given from one such space into another one whose selected base has
a recursively enumerable index set, and suppose that the intersection of base
open sets in the first space is computable in the sense of Weihrauch-Grubba.
Then the ordinary TTE computability of the function is characterized by the
existence of an appropriate recursively enumerable relation between indices of
base sets containing the argument value and indices of base sets containing the
corresponding function value.This result can be regarded as an improvement of a
result of Korovina and Kudinov. The second way is applicable to metric spaces
with selected indexed denumerable dense subsets. If a partial function is given
from one such space into another one, then, under a semi-computability
assumption concerning these spaces, the ordinary TTE computability of the
function is characterized by the existence of an appropriate recursively
enumerable set of quadruples. Any of them consists of an index of element from
the selected dense subset in the first space, a natural number encoding a
rational bound for the distance between this element and the argument value, an
index of element from the selected dense subset in the second space and a
natural number encoding a rational bound for the distance between this element
and the function value. One of the examples in the paper indicates that the
computability of real functions can be characterized in a simple way by using
the first way of elimination of the infinitistic names.Comment: 21 pages, published in Logical Methods in Computer Scienc
- …