Ouafaa Bouftouh¹, Samir Kabbaj¹, Thabet Abdeljawad^2,3,*, Aziz Khan²

CMES-Computer Modeling in Engineering & Sciences, Vol.135, No.3, pp. 2649-2663, 2023, DOI:10.32604/cmes.2023.023496

Abstract Generally, the field of fixed point theory has attracted the attention of researchers in different fields of science and engineering due to its use in proving the existence and uniqueness of solutions of real-world dynamic models. C^*-algebra is being continually used to explain a physical system in quantum field theory and statistical mechanics and has subsequently become an important area of research. The concept of a C^*-algebra-valued metric space was introduced in 2014 to generalize the concept of metric space. In fact, It is a generalization by replacing the set of real numbers with a C^*-algebra. After that, this line… More >

Nawab Hussain^1,*, Saud M. Alsulami¹, Hind Alamri^1,2,*

CMES-Computer Modeling in Engineering & Sciences, Vol.135, No.3, pp. 2617-2648, 2023, DOI:10.32604/cmes.2023.023143

Abstract In this paper, we present the existence and uniqueness of fixed points and common fixed points for Reich and Chatterjea pairs of self-maps in complete metric spaces. Furthermore, we study fixed point theorems for Reich and Chatterjea nonexpansive mappings in a Banach space using the Krasnoselskii-Ishikawa iteration method associated with and consider some applications of our results to prove the existence of solutions for nonlinear integral and nonlinear fractional differential equations. We also establish certain interesting examples to illustrate the usability of our results. More >

Woong-Kee Loh^*

CMC-Computers, Materials & Continua, Vol.66, No.2, pp. 1251-1267, 2021, DOI:10.32604/cmc.2020.012763

Abstract Many database applications currently deal with objects in a metric space. Examples of such objects include unstructured multimedia objects and points of interest (POIs) in a road network. The M-tree is a dynamic index structure that facilitates an efficient search for objects in a metric space. Studies have been conducted on the bulk loading of large datasets in an M-tree. However, because previous algorithms involve excessive distance computations and disk accesses, they perform poorly in terms of their index construction and search capability. This study proposes two efficient M-tree bulk loading algorithms. Our algorithms minimize the number of distance computations… More >