• 제목/요약/키워드: Gauss method

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

근사 화학반응 자코비안을 이용한 화학반응 유동해석 (Approximate Chemical Jacobian Methods for Reactive Flow Simulations)

  • 김성룡;최정열;정인석;박양호
    • 한국전산유체공학회:학술대회논문집
    • /
    • 한국전산유체공학회 1999년도 추계 학술대회논문집
    • /
    • pp.59-64
    • /
    • 1999
  • The Equations of Chemical kinetics ate very stiff, which forces the use of an implicit scheme. The problem of implicit scheme, however, is that the jacobian must be solved at each time step. In this paper, we examined the approximate chemical jacobian methods such as Gauss-Seidel, Jacobi partial jacobian and diagonalized jacobian that can be stable without full jacobian, We show that Gauss-Seidel jacobian method is stable and accurate as well as full jacobian and that this is more efficient in supersonic combustion problem about $20\%$ than the full jacobian method with same accuracy,

  • PDF

Performance Optimization of Parallel Algorithms

  • Hudik, Martin;Hodon, Michal
    • Journal of Communications and Networks
    • /
    • 제16권4호
    • /
    • pp.436-446
    • /
    • 2014
  • The high intensity of research and modeling in fields of mathematics, physics, biology and chemistry requires new computing resources. For the big computational complexity of such tasks computing time is large and costly. The most efficient way to increase efficiency is to adopt parallel principles. Purpose of this paper is to present the issue of parallel computing with emphasis on the analysis of parallel systems, the impact of communication delays on their efficiency and on overall execution time. Paper focuses is on finite algorithms for solving systems of linear equations, namely the matrix manipulation (Gauss elimination method, GEM). Algorithms are designed for architectures with shared memory (open multiprocessing, openMP), distributed-memory (message passing interface, MPI) and for their combination (MPI + openMP). The properties of the algorithms were analytically determined and they were experimentally verified. The conclusions are drawn for theory and practice.

An Automated Adaptive Finite Element Mesh Generation for Dynamics

  • Yoon, Chongyul
    • 한국지진공학회논문집
    • /
    • 제23권1호
    • /
    • pp.83-88
    • /
    • 2019
  • Structural analysis remains as an essential part of any integrated civil engineering system in today's rapidly changing computing environment. Even with enormous advancements in capabilities of computers and mobile tools, enhancing computational efficiency of algorithms is necessary to meet the changing demands for quick real time response systems. The finite element method is still the most widely used method of computational structural analysis; a robust, reliable and automated finite element structural analysis module is essential in a modern integrated structural engineering system. To be a part of an automated finite element structural analysis, an efficient adaptive mesh generation scheme based on R-H refinement for the mesh and error estimates from representative strain values at Gauss points is described. A coefficient that depends on the shape of element is used to correct overly distorted elements. Two simple case studies show the validity and computational efficiency. The scheme is appropriate for nonlinear and dynamic problems in earthquake engineering which generally require a huge number of iterative computations.

이동 로봇을 위한 순방향 링크 AOA 측위 방법 (A Forward Link ADA Positioning method for mobile Robots)

  • 김동혁;송승헌;노기홍;성태경
    • 제어로봇시스템학회논문지
    • /
    • 제13권6호
    • /
    • pp.603-608
    • /
    • 2007
  • In the conventional AOA(angle-of-arrival) positioning utilizing reverse-link wireless channel, each sensor should be equipped with an array antenna to measure the incident angle of signal transmitting from a tag. To perform the complicated signal processing for angle measurements, sensor size and its power consumption will be large. In some applications like mobile robot location, there exists no strict restriction in tag size or in power consumption. Rather, it is desirable that the sensor would be as small as possible. This paper presents a new AOA positioning method utilizing forward-link channel. Under the assumption that the mobile robot is operating on the flat surface, the measurement model for FLAOA(tiJrward-link AOA) is derived first. Two kinds of position estimation algorithms using FLAOA measurements are proposed; Gauss-Newton method and closed-fonn solution method. With the proposed methods, we can ohtain the attitude of robot as well as its position. Positioning performance of proposed methods is compared by computer simulation. Simulation results show that the closed-form solution method using FLAOA measurements is suitable for indoor robot positioning.

Practical methods for GPU-based whole-core Monte Carlo depletion calculation

  • Kyung Min Kim;Namjae Choi;Han Gyu Lee;Han Gyu Joo
    • Nuclear Engineering and Technology
    • /
    • 제55권7호
    • /
    • pp.2516-2533
    • /
    • 2023
  • Several practical methods for accelerating the depletion calculation in a GPU-based Monte Carlo (MC) code PRAGMA are presented including the multilevel spectral collapse method and the vectorized Chebyshev rational approximation method (CRAM). Since the generation of microscopic reaction rates for each nuclide needed for the construction of the depletion matrix of the Bateman equation requires either enormous memory access or tremendous physical memory, both of which are quite burdensome on GPUs, a new method called multilevel spectral collapse is proposed which combines two types of spectra to generate microscopic reaction rates: an ultrafine spectrum for an entire fuel pin and coarser spectra for each depletion region. Errors in reaction rates introduced by this method are mitigated by a hybrid usage of direct online reaction rate tallies for several important fissile nuclides. The linear system to appear in the solution process adopting the CRAM is solved by the Gauss-Seidel method which can be easily vectorized on GPUs. With the accelerated depletion methods, only about 10% of MC calculation time is consumed for depletion, so an accurate full core cycle depletion calculation for a commercial power reactor (BEAVRS) can be done in 16 h with 24 consumer-grade GPUs.

TDOA/FDOA 정보를 이용한 Gauss-Newton 기법 기반의 이동 신호원 위치 및 속도 추정 방법과 성능 분석 (Gauss-Newton Based Estimation for Moving Emitter Location Using TDOA/FDOA Measurements and Its Analysis)

  • 김용희;김동규;한진우;송규하;김형남
    • 전자공학회논문지
    • /
    • 제50권6호
    • /
    • pp.62-71
    • /
    • 2013
  • TDOA (time difference of arrival)와 FDOA (frequency difference of arrival)를 동시에 사용하는 신호원 위치추정 방법은 단일 정보를 이용하는 경우에 비해 높은 정확도를 가지며 이동 신호원의 속도 추정이 가능하다는 장점을 가지고 있다. 최근 종속 미지변수를 정의한 후 비반복적으로 해를 구하는 방법들이 제안되고 있으나 전자전 환경과 같이 수신단과 신호원 간의 거리가 상대적으로 먼 경우에는 추정 정확도가 낮고 모든 수신단 쌍이 동일한 기준 수신단을 공유하여야 한다는 운용상의 제약이 존재한다. 따라서 본 논문에서는 비선형 LS 최적해를 반복계산을 통해 얻어내는 Gauss-Newton 기법을 적용하여 이동 신호원의 위치좌표와 속도벡터를 추정한다. 또한 이동 신호원의 위치와 속도 추정 결과를 효과적이고 정량적으로 분석하기 위해 CRLB (Cramer-Rao lower bound) 행렬을 각각의 부공간으로 분해하여 2차원 공간상에 독립된 CEP (circular error probable) 평면으로 도시한다. 모의실험을 통해 주어진 수신단 배치와 조합에서 이동 신호원의 위치 및 속도 추정 성능을 확인하고 분석 결과를 제시한다.

그래픽처리장치를 이용한 레이놀즈 방정식의 수치 해석 가속화 (Accelerating Numerical Analysis of Reynolds Equation Using Graphic Processing Units)

  • 명훈주;강지훈;오광진
    • Tribology and Lubricants
    • /
    • 제28권4호
    • /
    • pp.160-166
    • /
    • 2012
  • This paper presents a Reynolds equation solver for hydrostatic gas bearings, implemented to run on graphics processing units (GPUs). The original analysis code for the central processing unit (CPU) was modified for the GPU by using the compute unified device architecture (CUDA). The red-black Gauss-Seidel (RBGS) algorithm was employed instead of the original Gauss-Seidel algorithm for the iterative pressure solver, because the latter has data dependency between neighboring nodes. The implemented GPU program was tested on the nVidia GTX580 system and compared to the original CPU program on the AMD Llano system. In the iterative pressure calculation, the implemented GPU program showed 20-100 times faster performance than the original CPU codes. Comparison of the wall-clock times including all of pre/post processing codes showed that the GPU codes still delivered 4-12 times faster performance than the CPU code for our target problem.

PID 제어기를 이용한 달착륙선의 powered descent phase 유도제어 (Control of powered descent phase for a Lunar lander using PID controller)

  • 조성진;민찬오;이대우;조겸래
    • 한국항공우주학회지
    • /
    • 제39권5호
    • /
    • pp.408-415
    • /
    • 2011
  • 달착륙은 크게 궤도이탈 단계, 동력하강 단계로 구성되어지며, 동력하강단계는 Braking, Approach, Final landing phase의 세부 3단계로 나누어진다. 본 논문에서는 동력하강 세부 3단계의 최적경로를 통하여 달착륙선의 착륙 제어를 수행하기로 한다. 우선 Gauss pseudo-spectral 방법을 통하여 기준 궤적을 생성하였고, 고도와 각 방향의 속도오차를 이용하여 PID 제어기를 생성하였다. 마지막으로 Matlab의 Simulink를 이용하여 달착륙선의 착륙단계 시스템을 구성하고 이를 이용하여 시뮬레이션을 수행하였다.

An Analysis Code and a Planning Tool Based on a Key Element Index for Controlled Explosive Demolition

  • Isobe, Daigoro
    • 국제초고층학회논문집
    • /
    • 제3권4호
    • /
    • pp.243-254
    • /
    • 2014
  • In this study, a demolition analysis code using the adaptively shifted integration (ASI)-Gauss technique, which describes structural member fracture by shifting the numerical integration point to an appropriate position and simultaneously releasing the sectional forces in the element, is developed. The code was verified and validated by comparing the predicted results with those of several experiments. A demolition planning tool utilizing the concept of a key element index, which explicitly indicates the contribution of each structural column to the vertical load capacity of the structure, is also develped. Two methods of selecting specific columns to efficiently demolish the whole structure are demonstrated: selecting the columns from the largest index value and from the smallest index value. The demolition results are confirmed numerically by conducting collapse analyses using the ASI-Gauss technique. The numerical results suggest that to achieve a successful demolition, a group of columns with the largest key element index values should be selected when explosives are ignited in a simultaneous blast, whereas those with the smallest should be selected when explosives are ignited in a sequence, with a final blast set on a column with large index value.

MT 자료의 3차원 역산 개관 (Review on the Three-Dimensional Inversion of Magnetotelluric Date)

  • 김희준;남명진;한우리;최지향;이태종;송윤호;서정희
    • 지구물리와물리탐사
    • /
    • 제7권3호
    • /
    • pp.207-212
    • /
    • 2004
  • 자기지전류(MT) 자료의 3차원 역산에 대해 소개한다. MT 자료의 역산 문제는 기본적으로 악조건이므로 유일한 해가 존재하지 않는다. 이러한 비유일성을 줄이고 정확한 역산해를 구하기 위해서는 역산 시 사전정보를 추가하는 제약조건을 가해야 한다. 물리탐사 분야에서 비선형 역산에 사용되는 가장 일반적인 방법은 일련의 선형화된 역산문제를 푸는 Gauss-Newton법이다. 이 알고리듬은 수렴 시, 모델 공간에서 역산문제에 대한 목적함수를 최소화하는 최적해를 준다. 그러나 이러한 반복적 선형화기법은 3차원 MT 역산의 경우 Jacobian 행렬을 구하기 힘들기 때문에 그 유용성에 한계가 있다. 이러한 어려움은 CG법에 의해 완화할 수 있다. 선형 CG법은 Gauss-Newton 반복의 각 단계를 근사적으로 풀기 위해서 사용된다. 한편 비선형 CG법은 목적함수의 최소화에 직접적으로 적용된다. 이들 CG법은 Jacobian 행렬의 계산 및 대형 선형방정식의 해를 반복 당 세 번의 모델링으로 대치할 수 있어서 3차원 역산에 적합하다.