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

• Annals of Fuzzy Mathematics and Informatics
• /
• v.16 no.3
• /
• pp.337-361
• /
• 2018

We introduce and study some basic properties of rough $I_{\lambda}$-statistical convergent of weight g (A), where $g:{\mathbb{N}}^3{\rightarrow}[0,\;{\infty})$ is a function statisying $g(m,\;n,\;k){\rightarrow}{\infty}$ and $g(m,\;n,\;k){\not{\rightarrow}}0$ as $m,\;n,\;k{\rightarrow}{\infty}$ and A represent the RH-regular matrix and also prove the Korovkin approximation theorem by using the notion of weighted A-statistical convergence of weight g (A) limits of a triple sequence of Bernstein-Stancu polynomials.

• Bulletin of the Korean Mathematical Society
• /
• v.58 no.6
• /
• pp.1419-1443
• /
• 2021

The asymmetric Laplace distribution arises as a limiting distribution of geometric summations of independent and identically distributed random variables with finite second moments. The main purpose of this paper is to study the weak limit theorems for geometric summations of independent (not necessarily identically distributed) random variables together with convergence rates to asymmetric Laplace distributions. Using Trotter-operator method, the orders of approximations of the distributions of geometric summations by the asymmetric Laplace distributions are established in term of the "large-𝒪" and "small-o" approximation estimates. The obtained results are extensions of some known ones.

• East Asian mathematical journal
• /
• v.25 no.4
• /
• pp.415-423
• /
• 2009

In this paper, we consider the hybrid monotone projection algorithm for asymptotically quasi-pseudocontractive mappings. A strong convergence theorem is established in the framework of Hilbert spaces. Our results mainly improve the corresponding results announced by [H. Zhou, Demiclosedness principle with applications for asymptotically pseudo-contractions in Hilbert spaces, Nonlinear Anal. 70 (2009) 3140-3145] and also include Kim and Xu [T.H. Kim, H.K. Xu, Strong convergence of modified Mann iterations for asymptotically nonexpansive mappings and semigroups, Nonlinear Anal. 64 (2006) 1140-1152; Convergence of the modified Mann's iteration method for asymptotically strict pseudo-contractions, Nonlinear Anal. 68 (2008) 2828-2836] as special cases.

• Kyungpook Mathematical Journal
• /
• v.64 no.1
• /
• pp.69-94
• /
• 2024

In this paper, we introduce an inertial self-adaptive projection method using Bregman distance techniques for solving pseudomonotone equilibrium problems in reflexive Banach spaces. The algorithm requires only one projection onto the feasible set without any Lipschitz-like condition on the bifunction. Using this method, a strong convergence theorem is proved under some mild conditions. Furthermore, we include numerical experiments to illustrate the behaviour of the new algorithm with respect to the Bregman function and other algorithms in the literature.

• Bulletin of the Korean Mathematical Society
• /
• v.31 no.1
• /
• pp.105-113
• /
• 1994

In the course of study of dendroids, Czuba [3] introduced a notion of $R^{i}$ -continua which is a generalization of R-arc [1]. He showed a new class of non-contractible dendroids, namely of dendroids which contain an $R^{i}$ -continuum. Subsecequently Charatonik [2] attempted to extend the notion into hyperspace C(X) of metric continuum X. In so doing, there were some oversights in extending some of the results relating $R^{i}$ -continua of dendroids for metric continua. In fact, Proposition 1 in [2] is false (see example C below) and his proof of Theorem 6 in [2] is not correct (Take Example 4 in [4] with K = [e,e'] as an $R^{1}$-continuum of X and work it out. Then one seens that K not .mem. K as he claimed otherwise.). The aims of this paper are to introduce a notion of w-regular convergence which is weaker than 0-regular convergence and to prove that the w-regular convergence of a sequence {Xn}$^{\infty}$$_{n=1}$ to $X_{0}$ of subcontinua of a metric continuum X is a necessary and sufficient for the sequence {C( $X_{n}$)}$^{\infty}$$_{n=1}$ to converge to C( $X_{0}$ ), and also to prove that if a metric continuum X contains an $R^{i}$ -continuum with w-regular convergence, then the hyperspace C(X) of X contains $R^{i}$ -continuum.inuum.uum.

• Journal of applied mathematics & informatics
• /
• v.25 no.1_2
• /
• pp.425-434
• /
• 2007

We iteratively generate a sequence of measurable mappings and study necessary conditions for its convergence to a random fixed point of random nonexpansive operator. A random fixed point theorem for random nonexpansive operator, relaxing the convexity condition on the underlying space, is also proved. As an application, we obtained random fixed point theorems for Caristi type random operators.

• Bulletin of the Korean Mathematical Society
• /
• v.39 no.1
• /
• pp.43-51
• /
• 2002

The aim of this paper is to prove a convergence theorem of a generalized Ishikawa iteration sequence for two multi-valued strongly pseudo-contractive mappings by using an approximation method in real uniformly smooth Banach spaces. We generalize and extend the results of Chang and Chang, Cho, Lee, Jung, and Kang.

• Journal of applied mathematics & informatics
• /
• v.29 no.5_6
• /
• pp.1067-1074
• /
• 2011

In this paper, a preconditioned mixed-type splitting iterative method for solving the linear systems Ax = b is presented, where A is a Z-matrix. Then we also obtain some results to show that the rate of convergence of our method is faster than that of the preconditioned AOR (PAOR) iterative method and preconditioned SOR (PSOR) iterative method. Finally, we give one numerical example to illustrate our results.

• Journal of the Korean Mathematical Society
• /
• v.33 no.4
• /
• pp.983-992
• /
• 1996

Let p(x, dy) be a transition probability function on $(S, \rho)$, where S is a complete separable metric space. Then a Markov process $X_n$ which has p(x, dy) as its transition probability may be generated by random iterations of the form $X_{n+1} = f(X_n, \varepsilon_{n+1})$, where $\varepsilon_n$ is a sequence of independent and identically distributed random variables (See, e.g., Kifer(1986), Bhattacharya and Waymire(1990)).