• 한국전산구조공학회논문집
• /
• 제34권4호
• /
• pp.191-197
• /
• 2021

분자동역학에서의 원자들의 유도전하를 계산하기 위해서는 유도전하를 미지수로 하는 선형방정식을 풀어야 하는데 원자들의 위치가 변화할 때마다 필요한 계산이므로 상당한 계산비용이 요구된다. 따라서 효율적인 유도전하 계산 방법은 다양한 시스템을 해석하기 위해서 필수적이다. 본 연구에서는 constraints가 존재하는 Lagrange 방정식의 해에 대한 선형 시스템, 즉 saddle point를 가지는 문제를 해결하기 위해서 Uzawa method를 도입하였다. Uzawa 매개변수가 수렴 속도에 영향을 미치는 단점을 극복하고 행렬 연산의 효율성을 위해서 Schur complement와 preconditioned conjugate gradient (PCG) 방법을 통해 계산의 효율성을 극대화하는 가속 Uzawa algorithm을 적용한다. 두 금속 나노입자가 전기장에 놓여진 분자동역학 수치모델을 통해서 제시된 방법이 유도전하계산의 수렴성, 효율성 측면에서 모두 향상된 결과를 도출함을 확인하였다. 특히 기존의 가우스 소거법에 의한 계산보다 약 1/10으로 계산비용이 절감되었고, 기본 Uzawa method에 비하여 conjugate gradient (CG)의 높은 수렴성이 입증되었다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 ITC-CSCC -1
• /
• pp.298-301
• /
• 2000

We discuss the iterative methods for linear systems on a single processing node of the HITACHI SR8000. Each processing node of the SR8000 is a shared memory parallel computer which is composed of eight RISC processors with a pseudo-vector facility. We implement highly optimized codes for basic linear operations including a matrix-vector product and apply them to the conjugate gradient (CG) and the conjugate residual (CR) methods for linear systems. Our tuned codes for both method score nearly 50% of the theoretical peak performance, which is the best in the sense that it corresponds to an asymptotic performance of the inner product.

• 한국전자파학회논문지
• /
• 제9권5호
• /
• pp.640-647
• /
• 1998

다중 분해능 웨이블릿 해석법을 마이크로스트립 패치 안테나의 산란해석에 적용하였다. 다충구조에 대한 스펙 트럼 영역 그린 함수(spectral domain Green's dyad)의 특성올 공간-스펙트럼 영역 표현법을 이용하여 살펴보고, 스펙트럼 영역 웨이블릿을 주어진 문제에 적용하는 것이 유용함을 관찰하였다. 적분방정식에 모멘트법을 이 용하여 행렬방정식을 얻고, 그 풀이에 CG(conjugate gradient)법과 스펙트럼 영역 웨이블릿올 결합하여 효율 적으로 문제를 풀이할 수 있다. 단충구조 위에 놓인 정방형 패치에 대하여 기폰의 모멘트법 결과와 다충 분해능 웨이블릿 해석법올 적용한 결과를 비교하였다.

• 대한교통학회지
• /
• 제23권3호
• /
• pp.61-71
• /
• 2005

본 연구는 Conjugate Gradient법을 적용하여 개발한 관측교통량기반 기종점 OD행렬 추정모형이 대규모 가로망에서도 적용 가능성이 있는지를 판단하기 위하여 246개죤 기준 전국 가로망에 적용하여 적용성 및 활용가능성을 판단해 보았다. 대규모 가로망에서 모형의 일치성을 분석한 결과, 모형의 상위수준과 하위수준이 내부적으로 유기적인 관계를 유지하고 있는 것으로 분석되었다. 관측링크 개수에 따라 모형의 추정력을 분석한 결과 교통량 오차는 허용오차 범위내에서 추정력을 확보하는 것으로 나z타났다. 또한 추정 기종점 OD행렬의 추정력 역시 기존의 모형을 이용한 결과치보다는 양호한 추정력을 보이고 있는 것으로 분석되었다. 더 많은 다양한 실험을 하여 개발된 모형의 알고리즘의 안정성이 확보된다면 대규모 가로망에서도 적용 가능성이 있다고 판단된다.

• Computers and Concrete
• /
• 제29권2호
• /
• pp.93-105
• /
• 2022

The degrees of freedom (DOFs) of high-rise structures increase rapidly due to the need for refined analysis, which poses a challenge toward a computationally efficient method for numerical analysis of high-rise structures using the finite element method (FEM). This paper presented an efficient iterative method, an algebraic multigrid (AMG) with a Jacobi overrelaxation smoother preconditioned conjugate gradient method (AMG-CG) used for solving large-scale structural system equations running on heterogeneous platforms with parallel accelerator graphics processing units (GPUs) enabled. Furthermore, an AMG-CG FEM application framework was established for the numerical analysis of high-rise structures. In the proposed method, the coarsening method, the optimal relaxation coefficient of the JOR smoother, the smoothing times, and the solution method for the coarsest grid of an AMG preconditioner were investigated via several numerical benchmarks of high-rise structures. The accuracy and the efficiency of the proposed FEM application framework were compared using the mature software Abaqus, and there were speedups of up to 18.4x when using an NVIDIA K40C GPU hosted in a workstation. The results demonstrated that the proposed method could improve the computational efficiency of solving structural system equations, and the AMG-CG FEM application framework was inherently suitable for numerical analysis of high-rise structures.

• 한국전산구조공학회논문집
• /
• 제23권6호
• /
• pp.693-702
• /
• 2010

In this paper, FETI(Finite Element Tearing and Interconnecting) method is introduced in order to improve numerical efficiency of Staggered method. The porous media theory, the Staggered method and the FETI method are briefly introduced in this paper. In addition, we account for the MPI(Message Passing Interface) library for parallel analysis, and the proposed combined Staggered method with FETI method. Finally Lagrange multipliers and CG(Conjugate Gradient) algorithm to solve decomposed domain are proposed, and then the proposed method is verified to be numerically efficient by MPI library.

• 한국전산유체공학회지
• /
• 제19권4호
• /
• pp.20-28
• /
• 2014

An efficient solution algorithm for simulating free surface problem is presented. Navier-Stokes equations for variable density incompressible flow are employed as the governing equation on Cartesian meshes. In order to describe the free surface motion efficiently, VOF(Volume Of Fluid) method utilizing THINC(Tangent of Hyperbola for Interface Capturing) scheme is employed. The most time-consuming part of the current free surface flow simulations is the solution step of the linear system, derived by the pressure Poisson equation. To solve a pressure Poisson equation efficiently, the PCG(Preconditioned Conjugate Gradient) method is utilized. This study showed that the proper application of the preconditioner is the key for the efficient solution of the free surface flow when its pressure Poisson equation is solved by the CG method. To demonstrate the efficiency of the current approach, we compared the convergence histories of different algorithms for solving the pressure Poisson equation.

• 한국컴퓨터정보학회논문지
• /
• 제20권12호
• /
• pp.67-74
• /
• 2015

The heat conduction equation, a type of a Poisson equation which can be applied in various areas of engineering is calculating its value with the iteration method in general. The equation which had difference discretization of the heat conduction equation is the simultaneous equation, and each line has the characteristic of expressing in sparse matrix of the equivalent number of none-zero elements with neighboring grids. In this paper, we propose a data structure for sparse matrix that can calculate the value faster with less memory use calculate the heat conduction equation. To verify whether the proposed data structure efficiently calculates the value compared to the other sparse matrix representations, we apply the representative iteration method, CG (Conjugate Gradient), and presents experiment results of time consumed to get values, calculation time of each step and relevant time consumption ratio, and memory usage amount. The results of this experiment could be used to estimate main elements of calculating the value of the general heat conduction equation, such as time consumed, the memory usage amount.

• 한국전산유체공학회지
• /
• 제10권2호
• /
• pp.38-47
• /
• 2005

Substructuring methods are often used in finite element structural analyses. In this study a multi-level substructuring(MLSS) algorithm is developed and proposed as a possible candidate for finite element fluid solvers. The present algorithm consists of four stages such as a gathering, a condensing, a solving and a scattering stage. At each level, a predetermined number of elements are gathered and condensed to form an element of higher level. At the highest level, each sub-domain consists of only one super-element. Thus, the inversion process of a stiffness matrix associated with internal degrees of freedom of each sub-domain has been replaced by a sequential static condensation of gathered element matrices. The global algebraic system arising from the assembly of each sub-domain matrices is solved using a well-known iterative solver such as the conjugare gradient(CG) or the conjugate gradient squared(CGS) method. A time comparison with CG has been performed on a 2-D Poisson problem. With one domain the computing time by MLSS is comparable with that by CG up to about 260,000 d.o.f. For 263,169 d.o.f using 8 x 8 sub-domains, the time by MLSS is reduced to a value less than $30\%$ of that by CG. The lid-driven cavity problem has been solved for Re = 3200 using the element interpolation degree(Deg.) up to cubic. in this case, preconditioning techniques usually accompanied by iterative solvers are not needed. Finite element formulation for the incompressible flow has been stabilized by a modified residual procedure proposed by Ilinca et al.[9].

• 정보처리학회논문지A
• /
• 제10A권2호
• /
• pp.137-140
• /
• 2003

최근에 CG 반복법을 이용하여 레이레이 계수를 최소화함으로써 대칭행렬의 내부고유치를 구하는 방법이 개발되었다 그리고 이 방법은 병렬계산에 매우 적합하다. 적절한 준비행렬의 선택은 수렴속도를 향상시킨다. 우리는 본 연구에서 이를 위한 병렬준비행렬들을 비교한다. 고려된 준비행렬들은 Point-SSOR, 다중색채하의 ILU(0)와 Block SSOR이다. 우리는 128개의 노드를 가진 CRAY-T3E에서 구현하였다. 프로세서간의 통신은 MPI 리이브러리를 사용하였다. 최고 512$\times$512 행렬까지 시험하였는데 이 행렬들은 타원형 편미분방정식의 근사화에서 얻어졌다. 그 결과 다중색채 Block SSOR이 가장 성능이 우수한 것으로 판명되었다.