• 호남수학학술지
• /
• 제39권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
• /
• 제33권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
• /
• 제18권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
• /
• 제10권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.

• 전자공학회논문지
• /
• 제50권5호
• /
• pp.3-8
• /
• 2013

본 연구에서는 다중 안테나 시스템 기반 반복 수신기의 동작 원리를 이해하고 연산량을 줄이기 위한 연구를 진행하였다. 기존의 반복 수신기는 고정된 횟수의 반복 수신을 하는 것에 비하여, 적응형 반복 결정 방법은 프레임의 상태에 따라 반복 횟수를 조절함으로써 수신기에서의 불필요한 동작을 제한하여 연산량을 절감시킬 수 있다. 모의실험 결과를 통하여, 제안된 기법이 시스템의 에러 성능은 유지시키면서 수신기의 평균 반복 횟수를 크게 감소시키는 것을 확인하였다.

• 대한수학회논문집
• /
• 제19권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.

• 대한수학회논문집
• /
• 제31권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.

• 한국전산유체공학회지
• /
• 제10권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.

• 전기전자학회논문지
• /
• 제11권4호
• /
• pp.198-204
• /
• 2007

본 논문에서는, 병렬 혹은 직렬적으로 연접된 트렐리스 부호화 변조 기법 (Trellis coded modulation: TCM)을 위한 간단한 구조를 가진 향상된 반복적 복호 기법들이 제안되며, 동시에 제안된 기법들의 성능을 기존 기법들과 비교 제시한다. 제안된 복호 알고리즘은 기존 알고리즘의 단순 변형을 통해서 구현될 수 있음에도 불구하고, 모의실험 결과는 제안된 기법들이 부가 백색 가우스 잡음 채널 (Additive white Gaussian noise channel: AWGN channel) 및 레일리 (Rayleigh) 페이딩 채널 상에서 상당한 부호 이득을 제공함을 보여 준다.

• 한국전산구조공학회:학술대회논문집
• /
• 한국전산구조공학회 2006년도 정기 학술대회 논문집
• /
• 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.