• Title/Summary/Keyword: Iteration

Search Result 1,885, Processing Time 0.028 seconds

A CONVERGENCE THEOREM ON QUASI-ϕ-NONEXPANSIVE MAPPINGS

  • Kang, Shin Min;Cho, Sun Young;Kwun, Young Chel;Qin, Xiaolong
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.23 no.1
    • /
    • pp.73-82
    • /
    • 2010
  • In an infinite-dimensional Hilbert space, the normal Mann iteration has only weak convergence, in general, even for nonexpansive mappings. The purpose of this paper is to modify the normal Mann iteration to have strong convergence for a closed quasi-$\phi$-nonexpansive mapping in the framework of Banach spaces.

STRONG CONVERGENCE THEOREM OF FIXED POINT FOR RELATIVELY ASYMPTOTICALLY NONEXPANSIVE MAPPINGS

  • Qin, Xiaolong;Kang, Shin Min;Cho, Sun Young
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.21 no.3
    • /
    • pp.327-337
    • /
    • 2008
  • In this paper, we prove strong convergence theorems of Halpern iteration for relatively asymptotically nonexpansive mappings in the framework of Banach spaces. Our results extend and improve the recent ones announced by [C. Martinez-Yanes, H. K. Xu, Strong convergence of the CQ method for fixed point iteration processes, Nonlinear Anal. 64 (2006), 2400-2411], [X. Qin, Y. Su, Strong convergence theorem for relatively nonexpansive mappings in a Banach space, Nonlinear Anal. 67 (2007), 1958-1965] and many others.

  • PDF

The performance estimation of Channel coding schemes in Wideband Code Division Multiple Access System with fading channel (페이딩 환경의 W-CDMA에서 채널부호화 방식의 성능평가)

  • 이종목;심용걸
    • Proceedings of the IEEK Conference
    • /
    • 2000.11a
    • /
    • pp.165-168
    • /
    • 2000
  • The bit error rate(BER)of the data passed through Wideband-Code Division Multiple Access (W-CDMA) system with turbo-codes structure is presented. The performance of turbo-codes under W-CDMA system is estimated for various users and iteration numbers of decoding. The channel model is Additive White Gaussian Noise(AWGN) and Rayleigh fading channel. When iteration number increases, bit error probability of turbo-codes decreases. and when the number of users increase, bit error probability of turbo-codes increases.

  • PDF

ON ASYMPTOTICALLY DEMICONTRACTIVE MAPPINGS IN ARBITRARY BANACH SPACES

  • Rafiq, Arif;Lee, Byung Soo
    • East Asian mathematical journal
    • /
    • v.28 no.5
    • /
    • pp.569-578
    • /
    • 2012
  • In this paper, the necessary and sufficient conditions for the strong convergence of a modified Mann iteration process to a fixed point of an asymptotically demicontractive mapping in real Banach spaces are considered. Presented results improve and extend the results of Igbokwe [3], Liu [4], Moore and Nnoli [6] and Osilike [7].

A NEW ITERATION SCHEME FOR A HYBRID PAIR OF NONEXPANSIVE MAPPINGS

  • Uddin, Izhar;Imdad, Mohammad
    • Honam Mathematical Journal
    • /
    • v.38 no.1
    • /
    • pp.127-139
    • /
    • 2016
  • In this paper, we construct an iteration scheme involving a hybrid pair of nonexpansive mappings and utilize the same to prove some convergence theorems. In process, we remove a restricted condition (called end-point condition) in Sokhuma and Kaewkhao's results [Sokhuma and Kaewkhao, Fixed Point Theory Appl. 2010, Art. ID 618767, 9 pp.].

NUMERICAL METHODS SOLVING THE SEMI-EXPLICIT DIFFERENTIAL-ALGEBRAIC EQUATIONS BY IMPLICIT MULTISTEP FIXED STEP SIZE METHODS

  • Kulikov, G.Yu.
    • Journal of applied mathematics & informatics
    • /
    • v.4 no.2
    • /
    • pp.341-378
    • /
    • 1997
  • We consider three classes of numerical methods for solv-ing the semi-explicit differential-algebraic equations of index 1 and higher. These methods use implicit multistep fixed stepsize methods and several iterative processes including simple iteration, full a2nd modified Newton iteration. For these methods we prove convergence theorems and derive error estimates. We consider different ways of choosing initial approximations for these iterative methods and in-vestigate their efficiency in theory and practice.

FUNCTIONAL ITERATIVE METHODS FOR SOLVING TWO-POINT BOUNDARY VALUE PROBLEMS

  • Lim, Hyo Jin;Kim, Kyoum Sun;Yun, Jae Heon
    • Journal of applied mathematics & informatics
    • /
    • v.31 no.5_6
    • /
    • pp.733-745
    • /
    • 2013
  • In this paper, we first propose a new technique of the functional iterative methods VIM (Variational iteration method) and NHPM (New homotopy perturbation method) for solving two-point boundary value problems, and then we compare their numerical results with those of the finite difference method (FDM).

A STUDY ON SINGULAR INTEGRO-DIFFERENTIAL EQUATION OF ABEL'S TYPE BY ITERATIVE METHODS

  • Behzadi, Sh.S.;Abbasbandy, S.;Allahviranloo, T.
    • Journal of applied mathematics & informatics
    • /
    • v.31 no.3_4
    • /
    • pp.499-511
    • /
    • 2013
  • In this article, Adomian decomposition method (ADM), variation iteration method(VIM) and homotopy analysis method (HAM) for solving integro-differential equation with singular kernel have been investigated. Also,we study the existence and uniqueness of solutions and the convergence of present methods. The accuracy of the proposed method are illustrated with solving some numerical examples.

SOME GLOBAL CONVERGENCE PROPERTIES OF THE LEVENBERG-MARQUARDT METHODS WITH LINE SEARCH

  • Du, Shou-Qiang
    • Journal of applied mathematics & informatics
    • /
    • v.31 no.3_4
    • /
    • pp.373-378
    • /
    • 2013
  • In this paper, we consider two kinds of the Levenberg-Marquardt method for solve a system of nonlinear equations. We use line search on every iteration to guarantee that the Levenberg-Marquardt methods are globally convergent. Under mild conditions, we prove that while the de- scent condition can be satisfied at the iteration of the Levenberg-Marquardt method, the global convergence of the method can be established.

Biased-Recovering Algorithm to Solve a Highly Correlated Data System (상관관계가 강한 독립변수들을 포함한 데이터 시스템 분석을 위한 편차 - 복구 알고리듬)

  • 이미영
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.28 no.3
    • /
    • pp.61-66
    • /
    • 2003
  • In many multiple regression analyses, the “multi-collinearity” problem arises since some independent variables are highly correlated with each other. Practically, the Ridge regression method is often adopted to deal with the problems resulting from multi-collinearity. We propose a better alternative method using iteration to obtain an exact least squares estimator. We prove the solvability of the proposed algorithm mathematically and then compare our method with the traditional one.