• Journal of the Korean Mathematical Society
• /
• v.32 no.1
• /
• pp.7-15
• /
• 1995

Multigrid method has been used widely to solve elliptic problems because of its applicability to many class of problems and fast convergence ([1], [3], [9], [10], [11], [12]). The estimate of convergence rate of multigrid is one of the main objectives of the multigrid analysis ([1], [2], [5], [6], [7], [8]). In many problems, the convergence rate depends on the regularity of the solutions([5], [6], [8]). In this paper, we present an improved estimate of reduction factor of multigrid iteration based on the proof in [6].

• Communications of the Korean Mathematical Society
• /
• v.11 no.4
• /
• pp.1147-1157
• /
• 1996

Nonlinear ill-posed problems arise in many application including parameter estimation and inverse scattering. We introduce a least squares regularization method to solve nonlinear ill-posed problems with constraints robustly and efficiently. The regularization method uses Trust-Region approach to handle the constraints on variables. The Generalized Cross Validation is used to choose the regularization parameter in computational tests. Numerical results are given to exhibit faster convergence of the method over other methods.

• Proceedings of the Korean Society of Coastal and Ocean Engineers Conference
• /
• 1996.10a
• /
• pp.60-63
• /
• 1996

Industrialization and urbanization of coastal areas in recent years have brought about a lot of coastal marine environmental problems. Water quality problems such as eutrophication or pollution by toxic chemicals are especially serious, threatening coastal ecosystems. These problems are mainly induced by anthropogenic loads of materials from the land. In order to design suitable counter measures, we should well understand the processes causing the problems. (omitted)

• Journal of Korean Institute of Industrial Engineers
• /
• v.20 no.1
• /
• pp.121-131
• /
• 1994

Since many infinite horizon problems have infinite sequence of data to be considered, in general, it is impossible to express the optimal strategies finitely or to calculate them in finite time. This paper considers undiscounted nonhomogeneous deterministic infinite horizon problems. For those problems, we take a basic step to solve this class of infinite horizon problems optimally by giving a sufficient condition for a finite solution.

• Bulletin of the Korean Mathematical Society
• /
• v.50 no.2
• /
• pp.375-388
• /
• 2013

In this paper, we introduce an iterative sequence for finding solution of a system of mixed equilibrium problems and the set of fixed points of a nonexpansive mapping in Hilbert spaces. Then, the weak and strong convergence theorems are proved under some parameters controlling conditions. Moreover, we apply our result to fixed point problems, system of equilibrium problems, general system of variational inequalities, mixed equilibrium problem, equilibrium problem and variational inequality.

• Bulletin of the Korean Mathematical Society
• /
• v.54 no.1
• /
• pp.299-318
• /
• 2017

Sextic moment problems with an infinite algebraic variety are still widely open. We study the problem with a single cubic column relation associated to 3 parallel lines in which the variety is infinite. It turns out that this specific column relation has a strong connection with moment problems that have a symmetric algebraic variety. We present more concrete solutions to some sextic moment problems with a symmetric variety.

• Journal of applied mathematics & informatics
• /
• v.5 no.3
• /
• pp.659-668
• /
• 1998

In this paper we introduce and study a new class of gen-eralized mildly nonlinear complementarity problems for fuzzy map-pings. We use the change of variabes technique to establish the equivalence between the generalized mildly nonlinear complementar-ity problems and the Wiener-Hopf equations. This equivalence is used to suggest and analyze a number of iterative algorithm for solv-ing the generalized mildly nonlinear complemetarity problems.

• Journal of applied mathematics & informatics
• /
• v.5 no.3
• /
• pp.749-758
• /
• 1998

We investigate some numerical methods for computing approximate solutions of a system of second order boundary value problems associated with obstacle unilateral and contact problems. We show that cubic spline method gives approximations which are better than that computed by higer order spline and finite difference techniques.

• 제어로봇시스템학회:학술대회논문집
• /
• 1986.10a
• /
• pp.341-345
• /
• 1986

In the course of robot control system building, there are problems in the position control loop of 3rd axis of robot manipulator. The problems are summerized as two: one is uncontrollability of position and the other is oscillation. And these problems are analyzed through experiment, and it is known that the cause of problems in torsional vibration of 3rd axis. So that these two problems are solved by noise immunity enhancement and lowering of PI controller gain.

• Journal of the military operations research society of Korea
• /
• v.24 no.1
• /
• pp.146-156
• /
• 1998

Cholesky factorization is known to be inefficient to problems with dense column and network problems in interior point methods. We use the conjugate gradient method and preconditioners to improve the convergence rate of the conjugate gradient method. Several preconditioners were applied to LPABO 5.1 and the results were compared with those of CPLEX 3.0. The conjugate gradient method shows to be more efficient than Cholesky factorization to problems with dense columns and network problems. The incomplete Cholesky factorization preconditioner shows to be the most efficient among the preconditioners.