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

The aim of this paper is to present an explicit iteration method for finding a common fixed point of a finite family of strictly pseudocon-tractive mappings defined on q-uniformly smooth and uniformly convex Banach spaces.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2008.04a
• /
• pp.26-28
• /
• 2008

This paper is to investigate the existence theorem for the semilinear fuzzy integrodifferential equation in ${E_N}$ by using the concept of fuzzy number whose values are normal, convex, upper semicontinuous and compactly supported interval in ${E_N}$. Main tool is successive iteration method.

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

• Proceedings of the Korea Society for Simulation Conference
• /
• 1998.03a
• /
• pp.11-16
• /
• 1998

The classical algorithm for solving liner network flow problems are primal cost improvement method, including simplex method, which iteratively improve the primal cost by moving flow around simple cycles, which iteratively improve the dual cost by changing the prices of a subset of nodes by equal amounts. Typical iteration/shortest path algorithm is used to improve flow problem of liner network structure. In this paper we stdudied about the implemental method of shortest path which is a practical computational aspects. This method can minimize the best neighbor node and also implement the typical iteration which is $\varepsilon$-CS satisfaction using the auction algorithm of linear network flow problem

• East Asian mathematical journal
• /
• v.28 no.1
• /
• pp.81-92
• /
• 2012

The purpose of this paper is to establish strong convergence of an implicit iteration process to a common fixed point for a finite family of asymptotically quasi-nonexpansive type mappings in CAT(0) spaces. Our results improve and extend the corresponding results of Fukhar-ud-din et al. [15] and some others from the current literature.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.12
• /
• pp.11-19
• /
• 1994

In this paper, we propose a new method to desing IIR Nyquist filters. By thismethod, we can design IIR nyquist filters which prossess linear phase characteristics andare lower in order than FIR Nyquist filters. WE derive expressions for zero-phased IIR Nyquist filters and propose new desing methods for them. An iteration process is used to design the proposed IIR Nyquist filter, and in each iteration step a modified version of the Remez exchange algorithm is used. Finally, the propose desing method is demonstrated through design examples.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.11 no.17
• /
• pp.81-85
• /
• 1988

This paper presents a model that considers combinations of rework, repair, replacement and scrapping. Policy-Iteration method of inspection is proposed for a serial manufacturing system whose repair cost, scrap cost and inspection cost. when it fails, can be formulated by Markovian approach. Policy-Iteration stops when new inspection policy is the same as previous inspection policy. A numerial example is presented.

• East Asian mathematical journal
• /
• v.29 no.1
• /
• pp.23-37
• /
• 2013

The purpose of this paper is to study an implicit iteration process with errors and establish weak and strong convergence theorems to converge to common fixed points for a finite family of generalized asymptotically quasi-nonexpansive mappings in the framework of uniformly convex Banach spaces. Our results extend, improve and generalize some known results from the existing literature.

• Proceedings of the KSRS Conference
• /
• 2003.11a
• /
• pp.1403-1405
• /
• 2003

This paper focuses on the image correction under few GCPs, utilizes the collinearity equation, and builds up this mathematics model of space backside resection based on condition adjustment. Then calculates the adjusted elements of exterior orientation by iteration algorithm, and evaluates the precision. And demonstrates the high-precision, affection and wide-supplying-perspective of this model.

• Journal of the Korean Mathematical Society
• /
• v.35 no.1
• /
• pp.191-205
• /
• 1998

In this paper, we prove that the Mann and Ishikawa iteration sequences with errors converge strongly to the unique solution of the equation x + Tx = f, where T is an m-accretive operator in uniformly smooth Banach spaces. Our results extend and improve those of Chidume, Ding, Zhu and others.