• Journal of the Korean Operations Research and Management Science Society
• /
• v.12 no.1
• /
• pp.10-18
• /
• 1987

This paper discusses algorithmic properties of a class of complementarity programs involving strictly diagonally isotone and off-diagonally isotone functions, i. e., functions whose Jacobian matrices have positive diagonal elements and nonnegative off-diagonal elements, A typical traffic equilibrium under elastic demands is cast into this class. Algorithmic properties of these complementarity problems, when a Jacobi-type iteration is applied, are investigated. It is shown that with a properly chosen starting point the generated sequence are decomposed into two converging monotonic subsequences. This and related will be useful in developing solution procedures for this class of complementarity problems.

• Bulletin of the Korean Space Science Society
• /
• 2004.04a
• /
• pp.62-62
• /
• 2004

망원경을 이용하는 위성의 광학관측으로부터 적경과 적위 또는 방위각과 고도각의 관측데이터를 얻을 수 있다. 이러한 세 쌍의 관측데이터를 이용해 위성의 궤도를 결정하는 방법을 예비궤도 결정법이라 하는데, Laplace, Gauss 및 double r-iteration 방법이 있다. 위성의 정밀궤도 결정을 위해서 광학, 레이더 및 레이저를 이용한 다수의 관측데이터가 필요하며, 특히 위성의 초기 궤도정보가 반드시 요구되는데, 이는 예비궤도 결정법을 통해서 얻을 수 있다. (중략)

• Journal of Korean Institute of Industrial Engineers
• /
• v.19 no.2
• /
• pp.105-117
• /
• 1993

Methods for calculating k shortest paths in a network system, are based on a analogy which exists between the solution of a network problem and traditional techniques for solving linear equations. This paper modifies an algebraic structure of the K shortest path method and develops k maximum flow methods. On the basis of both theoretical and algebraic structure, three iteration methods are developed and the effective procedure of each method are provided. Finally, computational complexity is discussed for those methods.

• International Journal of Contents
• /
• v.1 no.1
• /
• pp.40-44
• /
• 2005

This paper introduces region partitioning method of non-perfect nested loops with non-uniform dependences. This kind of loop normally can't be parallelized by existing parallelizing compilers and transformations. Even when parallelized in rare instances, the performance is very poor. Based on the Convex Hull theory which has adequate information to handle non-uniform dependences, this paper proposes an enhanced region partitioning method which divides the iteration space into minimum parallel regions where all the iterations inside each parallel region can be executed in parallel by using variable renaming after copying.

• Bulletin of the Korean Mathematical Society
• /
• v.39 no.3
• /
• pp.455-469
• /
• 2002

The Purpose Of this Paper is to introduce the concept of a class of strictly successively hemicontractive mappings and construct certain stable and almost stable iteration procedures for the iterative approximation of fixed points for asymptotically nonexpansive and strictly successively hemicontractive mappings in Banach spaces.

• Communications of the Korean Mathematical Society
• /
• v.9 no.4
• /
• pp.819-823
• /
• 1994

If H is a Hilbert space, then an operator $T : D(T) \subset H \to H$ is said to be monotone if $$ (x-y, Tx-Ty) \geq 0$$ for any x, y in D(T). Many authors [1], [4] obtained the existence theorem for the equation $y = x + Tx$ for x, given an element y in H and a monotone operator T. On the other hand some iterative methods were applied to the approximations for the solution of the above equation [6], [8]. For example Bruck [2] obtained the iterative solution of the above equation with an explicit error estimate as follows.

• Bulletin of the Korean Mathematical Society
• /
• v.51 no.2
• /
• pp.479-499
• /
• 2014

In this paper, we propose new iteration methods for finding a common point of the solution set of a pseudomonotone equilibrium problem and the solution set of a monotone equilibrium problem. The methods are based on both the extragradient-type method and the viscosity approximation method. We obtain weak convergence theorems for the sequences generated by these methods in a real Hilbert space.

• Proceedings of the Acoustical Society of Korea Conference
• /
• 1987.11a
• /
• pp.70-74
• /
• 1987

본 논문은 화자독립 고립단어 인식에 있어서 LP 모델의 문제점과 그 해결 방안으로서 cepstrum 영역에 있어서 lifter를 이용한 해결에 대해서 고찰하였다. 한편, 각 인식 단어의 기준 패턴을 구하기 위한 방법으로서 집단화의 방법에 대해 논하였다. 집단화의 방법으로서는 UWA 방법과 K-iteration 방법을 변형시킨 KMA 방법을 제시 비교하였다. 인식 실험결과 정현파 lifter와 KMA의 집단화 방법을 사용하였을 때 95%의 최고 인식률을 보였다.

• Korean Journal of Mathematics
• /
• v.23 no.3
• /
• pp.457-478
• /
• 2015

In this paper we propose an iteration hybrid method for approximating a point in the intersection of the solution-sets of pseudomonotone equilibrium and variational inequality problems and the fixed points of a semigroup-nonexpensive mappings in Hilbert spaces. The method is a combination of projection, extragradient-Armijo algorithms and Manns method. We obtain a strong convergence for the sequences generated by the proposed method.

• Bulletin of the Korean Mathematical Society
• /
• v.40 no.4
• /
• pp.603-611
• /
• 2003

In this paper we extend the definition of K-positive definite operators from linear to Frechet differentiable operators. Under this setting, we derive from the inverse function theorem a local existence and approximation results corresponding to those of Theorems land 2 of the authors [8], in an arbitrary real Banach space. Furthermore, an asymptotically K-positive definite operator is introduced and a simplified iteration sequence which converges to the unique solution of an asymptotically K-positive definite operator equation is constructed.