• Journal of applied mathematics & informatics
• /
• 제2권2호
• /
• pp.13-20
• /
• 1995

The goal of this paper is to show that the linear approxi-mation in evaluation of functions may be effectively replaced by the ex-ponential approximation formulas obtained by numerical quadratures and in the instance the relative errors can be estimated without know-ing the true values.

• 한국수학사학회지
• /
• 제10권1호
• /
• pp.19-32
• /
• 1997

This paper deals with the relationship between the order structure and topological structure in the historical point of view. We first investigate how the order structure has developed along with the set theory and logic in the second half of the nineteenth century. After the general topology has emerged in the beginning of the twentieth century, two disciplines of the order theory and topology give each other a great deal of effect for their development via various dualities, compactifications by maximal filter spaces and Alexandroff's specialization order, which form eventually a fundamental setting for the development of the category theory or functor theory.

• Journal of applied mathematics & informatics
• /
• 제3권1호
• /
• pp.101-115
• /
• 1996

In this paper we extend the best choice of subsample size m in the 2-stage sampling which suggested by Mohammad(1986) to the 3-stage sampling in cases of known and of unknown cost and variance ratio. We find the subsample size m.k which ensures more than the relative efficiency 90% Also we see that the choice of 3-stage subsample size depends on the design parameters using in 2-stage sampling.

• 한국수학사학회지
• /
• 제11권1호
• /
• pp.27-35
• /
• 1998

As Chinese philosophy has developed by commentary for the original texts, the Nine Chapters has been greatly improved by the commentary given by Liu Hui and it was transformed from an arithmetic text to Mathematics. Comparing his commentary and Chinese philosophical development up to his date, we conclude that Liu Hui was able to make such a great leap by his thorough understanding of philosophical development.

• Journal of applied mathematics & informatics
• /
• 제3권1호
• /
• pp.25-34
• /
• 1996

Many important large-scale linear programs with special structures lead to special computational procedures which are more ef-ficient than the ordinary procedure of the generalized methods. Prob-lems and their solvers taking advantage of multiple updatings of the basis in the dual simplex type method are presented. Computational results run by the efficient algorithm and a presented. Computational results run by the efficient algorithm and a standard code MINOS for the test problems are compared and analyzed. It is shown that the amount of work for the optimal solution for the prblem can be re-duced by the new algorithm.