• Journal of the Korean Operations Research and Management Science Society
• /
• v.13 no.2
• /
• pp.73-73
• /
• 1988

Knapsack problems represent many business application such as cargo loading, project selection, and capital budgeting. In this research we developed a knapsack problem solver based on Martello-Toth algorithm using a relational database management system on the PC platform. The solver used the menu-driven user interface. The solver can be easily integrated with the database of decision support system because the solver can access the database to retrieve the data for the model and to store the result directly.

• Proceedings of the KAIS Fall Conference
• /
• 2003.11a
• /
• pp.65-69
• /
• 2003

As complex mathematical models are increasingly adopted for business decision-making, difficulties arise in reusing solvers (i.e., model solving algorithms) against diverse models and data sets and thus the collaboration among users (model/solver builders and decision makers) in multiple departments becomes very difficult. To facilitate the solver reuse, this paper adopts the Web services technologies as the base technologies for linking the solvers to the models, both of which are created on different modeling paradigms and different system platforms, in unified system architecture. Specifically, this paper focuses on designing an ontology that represents the interfacing semantics of the model-solver interactions in a general and standardized form. By referring to the ontology, a model management system (MMS) can autonomously suggest a set of compatible solvers and apply them to individual models even though the decision makers are not knowledgeable enough about all the details of the models and the solvers. Thus, this Web services based MMS would improve the reusability of the solvers by relieving the decision makers from the risk of erroneous application of a solver to syntactically and semantically incompatible models and the burden of considerable understanding of model and solver semantics.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.25 no.1
• /
• pp.45-54
• /
• 2022

There has been necessity to supplement the fin database to improve the accuracy of low-fidelity aerodynamic solver for missile configuration. In this study, fin database is expanded by in-house solver, utilized in the triservice data the previously established into regions beyond means of CFD. Fin alone data of CFD analysis results in the original region is matched well with triservice data originated from the wind tunnel tests. Extensive fin aerodynamic data from CFD analysis is added to the existing database of the low-fidelity solver. For confirmation, aerodynamic characteristics of body-tail and body-canard-tail missile configurations is computed using upgraded low-fidelity solver at transonic region. The result using improved solver shows good agreements with wind tunnel test and CFD analysis results, which implies that it becomes more accurate.

• Journal of Ship and Ocean Technology
• /
• v.10 no.3
• /
• pp.1-16
• /
• 2006

Despite the high cost of memory and CPU time required to resolve the boundary layer, a viscous unstructured grid solver has many advantages over a structured grid solver such as the convenience in automated grid generation and vortex capturing by solution adaption. In present study, an unstructured Cartesian grid solver is developed on the basis of the existing Euler solver, NASCART-GT. Instead of cut-cell approach, immersed boundary approach is applied with ghost cell boundary condition, which can be easily applied to a moving grid solver. The standard $k-{\varepsilon}$ model by Launder and Spalding is employed for the turbulence modeling, and a new wall function approach is devised for the unstructured Cartesian grid solver. Developed approach is validated and the efficiency of the developed boundary condition is tested in 2-D flow field around a flat plate, NACA0012 airfoil, and axisymmetric hemispheroid.

• Structural Engineering and Mechanics
• /
• v.83 no.3
• /
• pp.353-361
• /
• 2022

Linear Elastic Fracture Mechanics (LEFM) has been developed by applying stress analysis to determine the stress intensity factor (SIF, K). The finite element method (FEM) is widely used as a standard tool for evaluating the SIF for various crack configurations. The prediction accuracy can be achieved by applying an adaptive Delaunay triangulation combined with a FEM. The solution can be solved using either direct or iterative solvers. This work adopts the element-by-element preconditioned conjugate gradient (EBE-PCG) iterative solver into an adaptive FEM to solve the solution to heal problem size constraints that exist when direct solution techniques are applied. It can avoid the formation of a global stiffness matrix of a finite element model. Several numerical experiments reveal that the present method is simple, fast, and efficient compared to conventional sparse direct solvers. The optimum convergence criterion for two-dimensional LEFM analysis is studied. In this paper, four sample problems of a two-edge cracked plate, a center cracked plate, a single-edge cracked plate, and a compact tension specimen is used to evaluate the accuracy of the prediction of the SIF values. Finally, the efficiency of the present iterative solver is summarized by comparing the computational time for all cases.

• International Journal of Aeronautical and Space Sciences
• /
• v.8 no.2
• /
• pp.44-53
• /
• 2007

A three-dimensional viscous flow solver has been developed for the prediction of the aerodynamic performance of hovering helicopter rotor blades using unstructured hybrid meshes. The flow solver utilized a vertex-centered finite-volume scheme that is based on the Roe's flux-difference splitting with an implicit Jacobi/Gauss-Seidel time integration. The eddy viscosity are estimated by the Spalart- Allmaras one-equation turbulence model. Calculations were performed at three operating conditions with varying tip Mach number and collective pitch setting for the Caradonna-Tung rotor in hover. Additional computations are made for the UH-60A rotor in hover. Reasonable agreements were obtained between the present results and the experiment in both blade loading and overall rotor performance. It was demonstrated that the present vertex-centered flow solver is an efficient and accurate tool for the assessment of rotor performance in hover.

• Journal of applied mathematics & informatics
• /
• v.23 no.1_2
• /
• pp.25-42
• /
• 2007

A direct solver for the Legendre tau approximation for the two-dimensional Poisson problem is proposed. Using the factorization of symmetric eigenvalue problem, the algorithm overcomes the weak points of the Schur decomposition and the conventional diagonalization techniques for the Legendre tau approximation. The convergence of the method is proved and numerical results are presented.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2011.04a
• /
• pp.261-264
• /
• 2011

자바프로그램 검증은 안전하고 정확한 프로그램을 만들기 위한 필수적인 조건이지만 자바언어로 작성된 프로그램은 바이트코드로 작성되어 있는 클래스 파일로 배포되기 때문에 바이트코드에 대한 검증이 필요하다. 하지만 자바 바이트코드는 가독성이 떨어져 중간언어로 변환을 하고 그 중간코드에서 검증에 필요한 조건들을 작성 해야 한다. 이 논문에서는 새로 정의된 중간언어인 BIRS을 통해 컴파일시 검증이 되지 않는 배열 오버플로우에 대한 정적검증을 설명하고 검증 절차에 필요한 명제의 정의와 검증 시 사용되는 SMT-Solver 인 Z3 의 사용법에 대하여 서술하였다.

• 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 the Computational Structural Engineering Institute of Korea
• /
• v.32 no.2
• /
• pp.117-124
• /
• 2019

Parallel sparse solvers are essential for solving large-scale finite element models. This paper introduces the combination of iterative and direct solver that can be applied efficiently to problems that require continuous solution for a subtly changing sequence of systems of equations. The iterative-direct sparse solver combination technique, proposed and implemented in the parallel sparse solver package, PARDISO, means that iterative sparse solver is applied for the newly updated linear system, but it uses the direct sparse solver's factorization of previous system matrix as a preconditioner. If the solution does not converge until the preset iterations, the solution will be sought by the direct sparse solver, and the last factorization results will be used as a preconditioner for subsequent updated system of equations. In this study, an improved method that sets the maximum number of iterations dynamically at the first Krylov iteration step is proposed and verified thereby enhancing calculation efficiency by the frequency domain analysis.