• Title/Summary/Keyword: fixed point

Search Result 2,671, Processing Time 0.032 seconds

FIXED POINT OF α - ψ - CONTRACTIVE MULTIFUNCTION IN FUZZY METRIC SPACES

  • KUMAR, MOHIT;ARORA, RIITU
    • Journal of applied mathematics & informatics
    • /
    • v.35 no.3_4
    • /
    • pp.323-330
    • /
    • 2017
  • Recently Samet, Vetro and Vetro introduced the notion of ${\alpha}$-${\Psi}$-contractive type mappings and initiated some fixed point theorems in complete metric spaces. The notion of ${\alpha}_*$ - ${\Psi}$-contractive multifunctions and initiated some fixed point results by Hasanzade Asl et. al. [8]. In this paper, we introduced the notion of ${\alpha}_*$ - ${\Psi}$-contractive multifunctions in a fuzzy metric space and gave fixed point results for these multifunctions in complete fuzzy metric spaces. We also obtain a fixed point results for self-maps in complete fuzzy metric spaces satisfying contractive condition.

COMMON FIXED POINT THEOREMS FOR CONTRACTIVE TYPE MAPPINGS AND THEIR APPLICATIONS IN DYNAMIC PROGRAMMING

  • Liu, Zeqing;Wang, Lili;Kim, Hyeong-Kug;Kang, Shin-Min
    • Bulletin of the Korean Mathematical Society
    • /
    • v.45 no.3
    • /
    • pp.573-585
    • /
    • 2008
  • A few sufficient conditions for the existence and uniqueness of fixed point and common fixed point for certain contractive type mappings in complete metric spaces are provided. Several existence and uniqueness results of solution and common solution for some functional equations and system of functional equations in dynamic programming are discussed by using the fixed point and common fixed point theorems presented in this paper.

Common fixed point theorem for a sequence of mappings in intuitionistic fuzzy metric space

  • Park, Jong-Seo;Kang, Hong-Jae
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.7 no.1
    • /
    • pp.30-33
    • /
    • 2007
  • Park and Kim [4], Grabiec [1] studied a fixed point theorem in fuzzy metric space, and Vasuki [8] proved a common fixed point theorem in a fuzzy metric space. Park, Park and Kwun [6] defined the intuitionistic fuzzy metric space in which it is a little revised in Park's definition. Using this definition, Park, Kwun and Park [5] and Park, Park and Kwun [7] proved a fixed point theorem in intuitionistic fuzzy metric space. In this paper, we will prove a common fixed point theorem for a sequence of mappings in a intuitionistic fuzzy metric space. Our result offers a generalization of Vasuki's results [8].

Related Fixed Point Theorem for Six Mappings on Three Fuzzy Metric Spaces

  • Sharma, Sushil;Tilwankar, Prashant
    • Kyungpook Mathematical Journal
    • /
    • v.51 no.4
    • /
    • pp.365-374
    • /
    • 2011
  • Related fixed point theorems on two or three metric spaces have been prove in different ways. However, so for the related fixed point theorem on fuzzy metric space have not been proved. Sharma, Deshpande and Thakur were the first who have establishe related fixed point theorem for four mappings on two complete fuzzy metric spaces. Their work was maiden in this line. In this paper we obtain a related fixed point theorem for six mappings on three complete fuzzy metric spaces. Of course this is a new result on this line.

A Fixed-Point Error Analysis of fast DCT Algorithms (고정 소수점 연산에 의한 고속 DCT 알고리듬의 오차해석)

  • 연일동;이상욱
    • The Transactions of the Korean Institute of Electrical Engineers
    • /
    • v.40 no.4
    • /
    • pp.331-341
    • /
    • 1991
  • The discrete cosine transform (DCT) is widely used in many signal processing areas, including image and speech data compression. In this paper, we investigate a fixed-point error analysis for fast DCT algorithms, namely, Lee [6], Hou [7] and Vetterli [8]. A statistical model for fixed-point error is analyzed to predict the output noise due to the fixed-point implementation. This paper deals with two's complement fixed-point data representation with truncation and rounding. For a comparison purpose, we also investigate the direct form DCT algorithm. We also propose a suitable scaling model for the fixed-point implementation to avoid an overflow occurring in the addition operation. Computer simulation results reveal that there is a close agreement between the theoretical and the experimental results. The result shows that Vetterli's algorithm is better than the other algorithms in terms of SNR.

  • PDF

Fixed-point Iteration for the Plastic Deformation Analysis of Anisotropic Materials (이방성 재료의 소성변형 해석을 위한 고정점 축차)

  • Seung-Yong Yang;Jeoung Han Kim
    • Journal of Powder Materials
    • /
    • v.30 no.1
    • /
    • pp.29-34
    • /
    • 2023
  • A fixed-point iteration is proposed to integrate the stress and state variables in the incremental analysis of plastic deformation. The Conventional Newton-Raphson method requires a second-order derivative of the yield function to generate a complicated code, and the convergence cannot be guaranteed beforehand. The proposed fixed-point iteration does not require a second-order derivative of the yield function, and convergence is ensured for a given strain increment. The fixed-point iteration is easier to implement, and the computational time is shortened compared with the Newton-Raphson method. The plane-stress condition is considered for the biaxial loading conditions to confirm the convergence of the fixed-point iteration. 3-dimensional tensile specimen is considered to compare the computational times in the ABAQUS/explicit finite element analysis.

A study on the extended fixed-point arithmetic computation for MPEG audio data processing (MPEG Audio 데이터 처리를 위한 확장된 고정소수점 연산처리에 관한 연구)

  • 한상원;공진흥
    • Proceedings of the IEEK Conference
    • /
    • 2000.06b
    • /
    • pp.250-253
    • /
    • 2000
  • In this paper, we Implement a new arithmetic computation for MPEG audio data to overcome the limitations of real number processing in the fixed-point arithmetics, such as: overheads in processing time and power consumption. We aims at efficiently dealing with real numbers by extending the fixed-point arithmetic manipulation for floating-point numbers in MPEG audio data, and implementing the DSP libraries to support the manipulation and computation of real numbers with the fixed-point resources.

  • PDF

On the iteration of holomorphic mappings in $ $

  • Kwon, Oh-Nam
    • Communications of the Korean Mathematical Society
    • /
    • v.11 no.3
    • /
    • pp.681-694
    • /
    • 1996
  • Let F be a germ of analytic transformation from $(C^2, O)$ to $C^2, O)$. Let a, b denote the eigenvalues of DF(O). O is called a semi-attrative fixed point if $$\mid$a$\mid$ = 1, 0 < $\mid$b$\mid$ < 1 = 1, 0 < $\mid$a$\mid$ < 1)$. O is called a super-attractive fixed point if a = 0, b = 0. We discuss such a mapping from the point of view of dynamical systems.

  • PDF

FIXED POINT PROPERTY AND COMPLETENESS OF ORDERED SETS

  • Kang, Byung-Gai
    • The Pure and Applied Mathematics
    • /
    • v.4 no.1
    • /
    • pp.19-26
    • /
    • 1997
  • In this paper, we characterize the existence of fixed points of a multivalued function by the existence of complete preorder on the given domain. Also we investigate relations between the completeness of a given order and the fixed point property of some multivalued functions.

  • PDF