• Communications of the Korean Mathematical Society
• /
• v.31 no.4
• /
• pp.713-727
• /
• 2016

In this paper, we introduce two general iteration schemes with bounded error terms and prove some theorems related to the strong and ${\Delta}$-convergence of these iteration schemes for multi-valued maps in a hyperbolic space. The results which are presented here extend and improve some well-known results in the current literature.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2004.10a
• /
• pp.347-350
• /
• 2004

In this paper, the acceleration is studied for the rigid-plastic FEM of metal forming simulation. In the FEM, the direct iteration and Newton-Raphson iteration are applied to obtain the initial solution and accurate solution respectively. In general, the acceleration scheme for the direct iteration is not used. In this paper, an Aitken accelerator is applied to the direct iteration. In the modified Newton-Raphson iteration, the step length or the deceleration coefficient is used for the fast and robust convergence. The step length can be determined by using the accelerator. The numerical experiments have been performed for the comparisons. The faster convergence is obtained with the acceleration in the direct and Newton-Raphson iterations.

• 제어로봇시스템학회:학술대회논문집
• /
• 1989.10a
• /
• pp.1140-1145
• /
• 1989

A general dynamic iterative learning control scheme is proposed for a class of nonlinear systems. Relying on stabilizing high-gain feedback loop, it is possible to show the existence of Cauchy sequence of feedforward control input error with iteration numbers, which results in a uniform convergance of system state trajectory to the desired one.

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

To the best of our knowledge, it would probably be the first time in the literature that we clarify the relationship between Yamada's method and viscosity iteration correctly. We design iterative methods based on the hybrid steepest descent algorithms for solving variational inclusions, equilibrium problems. Our results unify, extend and improve the corresponding results given by many others.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.2C
• /
• pp.148-154
• /
• 2010

In this paper, we first review LDPC codes in general and a belief propagation algorithm that works in logarithm domain. LDPC codes, which is chosen 802.11n for wireless local access network(WLAN) standard are required a large number of computation due to large size of coded block and iteration. Therefore, we presented three kinds of low computational algorithm for LDPC codes. First, sequential decoding with partial group is proposed. It has same H/W complexity, and fewer number of iteration's are required at same performance in comparison with conventional decoder algorithm. Secondly, we have apply early stop algorithm. This method is reduced number of unnecessary iteration. Third, early detection method for reducing the computational complexity is proposed. Using a confidence criterion, some bit nodes and check node edges are detected early on during decoding. Through the simulation, we knew that the iteration number are reduced by half using subset algorithm and early stop algorithm is reduced more than one iteration and computational complexity of early detected method is about 30% offs in case of check node update, 94% offs in case of check node update compared to conventional scheme.

• 한국전산유체공학회:학술대회논문집
• /
• 2000.05a
• /
• pp.178-183
• /
• 2000

An efficient Newton-GMRES algorithm is presented for computing two-dimensional steady compressible viscous flows on unstructured hybrid meshes. The scheme is designed on cell-centered finite volume method which accepts general polygonal meshes. Steady-state solution is obtained with pseudo-transient continuation strategy. The preconditioned, restarted general minimum residual(GMRES) method is employed in matrix-free form to solve the linear system arising at each Newton iteration. The incomplete LU fartorization is employed for the preconditioning of linear system. The Spalart-Allmars one equation turbulence model is fully coupled with the flow equations to simulate turbulence effect. The accuracy, efficiency and robustness of the presently developed method are demonstrated on various test problems including laminar and turbulent flows over flat plate and airfoils.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.16 no.10 s.101
• /
• pp.965-972
• /
• 2005

In this paper, we first review LDPC codes in general and a belief propagation algorithm that works in logarithm domain. LDPC codes, which is chosen for second generation digital video broadcasting standard, are required a large number of computation due to large size of coded block and iteration. Therefore, we presented two kinds of low computational algorithm for LDPC codes. First, sequential decoding with partial group is proposed. It has same H/W complexity, and fewer number of iteration's are required at same performance in comparison with conventional decoder algerian. Secondly, early detection method for reducing the computational complexity is proposed. Using a confidence criterion, some bit nodes and check node edges are detected early on during decoding. Through the simulation, we knew that the iteration number are reduced by half using subset algorithm and computational complexity of early detected method is about $50\%$ offs in case of check node update, $99\%$ offs in case of check node update compared to conventional scheme.

• Structural Engineering and Mechanics
• /
• v.65 no.1
• /
• pp.69-79
• /
• 2018

This paper is devoted to two new techniques for free vibration analysis of concrete arch dam-reservoir systems. The proposed schemes are quadratic ideal-coupled eigen-problems, which can solve the originally non-symmetric eigen-problem of the system. To find the natural frequencies and mode shapes, a new special-purpose eigen-value solution routine is developed. Moreover, the accuracy of the proposed approach is thoroughly assessed, and it is confirmed that the new scheme is very accurate under all practical conditions. It is also concluded that both decoupled and ideal-coupled strategy proposed in the previous works can be considered as special cases of the current more general procedure.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.12
• /
• pp.2783-2790
• /
• 2010

In this paper, we first review LDPC codes in general and a belief propagation algorithm that works in logarithm domain. LDPC codes, which is chosen 802.11n for wireless local access network(WLAN) standard, require a large number of computation due to large size of coded block and iteration. Therefore, we presented three kinds of low computational algorithms for LDPC codes. First, sequential decoding with partial group is proposed. It has the same H/W complexity, and fewer number of iterations are required with the same performance in comparison with conventional decoder algorithm. Secondly, we have apply early stop algorithm. This method reduces number of unnecessary iterations. Third, early detection method for reducing the computational complexity is proposed. Using a confidence criterion, some bit nodes and check node edges are detected early on during decoding. Through the simulation, we knew that the iteration number are reduced by half using subset algorithm and early stop algorithm is reduced more than one iteration and computational complexity of early detected method is about 30% offs in case of check node update, 94% offs in case of check node update compared to conventional scheme. The LDPC decoder have been implemented in Xilinx System Generator and targeted to a Xilinx Virtx5-xc5vlx155t FPGA. When three algorithms are used, amount of device is about 45% off and the decoding speed is about two times faster than convectional scheme.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.27 no.9
• /
• pp.1555-1561
• /
• 2003

Finite element analysis using modern constitutive equation is one of the most general tools to simulate the deformation behavior and to predict the life of the structure. Constitutive equation becomes complicated so as to predict the material behavior more accurately than the classical models. Because of the complexity of constitutive model, numerical treatment becomes so difficult that the calculation should be verified carefully. One-element tests, simple tension or simple shear, are usually used to verify the accuracy of finite element analysis using complicated constitutive model. Since this test is mainly focused on the time integration scheme, it is also necessary to verify the equilibrium iteration using material stiffness matrix and to compare FE results with solution of structures. In this investigation, viscoplastic solution of thick walled cylinder was derived considering axial constraints and was compared with the finite element analysis. All the numerical solutions showed a good coincidence with FE results. This numerical solution can be used as a verification tool for newly developed FE code with complicated constitutive model.