• Journal of applied mathematics & informatics
• /
• v.29 no.1_2
• /
• pp.293-309
• /
• 2011

The purpose of this article is to prove strong convergence theorems for weak relatively nonexpansive mapping which is firstly presented in this article. In order to get the strong convergence theorems for weak relatively nonexpansive mapping, the monotone CQ iteration method is presented and is used to approximate the fixed point of weak relatively nonexpansive mapping, therefore this article apply above results to prove the strong convergence theorems of zero point for maximal monotone operators in Banach spaces. Noting that, the CQ iteration method can be used for relatively nonexpansive mapping but it can not be used for weak relatively nonexpansive mapping. However, the monotone CQ method can be used for weak relatively nonexpansive mapping. The results of this paper modify and improve the results of S.Matsushita and W.Takahashi, and some others.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.6 no.2
• /
• pp.9-24
• /
• 2002

Total Variation(TV) regularization method is effective for reconstructing "blocky", discontinuous images from contaminated image with noise. But TV is represented by highly nonlinear integro-differential equation that is hard to solve. There have been much effort to obtain stable and fast methods. C. Vogel introduced "the Fixed Point Lagged Diffusivity Iteration", which solves the nonlinear equation by linearizing. In this paper, we apply multigrid(MG) method for cell centered finite difference (CCFD) to solve system arise at each step of this fixed point iteration. In numerical simulation, we test various images varying noises and regularization parameter $\alpha$ and smoothness $\beta$ which appear in TV method. Numerical tests show that the parameter ${\beta}$ does not affect the solution if it is sufficiently small. We compute optimal $\alpha$ that minimizes the error with respect to $L^2$ norm and $H^1$ norm and compare reconstructed images.

• Nonlinear Functional Analysis and Applications
• /
• v.27 no.1
• /
• pp.189-201
• /
• 2022

The aim of the current work is to investigate the numerical study of a nonlinear Volterra-Fredholm integro-differential equation with initial conditions. Our approximation techniques modified adomian decomposition method (MADM) and variational iteration method (VIM) are based on the product integration methods in conjunction with iterative schemes. The convergence of the proposed methods have been proved. We conclude the paper with numerical examples to illustrate the effectiveness of our methods.

• Journal of the Earthquake Engineering Society of Korea
• /
• v.10 no.2 s.48
• /
• pp.21-29
• /
• 2006

It is impractical to install sensors on every floor of a tall building to measure the full state vector because of the large number of degrees of freedom. This makes it necessary to introduce reduced order control. A kind of system reduction scheme (dynamic condensation method) is proposed in this paper. This method is iterative and Guyan condensation is looked upon as an initial approximation of the iteration. Since the reduced order system is updated repeatedly until a desired one is obtained, the accuracy of the reduced order system resulting from the proposed method is much higher than that obtained from the Guyan condensation method. An eigenvalue shilling technique is applied to accelerate the convergence of Iteration. Two schemes to establish the reduced order system by using the proposed method are also presented and discussed in this paper. The results for a tail building with active tuned mass damper show that the proposed method is efficient for the reduced order modelling and the accuracy is very close to exact only after two iterations.

• The Pure and Applied Mathematics
• /
• v.11 no.4
• /
• pp.293-308
• /
• 2004

Let K be a nonempty convex subset of an arbitrary Banach space X and $T\;:\;K\;{\rightarrow}\;K$ be a uniformly continuous strictly hemi-contractive operator with bounded range. We prove that certain Ishikawa iteration scheme with errors both converges strongly to a unique fixed point of T and is almost T-stable on K. We also establish similar convergence and almost stability results for strictly hemi-contractive operator $T\;:\;K\;{\rightarrow}\;K$, where K is a nonempty convex subset of arbitrary uniformly smooth Banach space X. The convergence results presented in this paper extend, improve and unify the corresponding results in Chang [1], Chang, Cho, Lee & Kang [2], Chidume [3, 4, 5, 6, 7, 8], Chidume & Osilike [9, 10, 11, 12], Liu [19], Schu [25], Tan & Xu [26], Xu [28], Zhou [29], Zhou & Jia [30] and others.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.7
• /
• pp.142-148
• /
• 2014

Krylov-Schur iteration method has been applied to the 3-Dim. resonant cavity of a cylindrical form. The vector Helmholtz equation has been analysed for the resonant field strength in homogeneous media by FEM. An eigen-equation has been constructed from element equations basing on tangential edges of the tetrahedra element. This equation made up of two square matrices associated with the curl-curl form of the Helmholtz operator. By performing Krylov-Schur iteration loops on them, Eigen-values and their modes have been determined from the diagonal components of the Schur matrices and its transforming matrices. Eigen-pairs as a result have been revealed visually in the schematic representations. The spectra have been compared with each other to identify the effect of boundary conditions.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.28 no.11
• /
• pp.880-885
• /
• 2017

In AD-MUSIC algorithm, DOD/DOA can be estimated without computationally expensive two-dimensional search. In this paper, to further reduce the computational complexity, the Newton type method has been applied to one-dimensional search. In this paper, we summarize the formulation of the AD-MUSIC algorithm, and present how to apply Newton-type iteration to AD-MUSIC algorithm for improvement of the accuracy of the DOD/DOA estimates. Numerical results are presented to show that the proposed scheme is efficient in the viewpoints of computational burden and estimation accuracy.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.41 no.4
• /
• pp.31-39
• /
• 2004

The ARM7 TDMI microprocessor employ a software routine iteration method in order to handle integer division operation, but this method has long execution time and many execution instruction. In this paper, we proposed ARM7 TDMI microprocessor with integer division instruction. To make this, we additionally defined UDIV instruction for unsigned integer division operation and SDIV instruction for signed integer division operation, and proposed ARM7 TDMI microprocessor data Path to apply division algorithm. Applied division algorithm is nonrestoring division algorithm and additive hardware is reduced using existent ARM data path. To verify the proposed method, we designed proposed method on RTL level using HDL, and conducted logic simulation. we estimated the number of execution cycles and the number of execution instructions as compared proposed method with a software routine iteration method, and compared with other published integer divider from the number of execution cycles and hardware size.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.3 no.2
• /
• pp.29-36
• /
• 1999

It is shown that a new Krylov subspace method for solving symmetric indefinite systems of linear equations can be obtained. We call the method as the projection method in this paper. The residual vector of the projection method is maintained at each iteration, which may be useful in some applications.

• Korean Journal of Remote Sensing
• /
• v.25 no.5
• /
• pp.455-464
• /
• 2009

Lee(2009) proposed the boundary-adaptive despeckling method using a Bayesian model which is based on the lognormal distribution for image intensity and a Markov random field(MRF) for image texture. This method employs the Point-Jacobian iteration to obtain a maximum a posteriori(MAP) estimate of despeckled imagery. The boundary-adaptive algorithm is designed to use less information from more distant neighbors as the pixel is closer to boundary. It can reduce the possibility to involve the pixel values of adjacent region with different characteristics. The boundary-adaptive scheme was comprehensively evaluated using simulation data and the effectiveness of boundary adaption was proved in Lee(2009). This study, as an extension of Lee(2009), has suggested a modified iteration algorithm of MAP estimation to enhance computational efficiency and to combine classification. The experiment of simulation data shows that the boundary-adaption results in yielding clear boundary as well as reducing error in classification. The boundary-adaptive scheme has also been applied to high resolution Terra-SAR data acquired from the west coast of Youngjong-do, and the results imply that it can improve analytical accuracy in SAR application.