• 한국경영과학회지
• /
• 제13권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.

• 한국산학기술학회:학술대회논문집
• /
• 한국산학기술학회 2003년도 Proceeding
• /
• 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.

• 한국군사과학기술학회지
• /
• 제25권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
• /
• 제10권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
• /
• 제83권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
• /
• 제8권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
• /
• 제23권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.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2011년도 춘계학술발표대회
• /
• pp.261-264
• /
• 2011

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

• 대한기계학회논문집B
• /
• 제41권2호
• /
• pp.117-124
• /
• 2017

본 연구에서는 Coloring 기법을 적용한 Gauss-Seidel 해법의 연산 성능을 분석하기 위해 2차원과 3차원 전도 열전달 문제를 다양한 격자 크기에서 해석하였다. 지배방정식의 이산화는 유한차분법과 유한요소법을 사용하였다. CPU의 경우에는 상대적으로 작은 격자계에서 연산 성능이 좋으며, 계산에 사용되는 메모리의 크기가 캐시메모리보다 크게 되면 연산 성능이 급격히 떨어진다. 반면에, GPU는 메모리 지연시간 숨김 특성으로 인하여 격자의 수가 충분히 많을 때 연산 성능이 좋다. GPU에 기반한 Colored Gauss-Seidel 해법은 단일 CPU를 이용한 연산에 비해서 각각 최대 7배의 속도 향상을 보인다. 또한, GPU 기반에서 Colored Gauss-Seidel 해법은 Jacobi 보다 약 2배 빠름을 확인하였다.

• 한국전산구조공학회논문집
• /
• 제32권2호
• /
• pp.117-124
• /
• 2019

대규모 유한요소 모델을 빠르게 해석하기는 위해서 병렬 희소 솔버를 필수적으로 적용해야 한다. 이 논문에서는 미세하게 변화하는 시스템 행렬을 대상으로 연속적으로 해를 구해야 하는 문제에서 효율적으로 적용가능한 반복-직접 희소 솔버 조합 기법을 소개한다. 반복-직접 희소 솔버 조합 기법은 병렬 희소 솔버 패키지인 PARDISO에 제안 및 구현된 기법으로 새롭게 행렬값이 갱신된 선형 시스템의 해를 구할 때 이전 선형 시스템에 적용된 직접 희소 솔버의 행렬 분해(factorization) 결과를 Krylov 반복 희소 솔버의 preconditioner로 활용하는 방법을 의미한다. PARDISO에서는 미리 설정된 반복 회수까지 해가 수렴하지 않으면 직접 희소 솔버로 해를 구하며, 이후 이어지는 갱신된 선형 시스템의 해를 구할 때는 최종적으로 사용된 직법 희소 솔버의 행렬 분해 결과를 preconditioner로 사용한다. 이 연구에서는 첫 번째 Krylov 반복 단계에서 소요되는 시간을 동적으로 계산하여 최대 반복 회수를 설정하는 기법을 제안하였으며, 주파수 영역 해석에 적용하여 그 효과를 검증하였다.