• Bulletin of the Korean Mathematical Society
• /
• v.47 no.2
• /
• pp.295-305
• /
• 2010

In this paper, we show that the modified Mann iteration with errors converges strongly to fixed point for uniformly L-Lipschitzian asymptotically $\Phi$-pseudocontractive mappings in real Banach spaces. Meanwhile, it is proved that the convergence of Mann and Ishikawa iterations is equivalent for uniformly L-Lipschitzian asymptotically $\Phi$-pseudocontractive mappings in real Banach spaces. Finally, we obtain the convergence theorems of Ishikawa iterative sequence and the modified Ishikawa iterative process with errors.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.3C
• /
• pp.205-215
• /
• 2007

This paper presents low latency and/or computation algorithms of iterative codes of turbo codes, turbo product codes and low density parity check codes for use in wireless broadband communication systems. Due to high coding complexity of iterative codes, this paper focus on lower complexity and/or latency algorithms that are easily implementable in hardware and further accelerate the decoding speed.

• Korean Journal of Mathematics
• /
• v.25 no.1
• /
• pp.19-35
• /
• 2017

In this communication, we introduce an Ishikawa type iterative algorithm for finding the approximate solutions of a class of nonlinear set valued variational inclusion problems. We also establish a characterization of strong convergence of this iterative techniques.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.12
• /
• pp.62-70
• /
• 1996

Image restoration is the process which estimates the original image form the blurred image observed by the non-ideal imaging system with additivenoise. According to the regularized approach, the resotred image can be obtained by iterative methods or the constrained least square error(CLS) filter. Among those retoratin methods, despite of many advantages, iterative iamge restoration is limited in use because of slow convergence. In the present paper, fast iterative image restoration algorithms based on preconditoning are proposed. The preconditioner can be obtained by using the characteristics finite impulse response (FIR) filter structure.

• Honam Mathematical Journal
• /
• v.26 no.4
• /
• pp.391-399
• /
• 2004

In this paper, we develop an iterative algorithm for solving a class of nonlinear mixed implicit variational inequalities in Hilbert spaces. The resolvent operator technique is used to establish the equivalence between variational inequalities and fixed point problems. This equivalence is used to study the existence of a solution of nonlinear mixed implicit variational inequalities and to suggest an iterative algorithm for solving variational inequalities. In our results, we do not assume that the mapping is strongly monotone.

• Proceedings of the IEEK Conference
• /
• 2003.07a
• /
• pp.178-181
• /
• 2003

In this paper, it proposes the efficient iterative decoding stop criterion using the variance value of LLR. It is verifying that the proposal iterative decoding stop criterion can be reduced the average iterative decoding number compared to conventional schemes with a negligible degradation of the error performance.

• Bulletin of the Korean Mathematical Society
• /
• v.44 no.4
• /
• pp.861-870
• /
• 2007

In this paper, under suitable conditions, we show that the new class of iterative process with errors introduced by Li et al converges strongly to the unique solution of the equation involving strongly accretive operators in real Banach spaces. Furthermore, we prove that it is equivalent to the classical Ishikawa iterative sequence with errors.

• Journal of the Korean Mathematical Society
• /
• v.48 no.3
• /
• pp.487-497
• /
• 2011

In this paper we propose a simple iterative method for finding a root of a nonlinear equation. It is shown that the new method, which does not require any derivatives, has a quadratic convergence order. In addition, one can find that a hybrid method combined with the non-iterative method can further improve the convergence rate. To show the efficiency of the presented method we give some numerical examples.

• Bulletin of the Korean Mathematical Society
• /
• v.43 no.4
• /
• pp.847-860
• /
• 2006

In this paper, some new convergence theorems of the modified Ishikawa and Mann iterative sequences with errors for asymptotically set-valued pseudocontractive mappings in uniformly smooth Banach spaces are given.

• The Pure and Applied Mathematics
• /
• v.27 no.1
• /
• pp.61-70
• /
• 2020

In this paper, we introduce a new concept of stability of coincidence iterative algorithm for three mappings and derive a new three-step Jungck-type iterative algorithm. And, we prove a stability result and a strong convergence result for the Jungck-type algorithm using the M_J-contractive condition. Our results extend and unify the corresponding ones in [3, 6, 7, 13].