• Journal of the Korean Institute of Gas
• /
• v.2 no.4
• /
• pp.73-78
• /
• 1998

This paper considers the applicability of a pseudosteady-state approach to the long-time behavior of real gas flow in a closed reservoir. The method involves a combination of a linearized gas diffusivity equation using a normalized pseudotime and a material balance equation. For the simulation of field-scale problems with multiple wells of differing production rates over extended production periods, the pseudosteady-state equation was solved successively for each flow period. Results from this study show that the approach provides a fast and accurate method for modeling the long-time behavior of gas reservoirs under depletion conditions.

• Journal of Korean Society of Transportation
• /
• v.20 no.6
• /
• pp.99-113
• /
• 2002

The multi-class traffic assignment problem is the most typical one of the multi-solution traffic assignment problems and, recently formulation of the models and the solution algorithm have been received a great deal of attention. The useful solution algorithm, however, has not been proposed while formulation of the multi-class traffic assignment could be performed by adopting the variational inequality problem or the fixed point problem. In this research, we developed a hybrid solution algorithm which combines GA algorithm, diagonal algorithm and clustering algorithm for the multi-class traffic assignment formulated as a variational inequality Problem. GA algorithm and clustering algorithm are introduced for the wide area and small cost. We also performed an experiment with toy network(2 link) and tested the characteristics of the suggested algorithm.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.35 no.3
• /
• pp.183-195
• /
• 2007

Comprehensive mathematical comparison of numerical dissipation vector was made for a compressible and the preconditioned version Roe's Riemann solvers. Choi and Merkle type preconditioning method was selected from the investigation of the convergence characteristics of the various preconditioning methods for the flows over a two-dimensional bump. The investigation suggests a way of migration from a compressible code to a preconditioning code with a minor changes in Eigenvalues while maintaining the same code structure. Von Neumann stability condition and viscous Jacobian were considered additionally to improve the stability and accuracy for the viscous flow analysis. The developed code was validated through the applications to the standard validation problems.

• Communications of Mathematical Education
• /
• v.3
• /
• pp.229-249
• /
• 1997

폴리아가 그의 저서 ‘How to Solve It.'에서 주창한 문제 해결의 모형은 이렇게 해석될 수 있다. 곧, 절대 다수의 수학 문제는 조건문 (p${\rightarrow}$q)의 명제 형식으로 분해된다는 것이다. 그리하여 순조롭게 발생되는 문제 해법의 전과정은 아래와 같이 마치 징검다리를 놓듯 추이율(transitivity)을 연거퍼 적용하는(이른바 연추적이라 함) 절차이다. (p: 주어진 정보) ${\rightarrow}$ ${\cdots}$ ${\rightarrow}$ ${\cdots}$ ${\rightarrow}$ (구하는 정보: q) 이것은, 일반적으로, 추이율이 성립하는 모든 관계(relation)의 연추적 확인 과정으로 확장될 수 있다. 요컨대 항진식 (p${\rightarrow}$r) ${\wedge}$ (r${\rightarrow}$q) ${\rightarrow}$ (p${\rightarrow}$q)의 보장 아래 관계의 추이율 xRz ${\wedge}$ zRy ${\rightarrow}$ xRy 로 연결되는 온갖 경로를 포괄한다. 이상과 같이 정식화되는 이 도식의 한계와 효용은 (1) 모든 문제가 조건문의 형태를 갖추고 있는 것은 아니며, (2) 조건문 형식의 문제라도 해법이 반드시 연추적으로 발생되는 법도 아니고, (3) 더구나 이것이 해법 발생의 만능 열쇠는 아닐뿐더러, (4) 발상을 촉진하는 데는 교육공학적으로 더 정교한 배려가 필요하므로, (5) 초보 단계에서 행동 수정을 위한 치유 목적으로 사용됨이 바람직하다.

• Journal of Digital Contents Society
• /
• v.3 no.2
• /
• pp.221-233
• /
• 2002

In this paper, we present integer programming models and algorithms for the Capacitated Facility Location-Allocation Problem (CFLP). The models and algorithms can be used for the design of logistics networks and for the location of telecommunication facilities. We are given a set of candidate facility installation sites, one type of facility for each candidate site with its capacity and installation cost, a set of customers with their demand requirement, and flow cost for one unit of demand flow from each customer to each candidate site. (CFLP) is to determine the number of facilities for each candidate site and the set of customers which are connected to each site with minimum cost, while satisfying the demand requirement of each customer and constraints imposed on the allocation of customers to facilities. We present two integer programming models for (CFLP), and devise a branch-and-cut algorithm and a branch-and-price algorithm for the problem.

• 한국지구물리탐사학회:학술대회논문집
• /
• 2009.10a
• /
• pp.75-80
• /
• 2009

Despite its flexibility to complex geometry, three-dimensional (3D) electromagnetic(EM) modeling schemes using finite element method (FEM) have been faced to practical limitation due to the resulting large system of equations to be solved. An efficient 3D FEM modeling scheme has been developed, which can adopt either direct or iterative solver depending on the problems. The direct solver PARDISO can reduce the computing time remarkably by incorporating parallel computing on multi-core processor systems, which is appropriate for single frequency multi-source configurations. When limited memory, the iterative solver BiCGSTAB(1) can provide fast and stable convergence. Efficient 3D simulations can be performed by choosing an optimum solver depending on the computing environment and the problems to be solved. This modeling includes various types of controlled-sources and can be exploited as an efficient engine for 3D inversion.

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.41 no.2
• /
• pp.117-124
• /
• 2017

The performance of the colored Gauss-Seidel solver on CPU and GPU was investigated for the two- and three-dimensional heat conduction problems by using different mesh sizes. The heat conduction equation was discretized by the finite difference method and finite element method. The CPU yielded good performance for small problems but deteriorated when the total memory required for computing was larger than the cache memory for large problems. In contrast, the GPU performed better as the mesh size increased because of the latency hiding technique. Further, GPU computation by the colored Gauss-Siedel solver was approximately 7 times that by the single CPU. Furthermore, the colored Gauss-Seidel solver was found to be approximately twice that of the Jacobi solver when parallel computing was conducted on the GPU.

• Journal of Soil and Groundwater Environment
• /
• v.6 no.1
• /
• pp.63-83
• /
• 2001

Heavy metals are extracted from stream sediments, roadside soils and sediments and soils and tailings from mining area using partial extraction, acid digestion and HF-digestion. Compared to amounts of heavy metals extracted using partial extraction, those extracted using acid digestion are higher by 2.0∼221 times in Cu, 2.4∼2806 times in Pb, 1.3∼121 times in Cd, 14. 1∼1300885 times in Fe, 1.2∼272 times in Mn, 1.3∼373 times in Zn, 2.2∼1735 times in Cr. There is no special relationship between the extracted amounts of heavy metals using partial extraction and those using acid digestion. However, it is possible that there is a certain relationship between those using acid digestion and those using HF-digestion. Although partial extraction, which extracts less amounts of heavy metals (Cd, Cu, Pb) from soil compared to acid digestion, is used in domestic standard method for examination of soil, domestic soil standard for heavy metals in non-agricultural and industrial areas is higher than soil standard in foreign countries which use acid digestion. For improvement of the domestic standard method for assessment of soil, it is suggested to lower the domestic soil standard for heavy metals or to change pretreatment method for extracting heavy metals from partial extraction to acid digestion with modifying the soil standard.

• The Journal of Information Technology
• /
• v.3 no.2
• /
• pp.73-85
• /
• 2000

The efficient algorithms are suggested in this study for solving the multicommodity network flow problems applied to Communications Systems. These problems are typical NP-complete optimization problems that require integer solution and in which the computational complexity increases numerically in appropriate with the problem size. Although the suggested algorithms are not absolutely optimal, they are developed for computationally efficient and produce near-optimal and primal integral solutions. We supplement the traditional Lagrangian method with a price-directive decomposition. It proceeded as follows. First, A primal heuristic from which good initial feasible solutions can be obtained is developed. Second, the dual is initialized using marginal values from the primal heuristic. Generally, the Lagrangian optimization is conducted from a naive dual solution which is set as ${\lambda}=0$. The dual optimization converged very slowly because these values have sort of gaps from the optimum. Better dual solutions improve the primal solution, and better primal bounds improve the step size used by the dual optimization. Third, a limitation that the Lagrangian decomposition approach has Is dealt with. Because this method is dual based, the solution need not converge to the optimal solution in the multicommodity network problem. So as to adjust relaxed solution to a feasible one, we made efficient re-allocation heuristic. In addition, the computational performances of various versions of the developed algorithms are compared and evaluated. First, commercial LP software, LINGO 4.0 extended version for LINDO system is utilized for the purpose of implementation that is robust and efficient. Tested problem sets are generated randomly Numerical results on randomly generated examples demonstrate that our algorithm is near-optimal (< 2% from the optimum) and has a quite computational efficiency.

• Journal of the Korean Society of Groundwater Environment
• /
• v.6 no.1
• /
• pp.42-47
• /
• 1999

This study considers pseudosteady-state flow to a restricted-entry well in a single or multilayer aquifer with crossflow. A simple method for calculating the pseudoskin factor caused by partial penetration is presented to overcome a limited applicability in geometrical or computational aspects of previous methods. The computation is based on the solution of a simplified pseudosteady-state equation that describes the long-time behavior of the closed radial system. We illustrate the applicability of this method to various types of cylindrical systems and provide the results graphically. Comparisons with previously published results have indicated that this method yields highly accurate estimates of pseu-doskin factor with minimum computational effort. This method has also shown to be particularly useful for geometrically-complicated systems. Greatly improved computational efficiency of pseudosteady-state approach permits the engineer to easily account for the effect of partial penetration on the late-time performance of a well.