• International Journal of Aeronautical and Space Sciences
• /
• v.14 no.2
• /
• pp.112-121
• /
• 2013

An approach for composing a performance optimized computational code is suggested for the latest microprocessors. The concept of the code optimization, termed localization, is maximizing the utilization of the second level cache that is common to all the latest computer systems, and minimizing the access to system main memory. In this study, the localized optimization of the LU-SGS (Lower-Upper Symmetric Gauss-Seidel) code for the solution of fluid dynamic equations was carried out in three different levels and tested for several different microprocessor architectures widely used these days. The test results of localized optimization showed a remarkable performance gain of more than two times faster solution than the baseline algorithm for producing exactly the same solution on the same computer system.

• 한국전산유체공학회:학술대회논문집
• /
• 2001.05a
• /
• pp.93-98
• /
• 2001

An adaptive Cartesian grid method having the best elements of structured, unstructured, and Cartesian grids is developed to solve the steady two-dimensional Euler equations. The solver is based on a cell-centered finite-volume method with Roe's flux-difference splitting and implicit point Gauss-seidel time integration method. Calculations of several compressible flows are carried out to show the efficiency of the developed computer code. The results were generally in good agreements with existing data in the literature and the developed code has the good ability to capture important feature of the flows.

• 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.

• 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.30 no.7
• /
• pp.68-80
• /
• 2002

An approach for composing a performance optimized computational code is suggested for latest microprocessors. The concept of the code optimization, called here as localization, is maximizing the utilization of the second level cache that is common to all the latest computer system, and minimizing the access to system main memory. In this study, the localized optimization of LU-SGS (Lower-Upper Symmetric Gauss-Seidel) code for the solution of fluid dynamic equations was carried out in three different levels and tested for several different microprocessor architectures most widely used in these days. The test results of localized optimization showed a remarkable performance gain up to 7.35 times faster solution, depending on the system, than the baseline algorithm for producing exactly the same solution on the same computer system.

• International Journal of Aerospace System Engineering
• /
• v.2 no.2
• /
• pp.40-43
• /
• 2015

A hybrid mesh based finite volume compressible flow code (PolySim) has been developed recently. Instead of the simple average method for the gradients of variables at each face, the volume average is applied for the calculation of the viscous flux. What is more, an improved Green Gauss method for the calculation of the gradient is also presented. These two techniques will improve both the accuracy and robustness of the code. The aerodynamic performance of this in-house cell centered code is examined by several widely-used bench-mark test cases. These cases include flows over flat plate and RAE 2822 etc. The comparisons on results between calculation and experiment are conducted. They show that the code can produce good numerical results which agree well with the corresponding experiment data.

• East Asian mathematical journal
• /
• v.32 no.5
• /
• pp.767-774
• /
• 2016

Manturov inroduced the parity bracket polynomial by using a parity of virtual knots, which is an extension of Jones-Kauffman polynomial. We extend Manturov's result to virtual links, so that we obtain the parity bracket polynomial for virtual links and give some examples.

• Proceedings of the IEEK Conference
• /
• 2005.11a
• /
• pp.69-72
• /
• 2005

In this paper, pseudo noise (PN) code acquisition performance with multiple antennas in a UWB time hopping/code division multiple access system is analyzed. The closed form for the conditional probability is derived, using the Gauss-Hermite quadrature formula, when the signal with Gaussian distribution goes through the lognormal fading channel. The performance comparison of the above mentioned schemes shows that the code acquisition performance with a diversity combining technique, especially when increasing the number of antennas, is more robust than that using no diversity.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.25 no.4
• /
• pp.319-325
• /
• 2007

In case of more than 50km baseline length, the correlation between receivers is reduced. Therefore, there are still some rooms for improvement of its positional accuracy. In this paper, the stochastic modeling of the ionospheric delay is applied and its effects are analyzed. The data processing has been performed by constructing a Kalman filter with states of positions, ambiguities, and the ionospheric delays in the double differenced mode. Considering the medium or long baseline length, both double differenced GPS phase and code observations are used as observables and LAMBDA has been applied to fix the ambiguities. The ionospheric delay is stochastically modeled by well-known 1st order Gauss-Markov process. And the correlation time and variation of 1st order Gauss-Markov process are calculated. This paper gives analyzed results of developed algorithm compared with commercial software and Bernese.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.9
• /
• pp.3458-3481
• /
• 2021

Existing methods for blind identification of linear block codes without a candidate set are mainly built on the Gauss elimination process. However, the fault tolerance will fall short when the intercepted bit error rate (BER) is too high. To address this issue, we apply the reverse algebra approach and propose a novel "two-step-screening" algorithm by solving the linear error equations on the binary Galois field, or GF(2). In the first step, a recursive matrix partition is implemented to solve the system linear error equations where the coefficient matrix is constructed by the full codewords which come from the intercepted noisy bitstream. This process is repeated to derive all those possible parity-checks. In the second step, a check matrix constructed by the intercepted codewords is applied to find the correct parity-checks out of all possible parity-checks solutions. This novel "two-step-screening" algorithm can be used in different codes like Hamming codes, BCH codes, LDPC codes, and quasi-cyclic LDPC codes. The simulation results have shown that it can highly improve the fault tolerance ability compared to the existing Gauss elimination process-based algorithms.