• Title/Summary/Keyword: S-iteration process

Search Result 107, Processing Time 0.028 seconds

CONVERGENCE TO COMMON FIXED POINTS FOR A FINITE FAMILY OF GENERALIZED ASYMPTOTICALLY QUASI-NONEXPANSIVE MAPPINGS IN BANACH SPACES

  • Saluja, G.S.
    • East Asian mathematical journal
    • /
    • v.29 no.1
    • /
    • pp.23-37
    • /
    • 2013
  • The purpose of this paper is to study an implicit iteration process with errors and establish weak and strong convergence theorems to converge to common fixed points for a finite family of generalized asymptotically quasi-nonexpansive mappings in the framework of uniformly convex Banach spaces. Our results extend, improve and generalize some known results from the existing literature.

ITERATIVE PROCESS WITH ERRORS FOR m-ACCRETIVE OPERATORS

  • Baek, J.H;Cho, Y.J.;Chang, S.S
    • Journal of the Korean Mathematical Society
    • /
    • v.35 no.1
    • /
    • pp.191-205
    • /
    • 1998
  • In this paper, we prove that the Mann and Ishikawa iteration sequences with errors converge strongly to the unique solution of the equation x + Tx = f, where T is an m-accretive operator in uniformly smooth Banach spaces. Our results extend and improve those of Chidume, Ding, Zhu and others.

  • PDF

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

CONVERGENCE THEOREMS FOR TWO NONLINEAR MAPPINGS IN CAT(0) SPACES

  • Sokhuma, Kritsana;Sokhuma, Kasinee
    • Nonlinear Functional Analysis and Applications
    • /
    • v.27 no.3
    • /
    • pp.499-512
    • /
    • 2022
  • In this paper, we construct an iteration scheme involving a hybrid pair of the Suzuki generalized nonexpansive single-valued and multi-valued mappings in a complete CAT(0) space. In process, we remove a restricted condition (called end-point condition) in Akkasriworn and Sokhuma's results [2] in Banach spaces and utilize the same to prove some convergence theorems. The results in this paper, are analogs of the results of Akkasriworn et al. [3] in Banach spaces.

STRONG CONVERGENCE OF MONOTONE CQ ITERATIVE PROCESS FOR ASYMPTOTICALLY STRICT PSEUDO-CONTRACTIVE MAPPINGS

  • Zhang, Hong;Su, Yongfu;Li, Mengqin
    • Journal of applied mathematics & informatics
    • /
    • v.27 no.3_4
    • /
    • pp.763-771
    • /
    • 2009
  • T.H. Kim, H.K. Xu, [Convergence of the modified Mann's iteration method for asymptotically strict pseudo-contractions, Nonlinear Anal.(2007),doi:l0.l016/j.na.2007.02.029.] proved the strong convergence for asymptotically strict pseudo-contractions by the classical CQ iterative method. In this paper, we apply the monotone CQ iterative method to modify the classical CQ iterative method of T.H. Kim, H.K. Xu, and to obtain the strong convergence theorems for asymptotically strict pseudo-contractions. In the proved process of this paper, Cauchy sequences method is used, so we complete the proof without using the demi-closedness principle, Opial's condition or others about weak topological technologies. In addition, we use a ingenious technology to avoid defining that F(T) is bounded. On the other hand, we relax the restriction on the control sequence of iterative scheme.

  • PDF

Optimum design of cable-stayed bridges

  • Long, Wenyi;Troitsky, Michael S.;Zielinski, Zenon A.
    • Structural Engineering and Mechanics
    • /
    • v.7 no.3
    • /
    • pp.241-257
    • /
    • 1999
  • This paper presents a procedure to minimize the cost of materials of cable-stayed bridges with composite box girder and concrete tower. Two sets of iterations are included in the proposed procedure. The first set of iteration performs the structural analysis for a cable-stayed bridge. The second set of iteration performs the optimization process. The design is formulated as a general mathematical problem with the cost of the bridge as the objective function and bending forces, shear forces, fatigue stresses, buckling and deflection as constraints. The constraints are developed based on the Canadian National Standard CAN/CSA-S6-88. The finite element method is employed to perform the complicated nonlinear structural analysis of the cable-stayed bridges. The internal penalty function method is used in the optimization process. The limit states design method is used to determine the load capacity of the bridge. A computer program written in FORTRAN 77 is developed and its validity is verified by several practical-sized designs.

WEAK AND STRONG CONVERGENCE FOR QUASI-NONEXPANSIVE MAPPINGS IN BANACH SPACES

  • Kim, Gang-Eun
    • Bulletin of the Korean Mathematical Society
    • /
    • v.49 no.4
    • /
    • pp.799-813
    • /
    • 2012
  • In this paper, we first show that the iteration {$x_n$} defined by $x_{n+1}=P((1-{\alpha}_n)x_n +{\alpha}_nTP[{\beta}_nTx_n+(1-{\beta}_n)x_n])$ converges strongly to some fixed point of T when E is a real uniformly convex Banach space and T is a quasi-nonexpansive non-self mapping satisfying Condition A, which generalizes the result due to Shahzad [11]. Next, we show the strong convergence of the Mann iteration process with errors when E is a real uniformly convex Banach space and T is a quasi-nonexpansive self-mapping satisfying Condition A, which generalizes the result due to Senter-Dotson [10]. Finally, we show that the iteration {$x_n$} defined by $x_{n+1}={\alpha}_nSx_n+{\beta}_nT[{\alpha}^{\prime}_nSx_n+{\beta}^{\prime}_nTx_n+{\gamma}^{\prime}_n{\upsilon}_n]+{\gamma}_nu_n$ converges strongly to a common fixed point of T and S when E is a real uniformly convex Banach space and T, S are two quasi-nonexpansive self-mappings satisfying Condition D, which generalizes the result due to Ghosh-Debnath [3].

Relaxation algorithm to solve correspondence problem based on possibility distribution (정합 문제 해결을 위한 가능도 기반의 이완 처리 알고리즘)

  • 한규필;김용석;박영식;송근원;하영호
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.34S no.9
    • /
    • pp.109-117
    • /
    • 1997
  • A new relaxation algorithm based on distribution of matched errors and possibility is proposed to solve efficiently correspondence problem. This algorithm can be applied to various method, such as BMA, feature-, and region-based matching methods, by modifying its smoothness function. It consists of two stages which are transformation and iteration process. In transformation stage, the errors obtained by any matching algorithm are transformed to possibility values according to these statistical distribution. Each grade of possility is updated by some constraints which are defined as smoothness, uniqueness, and discontinuity factor in iteration stage. The discontinuity factor is used to reserve discontinuity of disparity. In conventional methods, it is difficult to find proper weights and stop condition, because only two factors, smoothness and uniqueness, have been used. However, in the proposed mthod, the more smoothing is not ocurred because of discontinuity factor. And it is efective to the various image, even if the image has a severe noise and repeating patterns. In addition, it is shown that the convergence rate and the quality of output are improved.

  • PDF

STATIONARY SOLUTIONS FOR ITERATED FUNCTION SYSTEMS CONTROLLED BY STATIONARY PROCESSES

  • Lee, O.;Shin, D.W.
    • Journal of the Korean Mathematical Society
    • /
    • v.36 no.4
    • /
    • pp.737-746
    • /
    • 1999
  • We consider a class of discrete parameter processes on a locally compact Banach space S arising from successive compositions of strictly stationary random maps with state space C(S,S), where C(S,S) is the collection of continuous functions on S into itself. Sufficient conditions for stationary solutions are found. Existence of pth moments and convergence of empirical distributions for trajectories are proved.

  • PDF