• Kyungpook Mathematical Journal
• /
• v.54 no.1
• /
• pp.103-111
• /
• 2014

Let X be a uniformly convex Banach space, and S, T be pair of mean nonexpansive mappings. Some necessary and sufficient conditions are given for Ishikawa iterative sequence converge to common fixed points, and we prove that the sequence of Ishikawa iterations associated with S and T converges to the common fixed point of S and T. This generalizes former results proved by Z. Gu and Y. Li [4].

• Journal of applied mathematics & informatics
• /
• v.30 no.1_2
• /
• pp.71-82
• /
• 2012

In this paper, we first show the weak convergence of the modified Ishikawa iteration process with errors of two total asymptotically nonexpansive mappings, which generalizes the result due to Khan and Fukhar-ud-din [1]. Next, we show the strong convergence of the modified Ishikawa iteration process with errors of two total asymptotically nonexpansive mappings satisfying Condition ($\mathbf{A}^{\prime}$), which generalizes the result due to Fukhar-ud-din and Khan [2].

• Journal of applied mathematics & informatics
• /
• v.27 no.3_4
• /
• pp.715-723
• /
• 2009

The aim of this paper is to present an explicit iteration method for finding a common fixed point of a finite family of strictly pseudocon-tractive mappings defined on q-uniformly smooth and uniformly convex Banach spaces.

• Communications of the Korean Mathematical Society
• /
• v.19 no.1
• /
• pp.63-74
• /
• 2004

Suppose that X is a real Banach space, K is a nonempty closed convex subset of X and T : $K\;\rightarrow\;K$ is a uniformly continuous ${\phi}$-hemicontractive operator or a Lipschitz ${\phi}-hemicontractive$ operator. In this paper we prove that under certain conditions the three-step iteration methods with errors converge strongly to the unique fixed point of T. Our results extend the corresponding results of Chang [1], Chang et a1. [2], Chidume [3]-[7], Chidume and Osilike [9], Deng [10], Liu and Kang [13], [14], Osilike [15], [16] and Tan and Xu [17].

• Communications of the Korean Mathematical Society
• /
• v.25 no.4
• /
• pp.571-581
• /
• 2010

Some convergence theorems for approximating to a common fixed point of an infinite family of strictly pseudocontractive mappings of Browder-Petryshyn type are proved in the setting of Banach spaces by using a new composite implicit iterative process with errors. The results presented in the paper generalize and improve the main results of Bai and Kim [1], Gu [4], Osilike [5], Su and Li [7], and Xu and Ori [8].

• 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.

• Journal of the Society of Naval Architects of Korea
• /
• v.46 no.3
• /
• pp.232-248
• /
• 2009

Numerical methodology to solve ship springing problem, which is basically fluid-structure interaction problem, was explored in this study. Solution of this hydroelasticity problem was sought by coupling higher order B-spline Rankine panel method and finite element method in time domain, each of which is introduced for fluid and structure domain respectively. Even though varieties of different combinations in terms of numerical scheme are possible and have been tried by many researchers to solve the problem, no systematic study regarding the characteristics of each scheme has been done so far. Here, extensive case studies have been done on the numerical schemes especially focusing on the iteration method, FE analysis of beam-like structure, handling of forward speed problem and so on. Two different iteration scheme, Newton style one and fixed point iteration, were tried in this study and results were compared between the two. For the solution of the FE-based equation of motion, direct integration and modal superposition method were compared with each other from the viewpoint of its efficiency and accuracy. Finally, calculation of second derivative of basis potential, which is difficult to obtain with accuracy within grid-based method like BEM was discussed.

• Aerospace Engineering and Technology
• /
• v.13 no.2
• /
• pp.60-65
• /
• 2014

In this paper, numerical integration method using operational matrix of integration is studied. Using the operational matrix of integration, modified fixed point iteration method is introduced in order to solve rapidly an initial value problem for non-linear equation of motion. As an example, an initial value problem for orbital motion is considered. Through the numerical example, it is shown that the algorithm is efficient from the computational time point of view.

• Journal of applied mathematics & informatics
• /
• v.29 no.1_2
• /
• pp.293-309
• /
• 2011

The purpose of this article is to prove strong convergence theorems for weak relatively nonexpansive mapping which is firstly presented in this article. In order to get the strong convergence theorems for weak relatively nonexpansive mapping, the monotone CQ iteration method is presented and is used to approximate the fixed point of weak relatively nonexpansive mapping, therefore this article apply above results to prove the strong convergence theorems of zero point for maximal monotone operators in Banach spaces. Noting that, the CQ iteration method can be used for relatively nonexpansive mapping but it can not be used for weak relatively nonexpansive mapping. However, the monotone CQ method can be used for weak relatively nonexpansive mapping. The results of this paper modify and improve the results of S.Matsushita and W.Takahashi, and some others.

• Nonlinear Functional Analysis and Applications
• /
• v.29 no.2
• /
• pp.307-332
• /
• 2024

Two inertial extragradient-type algorithms are introduced for solving convex pseudomonotone variational inequalities with fixed point problems, where the associated mapping for the fixed point is a 𝜌-demicontractive mapping. The algorithm employs variable step sizes that are updated at each iteration, based on certain previous iterates. One notable advantage of these algorithms is their ability to operate without prior knowledge of Lipschitz-type constants and without necessitating any line search procedures. The iterative sequence constructed demonstrates strong convergence to the common solution of the variational inequality and fixed point problem under standard assumptions. In-depth numerical applications are conducted to illustrate theoretical findings and to compare the proposed algorithms with existing approaches.