• The Pure and Applied Mathematics
• /
• v.28 no.1
• /
• pp.61-69
• /
• 2021

In this paper, we introduce a new three-step iterative scheme for three finite families of nonexpansive mappings in hyperbolic spaces. And, we establish a strong convergence and a ∆-convergence of a given iterative scheme to a common fixed point for three finite families of nonexpansive mappings in hyperbolic spaces. Our results generalize and unify the several main results of [1, 4, 5, 9].

• Journal of applied mathematics & informatics
• /
• v.20 no.1_2
• /
• pp.465-478
• /
• 2006

In this paper, we introduce a new class of completely generalized strongly nonlinear quasivariational inequalities and establish its equivalence with a class of fixed point problems by using the resolvent operator technique. Utilizing this equivalence, we develop a three-step iterative scheme with errors, obtain a few existence theorems of solutions for the completely generalized non-linear strongly quasivariational inequality involving relaxed monotone, relaxed Lipschitz, strongly monotone and generalized pseudocontractive mappings and prove some convergence and stability results of the sequence generated by the three-step iterative scheme with errors. Our results include several previously known results as special cases.

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

In this paper, we present the three-step mean value iterative scheme and prove that the iteration sequence converge strongly to a common element of the set of fixed points of a nonexpansive mappings and the set of the solutions of the variational inclusions under some mild conditions. The results presented in this paper extend, generalize and improve the results of Noor and Huang and some others.

• Kyungpook Mathematical Journal
• /
• v.55 no.3
• /
• pp.667-678
• /
• 2015

The aim of this paper is to prove strong convergence theorem by a modified three step iterative process with errors for three nonexpansive mappings in the frame work of uniformly smooth Banach spaces. The main feature of this scheme is that its special cases can handle both strong convergence like Halpern type and weak convergence like Ishikawa type iteration schemes. Our result extend and generalize the result of S. H. Khan, Kim and Xu and many other authors.

• 한국전산유체공학회:학술대회논문집
• /
• 1995.10a
• /
• pp.82-89
• /
• 1995

In the present paper, a method of nearly orthogonal grid generation in an arbitrary simply-connected 3D domain will be presented. The method is a new direct and non-iterative scheme based on the concept of the decomposition of the global orthogonal transformation into consecutive mapping of a conformal mapping and an auxiliary orthogonal mapping, which was suggested by King and Leal [4]. In our numerical scheme. Kang and Leal's method is extended from 2D problems to 3D problems while the advantage of the non-iterative algorithm is maintained. The essence of the present mapping method is that an iterative scheme can be avoided by introducing a preliminary step. This preliminary step corresponds to a conformal map and is based on the boundary element method(BEM). This scheme is applied to generate several nearly-orthogonal grid systems which are orthogonal at boundaries.

• Nonlinear Functional Analysis and Applications
• /
• v.27 no.4
• /
• pp.785-795
• /
• 2022

In this paper, we introduce a Mann-like three step iteration method and show that it can be used to approximate the fixed point of a weak contraction mapping. Furthermore, we prove that this scheme is equivalent to the Mann iterative scheme. A comparison is made with the other third order iterative methods. Results are presented in a table to support our conclusion.

• Journal of applied mathematics & informatics
• /
• v.26 no.1_2
• /
• pp.325-336
• /
• 2008

In this paper, we prove the weak and strong convergence of the three-step iterative scheme with errors to a common fixed point for two asymptotically nonexpansive mappings in a uniformly convex Banach space under a condition weaker than compactness. Our theorems improve and generalize some previous results.

• The Pure and Applied Mathematics
• /
• v.11 no.4
• /
• pp.337-348
• /
• 2004

In this paper, we suggest and analyze Noor (three-step) iterative scheme for solving nonlinear strongly accretive operator equation Tχ = f. The results obtained in this paper represent an extension as well as refinement of previous known results.

• Korean Journal of Mathematics
• /
• v.31 no.3
• /
• pp.269-294
• /
• 2023

The purpose of this paper is to introduce a new three-step iterative process and show that our iteration scheme is faster than other existing iteration schemes in the literature. We provide a numerical example supported by graphs and tables to validate our proofs. We also prove 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 weak and strong convergence theorems for nonexpansive mappings.

• Nuclear Engineering and Technology
• /
• v.43 no.6
• /
• pp.531-546
• /
• 2011

The backward differentiation formula (BDF) method is applied to a three-dimensional reactor kinetics calculation for efficient yet accurate transient analysis with adaptive time step control. The coarse mesh finite difference (CMFD) formulation is used for an efficient implementation of the BDF method that does not require excessive memory to store old information from previous time steps. An iterative scheme to update the nodal coupling coefficients through higher order local nodal solutions is established in order to make it possible to store only node average fluxes of the previous five time points. An adaptive time step control method is derived using two order solutions, the fifth and the fourth order BDF solutions, which provide an estimate of the solution error at the current time point. The performance of the BDF- and CMFD-based spatial kinetics calculation and the adaptive time step control scheme is examined with the NEACRP control rod ejection and rod withdrawal benchmark problems. The accuracy is first assessed by comparing the BDF-based results with those of the Crank-Nicholson method with an exponential transform. The effectiveness of the adaptive time step control is then assessed in terms of the possible computing time reduction in producing sufficiently accurate solutions that meet the desired solution fidelity.