in the present paper, we give a new approach to caristi's fixed pointtheorem on non-archimedean fuzzy metric spaces. for this we define anordinary metric $d$ using the non-archimedean fuzzy metric $m$ on a nonemptyset $x$ and we establish some relationship between $(x,d)$ and $(x,m,ast )$%. hence, we prove our result by considering the original caristi's fixedpoint theorem.

‎‎Many authors such as Amini-Harandi‎, ‎Rezapour ‎et al., ‎Kadelburg ‎et al.‎‎, ‎have tried to find at least one fixed point for quasi-contractions when $alphain[frac{1}{2}‎, ‎1)$ but no clear answer exists right now and many of them either have failed or changed to a lighter version‎. In this paper‎, ‎we introduce some new strict fixed point results in the set of multi-valued '{C}iri'{c}-gener...

*Correspondence: [email protected]; [email protected] Department of Mathematics, Dong Thap University, Dong Thap, Dong Thap, Vietnam Abstract In this paper, we prove a fixed point theorem on a 2-metric space and show that the main results in Lahiri et al. (Taiwan. J. Math. 15:337-352, 2011) and Singh et al. (J. Adv. Math. Stud. 5:71-76, 2012) may be obtained easily from the axioms...

We introduce a new approach to Nehari’s problem. This approach is based on some kind of fixed point theorem and allows us to obtain some useful generalizations of Nehari’s and Adamyan – Arov – Krein (AAK) theorems. Among those generalizations: descriptions of Hankel operators in weighted 2 spaces; descriptions of Hankel operators from Dirichlet type spaces to weighted Bergman spaces; commutant ...

The solution for the above formulated problems are well known (Anderson, Moore, 1990), (Kuo, 1992), but there are some difficulties in implementation of the algorithms. The solution to the P1 problem is usually presented as an open loop control u(k) because the feedback control u(x(k)) has a complicated form. The P2 problem is the most frequently meet linear quadratic problem with finite final ...

We present the PFix algorithm for the fixed point problem f ðxÞ 1⁄4 x on a nonempty domain 1⁄2a; b ; where dX1; a; bAR ; and f is a Lipschitz continuous function with respect to the infinity norm, with constant qp1: The computed approximation x̃ satisfies the residual criterion jj f ðx̃Þ x̃jjNpe; where e40: In general, the algorithm requires no more than Pd i1⁄41s i function component evaluations,...

The purpose of this work is to introduce and study an iterative method to approximate solutions of a hierarchical fixed point problem and a variational inequality problem involving a finite family of nonexpansive mappings on a real Hilbert space. Further, we prove that the sequence generated by the proposed iterative method converges to a solution of the hierarchical fixed point problem for a f...

In this paper, the concept of the strongly monotone type mapping is introduced, which contains the strongly monotone mapping and firmly type nonexpansive mapping as special cases. We show the equivalence between the fixed point problem and the complementarity problem of strongly monotone type mapping. Furthermore, it is obtained that an iteration sequence strongly converges to a unique solution...

While the 3-dimensional analogue of the Sperner problem in the plane was known to be PPAD-complete, the complexity of the 2DSPERNER itself is not known to be PPAD-complete or not. In this paper, we settle this open problem proposed by Papadimitriou [7] fifteen years ago. This also allows us to derive the computational complexity characterization of a discrete version of the 2-dimensional Brouwe...