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

In this paper, a new class of general nonlinear variational inclusions involving H-monotone is introduced and studied in Hilbert spaces. By applying the resolvent operator associated with H-monotone, we prove the existence and uniqueness theorems of solution for the general nonlinear variational inclusion, construct an iterative algorithm for computing approximation solution of the general nonlinear variational inclusion and discuss the convergence of the iterative sequence generated by the algorithm. The results presented in this paper improve and extend many known results in recent literatures.

• Journal of the Korean Mathematical Society
• /
• v.53 no.1
• /
• pp.89-114
• /
• 2016

In this paper, we introduce and study an explicit hybrid relaxed extragradient iterative method to approximate a common solution to generalized mixed equilibrium problem and fixed point problem for a nonexpansive semigroup in Hilbert space. Further, we prove that the sequence generated by the proposed iterative scheme converges strongly to the common solution to generalized mixed equilibrium problem and fixed point problem for a nonexpansive semigroup. This common solution is the unique solution of a variational inequality problem and is the optimality condition for a minimization problem. The results presented in this paper are the supplement, improvement and generalization of the previously known results in this area.

• Journal of applied mathematics & informatics
• /
• v.28 no.5_6
• /
• pp.1467-1476
• /
• 2010

The aim of this paper is to propose a cubic convergent regula falsi iterative method for solving the nonlinear equation f(x) = 0, where f : [a,b] $\subset$ R $\rightarrow$ R is a continuously differentiable. In [3,6] a quadratically convergent regula falsi iterative methods for solving this nonlinear equations is proposed. It is shown there that both the sequences of diameters and iterative points sequence converge to zero simultaneously. So The aim of this paper is to accelerate further the convergence of these methods from quadratic to cubic. This is done by replacing the parameter p in the iteration of [3,5,6] by a function p(x) defined suitably. The convergence analysis is carried out for the method. The method is tested on number of numerical examples and results obtained shows that our methods are better and more effective and comparable to well-known methods.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.1B
• /
• pp.99-104
• /
• 2000

In this paper, as a digital watermark we propose to use a chaotic sequence instead of the conventional Gaussian sequence. It is relatively easy to generate the chaotic sequence and is very sensitive to the change of initial value. The chaotic sequence adopted in this paper is a modified version of logistic map to give the sequence distribution of Chebyshev map. In the experiments, we applied the Gaussian sequence and chaotic sequence to wavelet coefficients of images to compare the similarity distribution. The results show that, as id the DCT-based watermarking system, the chaotic sequence is robust for various signal processing attacks, Moreover, the similarity variance is smaller than the Gaussian sequence for iterative experiments. It also shows a better performance for compression errors than the Gaussian sequence.

• Bulletin of the Korean Mathematical Society
• /
• v.39 no.2
• /
• pp.269-276
• /
• 2002

Let E be a real Banach space. Let T : E longrightarrow E be a map with F(T) : = { x $\in$ E : Tx = x} $\neq$ 0 and satisfying the accretive-type condition $\lambda\$\mid$x-Tx\$\mid$^2$, for all $x\inE,\;x^*\inf(T)\;and\;\lambda >0$. We prove some necessary and sufficient conditions for the convergence of the Mann iterative sequence to a fixed point of T.

• Kyungpook Mathematical Journal
• /
• v.54 no.1
• /
• pp.103-111
• /
• 2014

Let X be a uniformly convex Banach space, and S, T be pair of mean nonexpansive mappings. Some necessary and sufficient conditions are given for Ishikawa iterative sequence converge to common fixed points, and we prove that the sequence of Ishikawa iterations associated with S and T converges to the common fixed point of S and T. This generalizes former results proved by Z. Gu and Y. Li [4].

• Proceedings of the KIEE Conference
• /
• 1988.07a
• /
• pp.240-242
• /
• 1988

This paper proposes an improved ART (Algebraic Reconstruction technique) algorithm. This algorithm is an iterative one with iteration sequence criteria based on the discrepancy between measurement and pseudo-projection data. The simulation result using the proposed algorithm shows a significant improvement in convergency rate over the conventional ART algorithm.

• Kyungpook Mathematical Journal
• /
• v.63 no.3
• /
• pp.451-461
• /
• 2023

In this paper, we study the fixed point property for generalized asymptotically nonexpansive mappings in the setting of p-Hadamard spaces, with p ≥ 2. We prove the strong convergence of the sequence generated by the modified two-step iterative sequence for finding a fixed point of a generalized asymptotically nonexpansive mapping in p-Hadamard spaces.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.23 no.1
• /
• pp.85-95
• /
• 2012

In this thesis, we develop a spectral analysis scheme to eliminate the spurious peaks generated in HRR Millimeterwave Seeker based on FMICW system. In contrast to FMCW system, FMICW system generates spurious peaks in the spectrum of its IF signal, caused by the periodic discontinuity of the signal. These peaks make the accuracy of the system depend on the previously estimated range if a band pass filter is utilized to eliminate them and noise floor go to high level if random interrupted sequence is utilized and in case of using staggering process, we must transmit several waveforms to obtain overlapped information. Using the spectral analysis one of the schemes such as IAA(Iterative Adaptive Approach) and SPICE(SemiParametric Iterative Covariance-based Estimation method) which were introduced recently, the spurious peaks can be eliminated effectively. In order to utilize IAA and SPICE, since we must distinguish between reliable data and unreliable data and only use reliable data, STFT(Short Time Fourier Transform) is applied to the distinguishment process.

• 제어로봇시스템학회:학술대회논문집
• /
• 1988.10a
• /
• pp.326-331
• /
• 1988

In this paper, an iterative leaning control algorithm for the linear discrete system is proposed. Based upon the parameter estimation method, the learning for good tracking control is acqured through a sequence of repetitive operations. A series of simulation are performed to show the validity of this algorithm.