• 한국전산유체공학회:학술대회논문집
• /
• 1999.11a
• /
• 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,

• Journal of Communications and Networks
• /
• v.16 no.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.

• Journal of the Earthquake Engineering Society of Korea
• /
• v.23 no.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.

• Journal of Institute of Control, Robotics and Systems
• /
• v.13 no.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.

• Nuclear Engineering and Technology
• /
• v.55 no.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.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.6
• /
• pp.62-71
• /
• 2013

The passive emitter location method using TDOA and FDOA measurements has higher accuracy comparing to the single TDOA or FDOA based method. Moreover, it is able to estimate the velocity vector of a moving platform. Recently, several non-iterative methods were suggested using the nuisance parameter but the common reference sensor is needed for each pair of sensors. They show also relatively low performance in the case of a long range between the sensor groups and the emitter. To solve this, we derive the estimation method of the position and velocity of a moving platform based on the Gauss-Newton method. In addition, to analyze the estimation performance of the position and velocity, respectively, we decompose the CRLB matrix into each subspace. Simulation results show the estimation performance of the derived method and the CEP planes according to the given geometry of the sensors.

• Tribology and Lubricants
• /
• v.28 no.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.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.39 no.5
• /
• pp.408-415
• /
• 2011

The moon landing is composed of the de-orbit descent phase, powered descent phase, and the powered descent phase is divide into 3-sub phase of the braking, approach, final landing phase. In this paper, the lunar lander perform landing control using 3-sub phase of optimal trajectory. First, generate the reference trajectory using gauss pseudo-spectral method. Thereafter generate PID controller using altitude and velocity error in each direction. Finally the lunar lander landing system constitute using the Simulink of Matlab, and perform simulation.

• International Journal of High-Rise Buildings
• /
• v.3 no.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.

• Geophysics and Geophysical Exploration
• /
• v.7 no.3
• /
• pp.207-212
• /
• 2004

This article reviews recent developments in three-dimensional (3-D) magntotelluric (MT) imaging. The inversion of MT data is fundamentally ill-posed, and therefore the resultant solution is non-unique. A regularizing scheme must be involved to reduce the non-uniqueness while retaining certain a priori information in the solution. The standard approach to nonlinear inversion in geophysis has been the Gauss-Newton method, which solves a sequence of linearized inverse problems. When running to convergence, the algorithm minimizes an objective function over the space of models and in the sense produces an optimal solution of the inverse problem. The general usefulness of iterative, linearized inversion algorithms, however is greatly limited in 3-D MT applications by the requirement of computing the Jacobian(partial derivative, sensitivity) matrix of the forward problem. The difficulty may be relaxed using conjugate gradients(CG) methods. A linear CG technique is used to solve each step of Gauss-Newton iterations incompletely, while the method of nonlinear CG is applied directly to the minimization of the objective function. These CG techniques replace computation of jacobian matrix and solution of a large linear system with computations equivalent to only three forward problems per inversion iteration. Consequently, the algorithms are efficient in computational speed and memory requirement, making 3-D inversion feasible.