• Title/Summary/Keyword: mapping space

Search Result 1,044, Processing Time 0.026 seconds

APPROXIMATING FIXED POINTS OF NONEXPANSIVE TYPE MAPPINGS IN BANACH SPACES WITHOUT UNIFORM CONVEXITY

  • Sahu, Daya Ram;Khan, Abdul Rahim;Kang, Shin Min
    • Bulletin of the Korean Mathematical Society
    • /
    • v.50 no.3
    • /
    • pp.1007-1020
    • /
    • 2013
  • Approximate fixed point property problem for Mann iteration sequence of a nonexpansive mapping has been resolved on a Banach space independent of uniform (strict) convexity by Ishikawa [Fixed points and iteration of a nonexpansive mapping in a Banach space, Proc. Amer. Math. Soc. 59 (1976), 65-71]. In this paper, we solve this problem for a class of mappings wider than the class of asymptotically nonexpansive mappings on an arbitrary normed space. Our results generalize and extend several known results.

A NEW ITERATION METHOD FOR FIXED POINT OF NONEXPANSIVE MAPPING IN UNIFORMLY CONVEX BANACH SPACE

  • Omprakash, Sahu;Amitabh, Banerjee;Niyati, Gurudwan
    • Korean Journal of Mathematics
    • /
    • v.30 no.4
    • /
    • pp.665-678
    • /
    • 2022
  • The aim of this paper is to introduce a new iterative process and show that our iteration scheme is faster than other existing iteration schemes with the help of numerical examples. Next, we have established convergence and stability results for the approximation of fixed points of the contractive-like mapping in the framework of uniformly convex Banach space. In addition, we have established some convergence results for the approximation of the fixed points of a nonexpansive mapping.

MULTIDIMENSIONAL COINCIDENCE POINT RESULTS FOR CONTRACTION MAPPING PRINCIPLE

  • Handa, Amrish
    • The Pure and Applied Mathematics
    • /
    • v.26 no.4
    • /
    • pp.277-288
    • /
    • 2019
  • The main objective of this article is to establish some coincidence point theorem for g-non-decreasing mappings under contraction mapping principle on a partially ordered metric space. Furthermore, we constitute multidimensional results as a simple consequences of our unidimensional coincidence point theorem. Our results improve and generalize various known results.

CONTINUITY OF AN APPROXIMATE JORDAN MAPPING

  • Lee, Young-Whan
    • Communications of the Korean Mathematical Society
    • /
    • v.20 no.3
    • /
    • pp.505-509
    • /
    • 2005
  • We show that every $\varepsilon-approximate$ Jordan functional on a Banach algebra A is continuous. From this result we obtain that every $\varepsilon-approximate$ Jordan mapping from A into a continuous function space C(S) is continuous and it's norm less than or equal $1+\varepsilon$ where S is a compact Hausdorff space. This is a generalization of Jarosz's result [3, Proposition 5.5].

On Intuitionistic Fuzzy Generalized Topological Spaces (Intuitionistic Fuzzy Generalized Topological Spaces 관한 연구)

  • Min, Won-Keun
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.19 no.5
    • /
    • pp.725-729
    • /
    • 2009
  • In this paper, we introduce the concepts of intuitionistic fuzzy generalized topological spaces and intuitionistic gradation of generalized openness. We also introduce the concepts of IFG-mapping, weak IFG-mapping and IFG-open mapping, and obtain some characterizations for such mappings.

STRONG CONVERGENCE THEOREMS FOR NONEXPANSIVE MAPPINGS AND INVERSE-STRONGLY-MONOTONE MAPPINGS IN A BANACH SPACE

  • Liu, Ying
    • East Asian mathematical journal
    • /
    • v.26 no.5
    • /
    • pp.627-639
    • /
    • 2010
  • In this paper, we introduce a new iterative sequence finding a common element of the set of fixed points of a nonexpansive mapping and the set of solutions of the variational inequality for an inverse-strongly-monotone mapping in a Banach space. Then we show that the sequence converges strongly to a common element of two sets. Using this result, we consider the problem of finding a common element of the set of fixed points of a nonexpansive mapping and the set of zeros of an inverse-strongly-monotone mapping, the fixed point problem and the classical variational inequality problem. Our results improve and extend the corresponding results announced by many others.

Solution Space of Inverse Differential Kinematics (역미분기구학의 해 공간)

  • Kang, Chul-Goo
    • The Journal of Korea Robotics Society
    • /
    • v.10 no.4
    • /
    • pp.230-244
    • /
    • 2015
  • Continuous-path motion control such as resolved motion rate control requires online solving of the inverse differential kinematics for a robot. However, the solution space of the inverse differential kinematics related to Jacobian J is not well-established. In this paper, the solution space of inverse differential kinematics is analyzed through categorization of mapping conditions between joint velocities and end-effector velocity of a robot. If end-effector velocity is within the column space of J, the solution or the minimum norm solution is obtained. If it is not within the column space of J, an approximate solution by least-squares is obtained. Moreover, this paper introduces an improved mapping diagram showing orthogonality and mapping clearly between subspaces, and concrete examples numerically showing the concept of several subspaces. Finally, a solver and graphics user interface (GUI) for inverse differential kinematics are developed using MATLAB, and the solution of inverse differential kinematics using the GUI is demonstrated for a vertically articulated robot.

A new Ensemble Clustering Algorithm using a Reconstructed Mapping Coefficient

  • Cao, Tuoqia;Chang, Dongxia;Zhao, Yao
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.7
    • /
    • pp.2957-2980
    • /
    • 2020
  • Ensemble clustering commonly integrates multiple basic partitions to obtain a more accurate clustering result than a single partition. Specifically, it exists an inevitable problem that the incomplete transformation from the original space to the integrated space. In this paper, a novel ensemble clustering algorithm using a newly reconstructed mapping coefficient (ECRMC) is proposed. In the algorithm, a newly reconstructed mapping coefficient between objects and micro-clusters is designed based on the principle of increasing information entropy to enhance effective information. This can reduce the information loss in the transformation from micro-clusters to the original space. Then the correlation of the micro-clusters is creatively calculated by the Spearman coefficient. Therefore, the revised co-association graph between objects can be built more accurately because the supplementary information can well ensure the completeness of the whole conversion process. Experiment results demonstrate that the ECRMC clustering algorithm has high performance, effectiveness, and feasibility.

Geometric analysis of mobile mapping images sequence

  • Kang, Zhizhong;Zhang, Zuxun
    • Proceedings of the KSRS Conference
    • /
    • 2003.11a
    • /
    • pp.183-185
    • /
    • 2003
  • Spatially referenced mobile mapping (MM) images contain rich information of man-made objects , e.g. road centerlines, buildings, light poles, traffic signs ,billboards and line trees etc. Therefore, the applications in transportation, urban 3D reconstruction, utility management are implemented increasingly. It’s a fundamental issue lies in MM image process that how to orient this image in the object space including interior orientation of camera and the exterior orientation of image. In this paper, the algorithm of automatic acquirement of DC (Digital Camera) parameters based on MM images is illustrated. And then, the mapping between image space and object space for MM images is described.

  • PDF