• Kyungpook Mathematical Journal
• /
• v.55 no.2
• /
• pp.373-382
• /
• 2015

In this paper, we introduce and study a new multivalued mapping in $\mathbb{R}$-trees, called k-strictly pseudononspreading. We also introduce a new two-step iterative process for two k-strictly pseudononspreading multivalued mappings in $\mathbb{R}$-trees. Strong convergence theorems of the proposed iteration to a common fixed point of two k-strictly pseudononspreading multivalued mappings in $\mathbb{R}$-trees are established. Our results improve and extend the corresponding results existing in the literature.

• Journal of the military operations research society of Korea
• /
• v.29 no.1
• /
• pp.28-42
• /
• 2003

The simplex method requires basis update in each iteration, which is the most time consuming process. Several methods have been developed for the update of basis which is represented in LU factorized form, such as Bartels-Golub's method, Forrest-Tomlin's method, Reid's method, Saunders's method, etc. In this research, we compare between the updating methods in terms of sparsity, data structure and computing time issues. The analysis is mainly based on the computational experience.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.22 no.3
• /
• pp.155-162
• /
• 2018

We describe a parallel implementation of a relaxed Hermitian and skew-Hermitian splitting preconditioner for the numerical solution of saddle point problems arising from the steady incompressible Navier-Stokes equations. The equations are linearized by the Picard iteration and discretized with the finite element and finite difference schemes on two-dimensional and three-dimensional domains. We report strong scalability results for up to 32 cores.

• Journal of Energy Engineering
• /
• v.10 no.3
• /
• pp.183-187
• /
• 2001

Impedance imaging for binary mixture is a kind of nonlinear inverse problem, which is usually solved iteratively by the Newton-Raphson method. Then, the ill-posedness of Hessian matrix often requires the use of a regularization method to stabilize the solution. In this study, the Levenberg-Marquredt regularization method is introduced for the binary-mixture system with various resistivity contrasts (1:2∼1:1000). Several mixture distribution are tested and the results show that the Newton-Raphson iteration combined with the Levenberg-Marquardt regularization can reconstruct reasonably good images.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.7 no.1
• /
• pp.7-14
• /
• 2003

The main concern of this paper is to develop a new class of quasi-newton methods. These methods are intended for use whenever memory space is a major concern and, hence, they are usually referred to as limited memory methods. The methods developed in this work are sensitive to the choice of the memory parameter ${\eta}$ that defines the amount of past information stored within the Hessian (or its inverse) approximation, at each iteration. The results of the numerical experiments made, compared to different choices of these parameters, indicate that these methods improve the performance of limited memory quasi-Newton methods.

• East Asian mathematical journal
• /
• v.26 no.1
• /
• pp.81-93
• /
• 2010

In this paper, a strong convergence theorem of multi-step iterative schemes with errors for asymptotically quasi-nonexpansive type nonself mappings is established in a real uniformly convex Banach space. Our results extend the corresponding results of Wangkeeree [12], Xu and Noor [13], Kim et al.[1,6,7] and many others.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2007.04a
• /
• pp.111-116
• /
• 2007

This paper investigates and compares the natural modes and static reponses of moduled and one-bodied floating structures. Equations for calculating natural modes and static responses are formulated by finite element method and the natural modes are solved by subspace iteration method. A floating parking place whose length is 120 m and width 60 m is considered as an example structure.

• International Journal of Contents
• /
• v.3 no.3
• /
• pp.15-19
• /
• 2007

We review some loop partitioning techniques such as loop splitting method by thresholds and Polychronopoulos' loop splitting method for exploiting parallelism from single loop which already developed. We propose improved loop splitting method for maximizing parallelism of single loops with non-constant dependence distances. By using the iteration and distance for the source of the first dependence, and by our defined theorems, we present generalized and optimal algorithms for single loops with non-uniform dependences. The algorithms generalize how to transform general single loops with one dependence as well as with multiple dependences into parallel loops.

• Proceedings of the IEEK Conference
• /
• 2002.07c
• /
• pp.1483-1486
• /
• 2002

In this paper, a new scheme of iterative loaming control of a robot manipulator is presented. The proposed method uses a fuzzy sliding mode controller(FSMC), which is designed based on the similarity between the fuzzy logic control(FLC) and the sliding mode control(SMC), for the feedback. With this, the proposed method makes possible fDr fast iteration and has advantages that no linear approximation is used for the derivation of the learning law or in the stability proof Full proof of the convergence of the fuzzy sliding base learning scheme Is given.

• Journal of electromagnetic engineering and science
• /
• v.11 no.1
• /
• pp.56-61
• /
• 2011

In this paper, we consider the topological derivative concept for developing a fast imaging algorithm of thin inclusions with dielectric contrast with respect to an embedding homogeneous domain with a smooth boundary. The topological derivative is evaluated by applying asymptotic expansion formulas in the presence of small, perfectly conducting cracks. Through the careful derivation, we can design a one-iteration imaging algorithm by solving an adjoint problem. Numerical experiments verify that this algorithm is fast, effective, and stable.