• Journal of applied mathematics & informatics
• /
• v.27 no.3_4
• /
• pp.475-487
• /
• 2009

This paper studies the iteration method of solving a type of second-order three-point boundary value problem with non-linear term f, which depends on the first order derivative. By using the upper and lower method, we obtain the sufficient conditions of the existence and uniqueness of solutions. Furthermore, the monotone iterative sequences generated by the method contribute to the minimum solution and the maximum solution. And the error estimate formula is also given under the condition of unique solution. We apply the solving process to a special boundary value problem, and the result is interesting.

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

• Journal of Mechanical Science and Technology
• /
• v.20 no.11
• /
• pp.1950-1960
• /
• 2006

Based on Banach fixed point theorem, a method to calculate nonlinear superposition for three interacting Stokes' waves is proposed in this paper. A mathematical formulation for the nonlinear superposition in deep water and some numerical solutions were investigated. The authors carried out the numerical study with three progressive linear potentials of different wave numbers and succeeded in solving the nonlinear wave profiles of their three wave-interaction, that is, using only linear wave potentials, it was possible to realize the corresponding nonlinear interacting wave profiles through iteration of the method. The stability of the method for the three interacting Stokes' waves was analyzed. The calculation results, together with Fourier transform, revealed that the iteration made it possible to predict higher-order nonlinear frequencies for three Stokes' waves' interaction. The proposed method has a very fast convergence rate.

• Proceedings of the KSME Conference
• /
• 2001.06a
• /
• pp.752-757
• /
• 2001

To reduce stress concentration around the intersection between a spherical pressure vessel and a cylindrical nozzle under various load conditions using less material, the optimization for the distribution of reinforcement has researched. The ranked bidirectional evolutionary structural optimization(R-BESO) method is developed recently, which adds elements based on a rank, and the performance indicator which can estimate a fully stressed model. The R-BESO method can obtain the optimum design using less iteration number than iteration number of the BESO. In this paper, the optimized intersection shape is sought using R-BESO method for a flush and a protruding nozzle. The considered load cases are a radial compression, torque and shear force.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.15 no.8
• /
• pp.689-697
• /
• 1990

This paper proposes ADAPTIVE STOCHASTIC ITERATION ALGORITHM that can be used for the full-duplex digital data transmission over existing twisted-pair cables. The canceller step size changes according to the residual echo level. Thus convergence speed increases by an order of magnitude over the conventional stochastic interation alogorithm. And it can be combined with the sequential type adaptive digital filter that simplifies the conventional echo canceller circuit. Thus it is suitable for LSI implementation. Theoretical analysis on two algorithms is carried out and the algorithm simulation program is developed.

• Journal of Electrical Engineering and Technology
• /
• v.9 no.1
• /
• pp.178-183
• /
• 2014

This paper presents a motor characteristics analysis method using an equivalent circuit. Motor characteristics analysis via equivalent circuit is very important for designing a high efficiency single phase induction motor. The accuracy of the motor characteristics depends on the accuracy of the parameters, especially saturation factor, which determines the cyclical relationship in the analysis process. Therefore, using the proposed method, the saturation factor was calculated using the iteration routine and numerical technique. The proposed method was verified by comparing the finite element method results and the dynamo test results of manufactured prototype model.

• Proceedings of the KSRS Conference
• /
• 2007.10a
• /
• pp.270-273
• /
• 2007

In this paper, a SAR-despeck1ing approach of adaptive iteration based a Bayesian model using the lognormal distribution for image intensity and a Gibbs random field (GRF) for image texture is proposed for noise removal of the images that are corrupted by multiplicative speckle noise. When the image intensity is logarithmically transformed, the speckle noise is approximately Gaussian additive noise, and it tends to a normal probability much faster than the intensity distribution. The MRF is incorporated into digital image analysis by viewing pixel types as states of molecules in a lattice-like physical system. The iterative approach based on MRF is very effective for the inner areas of regions in the observed scene, but may result in yielding false reconstruction around the boundaries due to using wrong information of adjacent regions with different characteristics. The proposed method suggests an adaptive approach using variable parameters depending on the location of reconstructed area, that is, how near to the boundary. The proximity of boundary is estimated by the statistics based on edge value, standard deviation, entropy, and the 4th moment of intensity distribution.

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

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2012.07a
• /
• pp.317-318
• /
• 2012

Sparse한 신호 복원 방법으로 underdetemined system에서 11-minimization을 이용한 compressive sensing의 연구와 함께, 11-minimization 비해 간단한 greed 알고리듬도 활발히 연구되고 있다. 이에 본 논문은 greed 알고리듬의 대표적인 orthogonal matching pursuit기법에서 iteration 마다 support 선택 개수에 따른 성능을 연구한다. 모의 실험을 통해 OMP의 iteration 단계에서 하나의 support만 선택하는 것보다 다수의 support를 선택하는 것이 더 낮은 sparsity의 신호를 복원할 수 있고 더 낮은 계산량의 이득을 가져오는 것을 확인 할 수 있다.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2012.07a
• /
• pp.473-474
• /
• 2012

Sparse한 신호 복원 방법으로 underdetermined system에서 ll-minimization을 이용한 compressive sensing의 연구와 함께, ll-minimization비에 간단한 greed 알고리듬도 활발히 연구되고 있다. 이에 본 논문은 greed 알고리듬의 대표적인 orthogonal matching pursuit기법에서 iteration 마다 후보 support를 유지하는 알고리듬을 연구한다. 모의 실험을 통해 OMP의 iteration 단계에서 하나의 support만 선택하는 것보다 후보 support를 유지하는 것이 sparse 신호를 복원하는 경우는 OMP와 비슷한 성능을 보이지만 덜 sparse한 신호복원에서는 더 좋은 성능을 보임을 확인 할 수 있다.