• Bulletin of the Korean Mathematical Society
• /
• v.30 no.2
• /
• pp.201-212
• /
• 1993

It is our purpose in this paper to first establish an inequality in real uniformly smooth Banach spaces with modulus of smoothness of power type q > 1 that generalizes a well known Hilbert space inequality. Using our inequality, we shall then extend the above result of Qihou [15] on the Ishikawa iteration process from Hilbert spaces to these much more general Banach spaces. Furthermore, we shall prove that the Mann iteration process converges strongly to the unique fixed point of a quasi-contractive map in this general setting. No compactness assumption on K is required in our theorems.

• Journal of Power Electronics
• /
• v.18 no.1
• /
• pp.92-102
• /
• 2018

A sliding mode control (SMC) for servo motors based on the differential evolution (DE) algorithm, called DE-SMC, is proposed in this study. The parameters of SMC should be designed exactly to improve the robustness, realize the precision positioning, and reduce the steady-state speed error of the servo drive. The main parameters of SMC are optimized using the DE algorithm according to the speed feedback information of the servo motor. The most significant influence factor of the DE algorithm is optimization iteration. A suitable iteration can be achieved by the tested optimization process profile of the main parameters of SMC. Once the parameters of SMC are optimized under a convergent iteration, the system realizes the given performance indices within the shortest time. The experiment indicates that the robustness of the system is improved, and the dynamic and steady performance achieves the given performance indices under a convergent iteration when motor parameters mismatch and load disturbance is added. Moreover, the suitable iteration effectively mitigates the low-speed crawling phenomenon in the system. The correctness and effectiveness of DE-SMC are verified through the experiment.

• IE interfaces
• /
• v.24 no.4
• /
• pp.274-280
• /
• 2011

Delayed access to surgery may lead to deterioration in the patient condition, poor clinical outcomes, increase in the probability of emergency admission, or even death. The purpose of this work is to decide the number of patients selected from a waiting list and to schedule them in accordance with the operating room capacity in the next period. We formulate the problem as an infinite horizon Markov Decision Process (MDP), which attempts to strike a balance between the patient waiting times and overtime works. Structural properties of the proposed model are investigated to facilitate the solution procedure. The proposed procedure modifies the conventional value iteration method along with the binary search technique. An example of the optimal policy is provided, and computational results are given to show that the proposed procedure improves computational efficiency.

• Communications of the Korean Mathematical Society
• /
• v.30 no.3
• /
• pp.209-219
• /
• 2015

In this article, we first give metric version of an iteration scheme of Agarwal et al. [1] and approximate fixed points of two finite families of nonexpansive mappings in hyperbolic spaces through this iteration scheme which is independent of but faster than Mann and Ishikawa scheme. Also we consider case of three finite families of nonexpansive mappings. But, we need an extra condition to get convergence. Our convergence theorems generalize and refine many know results in the current literature.

• Journal of applied mathematics & informatics
• /
• v.29 no.3_4
• /
• pp.669-680
• /
• 2011

In this paper, some strong convergence theorems are obtained for hybrid method for modified Ishikawa iteration process of asymptotically nonexpansive mappings and asymptotically nonexpansive semigroups in Hilbert spaces. The results presented in this article generalize and improve results of Tae-Hwa Kim and Hong-Kun Xu and others. The convergence rate of the iteration process presented in this article is faster than hybrid method of Tae-Hwa Kim and Hong-Kun Xu and others.

• Journal of the Korean Mathematical Society
• /
• v.31 no.3
• /
• pp.333-337
• /
• 1994

Many authors[3][4][5] constructed and examined some processes for the fixed point of strictly pseudocontractive mapping in various Banach spaces. In fact the fixed point of strictly pseudocontractive mapping is the zero of strongly accretive operators. So the same processes are used for the both circumstances. Reich[3] proved that Mann-iteration precess can be applied to approximate the zero of strongly accretive operator in uniformly smooth Banach spaces. In the above paper he asked whether the fact can be extended to other Banach spaces the duals of which are not necessarily uniformly convex. Recently Schu[4] proved it for uniformly continuous strictly pseudocontractive mappings in smooth Banach spaces. In this paper we proved that Mann-iteration process can be applied to approximate the fixed point of strictly pseudocontractive mapping in certain Banach spaces.

• Journal of Internet Computing and Services
• /
• v.4 no.5
• /
• pp.51-60
• /
• 2003

Asynchronous iteration is a way to reduce performance degradation of some parallel algorithms due to load imbalance or transmission delay between computing nodes, which requires asymmetric communication between the nodes of different speeds. To implement such asynchronous communication on distributed memory systems, we suggest an MPMD method that creates an additional separate server process on each computing node, and compare it with an SPMD method that creates a single process per node.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.27 no.4
• /
• pp.551-558
• /
• 2003

An efficient and reliable subspace iteration algorithm using the block algorithm is proposed. The block algorithm is the method dividing eigenpairs into several blocks when a lot of eigenpairs are required. One of the key for the faster convergence is carefully selected initial vectors. As the initial vectors, the proposed method uses the modified Ritz vectors for guaranteering all the required eigenpairs and the quasi-static Ritz vectors for accelerating convergency of high frequency eigenvectors. Applying the quasi-static Ritz vectors, a shift is always required, and the proper shift based on the geometric average is proposed. To maximize efficiency, this paper estimates the proper number of blocks based on the theoretical amount of calculation in the subspace iteration. And it also considers the problems generated in the process of combining various algorithms and the solutions to the problems. Several numerical experiments show that the proposed subspace iteration algorithm is very efficient, reliable ,and accurate.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.14 no.8
• /
• pp.816-822
• /
• 2003

In this paper, we propose an efficient iteration control method with low complexity for Turbo TCM(Turbo Trellis Coded Modulation) decoding which will be used fur power-limited environment. As the decoding approaches the performance limit of a given turbo code, any further iteration results in very little improvement. Therefore, it is important to devise an efficient criterion to stop the iteration process and prevent unnecessary computations and decoding delay. This paper presents an efficient algorithm for turbo TCM decoding that can greatly reduce the delay and iteration number. The proposed method use adaptive iteration number according to the criterion using the extrinsic information variance parameter in turbo TCM decoding process. The simulation results show that the proposed technique effectively can reduce the decoding delay and computation with very little performance degradation.

• Communications of the Korean Mathematical Society
• /
• v.25 no.4
• /
• pp.571-581
• /
• 2010

Some convergence theorems for approximating to a common fixed point of an infinite family of strictly pseudocontractive mappings of Browder-Petryshyn type are proved in the setting of Banach spaces by using a new composite implicit iterative process with errors. The results presented in the paper generalize and improve the main results of Bai and Kim [1], Gu [4], Osilike [5], Su and Li [7], and Xu and Ori [8].