• 제목/요약/키워드: matrix solver

검색결과 86건 처리시간 0.023초

On the artificially-upstream flux splitting method

  • Sun M.;Takayama K.
    • 한국전산유체공학회:학술대회논문집
    • /
    • 한국전산유체공학회 2003년도 The Fifth Asian Computational Fluid Dynamics Conference
    • /
    • pp.156-157
    • /
    • 2003
  • A simple method is proposed to split the flux vector of the Euler equations by introducing two artificial wave speeds. The direction of wave propagation can be adjusted by these two wave speeds. This idea greatly simplifies the upwinding, and leads to a new family of upwind schemes. Numerical flux function for multi-dimensional Euler equations is formulated for any grid system, structured or unstructured. A remarkable simplicity of the scheme is that it successfully achieves one-sided approximation for all waves without recourse to any matrix operation. Moreover, its accuracy is comparable with the exact Riemann solver. For 1-D Euler equations, the scheme actually surpasses the exact solver in avoiding expansion shocks without any additional entropy fix. The scheme can exactly resolve stationary contact discontinuities, and it is also freed of the carbuncle problem in multi­dimensional computations.

  • PDF

비정렬 혼합 격자에서 내재적 방법을 이용한 비압축성 유동해석 (Implicit Incompressible flow solver on Unstructured Hybrid grids)

  • 김종태;김용모;맹주성
    • 한국전산유체공학회지
    • /
    • 제3권2호
    • /
    • pp.17-26
    • /
    • 1998
  • The three-dimensional incompressible Navier-Stokes equations have been solved by a node-centered finite volume method with unstructured hybrid grids. The pressure-velocity coupling is handled by the artificial compressibility algorithm and convective fluxes are obtained by Roe's flux difference splitting scheme with linear reconstruction of the solutions. Euler implicit method with Jacobi matrix solver is used for the time-integration. The viscous terms are discretised in a manner to handle any kind of grids such as tetragedra, prisms, pyramids, hexahedra, or mixed-element grid. Inviscid bump flow is solved to check the accuracy of high order convective flux discretisation. And viscous flows around a circular cylinder and a sphere are studied to show the efficiency and accuracy of the solver.

  • PDF

대형 유한요소 해석을 위한 골조구조물의 최종강도해석에 관한 연구 (Development of Efficient Moving Memory Column Solver for Large Finite Element Analysis)

  • 이성우;이동근;송윤환
    • 한국전산구조공학회:학술대회논문집
    • /
    • 한국전산구조공학회 1990년도 가을 학술발표회 논문집
    • /
    • pp.34-39
    • /
    • 1990
  • For the analysis of structures, specifically if it is large-scale, in which case it can not be solved within the core memory, the majority of computation time is consumed In the solution of simultaneous linear equation. In this study an efficient in- and out-of-core column solver for sparse symmetric matrix utilizing memory moving scheme is developed. Compare with existing blocking methods the algorithm is simple, therefore the coding and computational efficiencies are greatly enhanced. Upon available memory size, the solver automatically performs solution within the core or outside core. Analysis example shows that the proposed method efficiently solve the large structural problem on the small-memory microcomputer.

  • PDF

Aggregation multigrid method for schur complement system in FE analysis of continuum elements

  • Ko, Jin-Hwan;Lee, Byung Chai
    • Structural Engineering and Mechanics
    • /
    • 제30권4호
    • /
    • pp.467-480
    • /
    • 2008
  • An aggregation multigrid method (AMM) is a leading iterative solver in solid mechanics. Recently, AMM is applied for solving Schur Complement system in the FE analysis of shell structures. In this work, an extended application of AMM for solving Schur Complement system in the FE analysis of continuum elements is presented. Further, the performance of the proposed AMM in multiple load cases, which is a challenging problem for an iterative solver, is studied. The proposed method is developed by combining the substructuring and the multigrid methods. The substructuring method avoids factorizing the full-size matrix of an original system and the multigrid method gives near-optimal convergence. This method is demonstrated for the FE analysis of several elastostatic problems. The numerical results show better performance by the proposed method as compared to the preconditioned conjugate gradient method. The smaller computational cost for the iterative procedure of the proposed method gives a good alternative to a direct solver in large systems with multiple load cases.

온칩 인덕터의 필드 솔버 기반의 패드 효과 디임베딩 방법 연구 (A study on the Field Solver Based pad effect deembedding technique of on-chip Inductor)

  • 유영길;이한영
    • 대한전자공학회논문지TC
    • /
    • 제44권7호통권361호
    • /
    • pp.96-104
    • /
    • 2007
  • 본 논문에서는 필드 솔버와 회로 시뮬레이션을 통한 온 칩 인덕터의 패드 및 주변 그라운드의 디임베드 방법을 설명하였으며, 필드 솔버의 결과와 회로 시뮬레이션을 통한 디임베드 방법은 각각 측정 결과와 메트리스 연산 결과와 비교하여 검증하였다. 또한 디임베드 된 인덕터의 모델을 적용한 LNA 설계하고 제작하였으며 제작한 LNA의 결과는 측정 결과와 비교하여 디임베드를 적용하였을 때 2.5GHz 이상의 대역에서 보다 측정치에 접근함을 확인하였다. 본 논문에서 제시한 회로 시뮬레이션을 통한 디임베드 방법은 다른 수동 온칩 소자의 소자값을 얻는 데 손쉽게 사용될 수 있는 방법이며 이를 적용하여 보다 정확한 RFIC(radio frequency integrated circuit) 회로 설계가 가능할 것으로 사료된다.

An efficient adaptive finite element method based on EBE-PCG iterative solver for LEFM analysis

  • Hearunyakij, Manat;Phongthanapanich, Sutthisak
    • 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.

반복-직접 희소 솔버 조합에 의한 대규모 유한요소 모델의 주파수 영역 해석의 계산 효율 (Computational Efficiency on Frequency Domain Analysis of Large-scale Finite Element Model by Combination of Iterative and Direct Sparse Solver)

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

Parallel Algorithm of Conjugate Gradient Solver using OpenGL Compute Shader

  • Va, Hongly;Lee, Do-keyong;Hong, Min
    • 한국컴퓨터정보학회논문지
    • /
    • 제26권1호
    • /
    • pp.1-9
    • /
    • 2021
  • OpenGL compute shader는 다른 shader 단계와 다르게 동작하며, 병렬로 모든 데이터를 계산하는데 사용할 수 있다. 본 논문은 OpenGL compute shader에서 반복 켤레 기울기 방법을 통해 희소선형 시스템을 계산하기 위한 GPU 기반의 병렬 알고리즘 제안하였다. 제안된 희소 선형 해결 방법은 대칭인 양의 정부호 행렬과 같은 대형 선형 시스템을 해결하기 위해 사용된다. 본 논문은 이 알고리즘을 사용하여 매트릭스 형식이 다른 8가지 예제들에 대해서 CPU와 GPU를 기반으로한 성능 비교 결과를 제공한다. 본 논문은 4가지 잘 알려져 있는 매트릭스 형식(Dense, COO, ELL and CSR)을 매트릭스 저장소를 사용하였다. 8개의 희소 매트릭스를 사용한 성능 비교 실험에서 GPU 기반 선형 해결 시스템이 CPU 기반 선형 해결 시스템보다 훨씬 빠르며, GPU 기반에서 0.64ms, CPU 기반에서 15.37ms의 평균 컴퓨팅 시간을 제공한다.

Inelastic vector finite element analysis of RC shells

  • Min, Chang-Shik;Gupta, Ajaya Kumar
    • Structural Engineering and Mechanics
    • /
    • 제4권2호
    • /
    • pp.139-148
    • /
    • 1996
  • Vector algorithms and the relative importance of the four basic modules (computation of element stiffness matrices, assembly of the global stiffness matrix, solution of the system of linear simultaneous equations, and calculation of stresses and strains) of a finite element computer program for inelastic analysis of reinforced concrete shells are presented. Performance of the vector program is compared with a scalar program. For a cooling tower problem, the speedup factor from the scalar to the vector program is 34 for the element stiffness matrices calculation, 25.3 for the assembly of global stiffness matrix, 27.5 for the equation solver, and 37.8 for stresses, strains and nodal forces computations on a Gray Y-MP. The overall speedup factor is 30.9. When the equation solver alone is vectorized, which is computationally the most intensive part of a finite element program, a speedup factor of only 1.9 is achieved. When the rest of the program is also vectorized, a large additional speedup factor of 15.9 is attained. Therefore, it is very important that all the modules in a nonlinear program are vectorized to gain the full potential of the supercomputers. The vector finite element computer program for inelastic analysis of RC shells with layered elements developed in the present study enabled us to perform mesh convergence studies. The vector program can be used for studying the ultimate behavior of RC shells and used as a design tool.

Monte Carlo burnup and its uncertainty propagation analyses for VERA depletion benchmarks by McCARD

  • Park, Ho Jin;Lee, Dong Hyuk;Jeon, Byoung Kyu;Shim, Hyung Jin
    • Nuclear Engineering and Technology
    • /
    • 제50권7호
    • /
    • pp.1043-1050
    • /
    • 2018
  • For an efficient Monte Carlo (MC) burnup analysis, an accurate high-order depletion scheme to consider the nonlinear flux variation in a coarse burnup-step interval is crucial accompanied with an accurate depletion equation solver. In a Seoul National University MC code, McCARD, the high-order depletion schemes of the quadratic depletion method (QDM) and the linear extrapolation/quadratic interpolation (LEQI) method and a depletion equation solver by the Chebyshev rational approximation method (CRAM) have been newly implemented in addition to the existing constant extrapolation/backward extrapolation (CEBE) method using the matrix exponential method (MEM) solver with substeps. In this paper, the quadratic extrapolation/quadratic interpolation (QEQI) method is proposed as a new high-order depletion scheme. In order to examine the effectiveness of the newly-implemented depletion modules in McCARD, four problems in the VERA depletion benchmarks are solved by CEBE/MEM, CEBE/CRAM, LEQI/MEM, QEQI/MEM, and QDM for gadolinium isotopes. From the comparisons, it is shown that the QEQI/MEM predicts ${k_{inf}}^{\prime}s$ most accurately among the test cases. In addition, statistical uncertainty propagation analyses for a VERA pin cell problem are conducted by the sensitivity and uncertainty and the stochastic sampling methods.