• Honam Mathematical Journal
• /
• v.39 no.1
• /
• pp.1-25
• /
• 2017

In this paper, we introduce a new scheme namely: CUIA-iterative scheme and utilize the same to prove a strong convergence theorem for quasi contractive mappings in Banach spaces. We also establish the equivalence of our new iterative scheme with various iterative schemes namely: Picard, Mann, Ishikawa, Agarwal et al., Noor, SP, CR etc for quasi contractive mappings besides carrying out a comparative study of rate of convergences of involve iterative schemes. The present new iterative scheme converges faster than above mentioned iterative schemes whose detailed comparison carried out with the help of different tables and graphs prepared with the help of MATLAB.

• East Asian mathematical journal
• /
• v.33 no.1
• /
• pp.11-22
• /
• 2017

The aim of this paper is to obtain equivalence of convergence between some iterative schemes for generalized ${\varphi}$-weak contraction mapping in CAT(0) spaces.

• Korean Journal of Mathematics
• /
• v.18 no.3
• /
• pp.299-309
• /
• 2010

In this paper, we study the first order nonlinear neutral difference equation: $${\Delta}(x(n)+px(n-{\tau}))+f(n,x(n-c),x(n-d))=r(n),\;n{\geq}n_0$$. Using the Banach fixed point theorem, we prove the existence of bounded positive solutions of the equation, suggest Mann iterative schemes of bounded positive solutions, and discuss the error estimates between bounded positive solutions and sequences generated by Mann iterative schemes.

• Journal of applied mathematics & informatics
• /
• v.10 no.1_2
• /
• pp.261-275
• /
• 2002

Let T be a local strongly accretive operator from a real uniformly smooth Banach space X into itself. It is proved that Ishikawa iterative schemes with errors converge strongly to a unique solution of the equations T$\_$x/ = f and x + T$\_$x/ = f, respectively, and are almost T$\_$b/-stable. The related results deal with the strong convergence and almost T$\_$b/-stability of Ishikawa iterative schemes with errors for local strongly pseudocontractive operators.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.5
• /
• pp.3-8
• /
• 2013

We consider some adaptive iteration schemes that provide lower complexity of the iterative receiver by reducing unnecessary iterations. While conventional iterative receiver considers only fixed number of iterations, we apply adaptive iteration schemes, taking into account quality of the received frame. Based on simulation results, proposed schemes reduce average number of iterations while maintaining BER performance compared to the conventional scheme.

• Communications of the Korean Mathematical Society
• /
• v.19 no.2
• /
• pp.267-281
• /
• 2004

In this paper, we establish almost stability of Ishikawa iterative schemes with errors for the classes of Lipschitz $\phi$-strongly quasi-accretive operators and Lipschitz $\phi$-hemicontractive operators in arbitrary Banach spaces. The results of this paper extend a few well-known recent results.

• Communications of the Korean Mathematical Society
• /
• v.31 no.1
• /
• pp.147-161
• /
• 2016

In this paper, we study the strong convergence and stability of a new two step random iterative scheme with errors for accretive Lipschitzian mapping in real Banach spaces. The new iterative scheme is more acceptable because of much better convergence rate and less restrictions on parameters as compared to random Ishikawa iterative scheme with errors. We support our analytic proofs by providing numerical examples. Applications of random iterative schemes with errors to variational inequality are also given. Our results improve and establish random generalization of results obtained by Chang [4], Zhang [31] and many others.

• Journal of computational fluids engineering
• /
• v.10 no.1
• /
• pp.67-72
• /
• 2005

This research is based on the iterative space-marching method for incompressible and compressible Navier-Stokes equations[1-4]. A principle of parallel computational schemes construction for steady and unsteady problems is suggested. It is analytically proven that convergence of these schemes is unconditional for incompressible case. When the parallel scheme is used the total volume of computations is the sum of a large number of independent and equal parts. Estimation of the speed-up K shows that K > 1000 in ideal case. First results of using the parallel schemes are presented.

• Journal of IKEEE
• /
• v.11 no.4
• /
• pp.198-204
• /
• 2007

For parallel and serially concatenated trellis coded modulation (TCM), improved iterative decoding schemes with a simple mechanism are proposed and their performances are compared with those of conventional decoding schemes. Simulation results have shown that the proposed schemes have provided a considerable decoding gain in additive white Gaussian noise (AWGN) channels and Rayleigh fading channels, even if they can be implemented by a simple modification of conventional decoding algorithms.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2006.04a
• /
• pp.1048-1055
• /
• 2006

Two ways can be used for dynamic condensation of viscously damped structural models. One is reducing the model in physical space at first and then transferring it to state space. The other is ,condensing the model in state space directly. Two iterative schemes for each way are given respectively. Hence four iterative schemes for dynamic condensation of nonclassically damped models are discussed in this paper. A high building with a tuned mass damper is applied to show the efficiency of these schemes.