• Structural Engineering and Mechanics
• /
• v.73 no.1
• /
• pp.65-73
• /
• 2020

The present work describes a new time marching procedure for structural dynamics analyses. In this novel technique, time integration parameters are automatically evaluated according to the properties of the model. Such parameters are locally defined, allowing the user to input a numerical dissipation property for each element, which defines the amount of numerical dissipation to be introduced. Since the integration parameters are locally defined as a function of the structural element itself, the time marching technique adapts according to the model, providing enhanced accuracy. The new methodology is based on displacement-velocity relations and no computation of accelerations is required. Furthermore, the method is second order accurate, it has guaranteed stability, it is truly self-starting and it allows highly controllable algorithm dissipation in the higher modes. Numerical results are presented and compared to those provided by the Newmark and the Bathe methods, illustrating the good performance of the new time marching procedure.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.18 no.7
• /
• pp.1840-1850
• /
• 1994

Enhancement of numerical algorithms for low speed compressible flow will be considered. Contemporary time-marching algorithm has been widely accepted and applied as the method of choice for transonic, supersonic and hypersonic flows. In the low Mach number regime, time-marching algorithms do not fare as well. When the velocity is small, eigenvalues of the system of compressible equations differ widely so that the system becomes very stiff and the convergence becomes very slow. This characteristic can lead to difficulties in computations of many practical engineering problems. In the present approach, the time-derivative preconditioning method will be used to control the eigenvalue stiffness and to extend computational capabilities over a wide range of flow conditions (from very low Mach number to supersonic flow). Computational capabilities of the above algorithm will be demonstrated through computation of a variety of practical engineering problems.

• International Journal of Aeronautical and Space Sciences
• /
• v.1 no.1
• /
• pp.1-12
• /
• 2000

The wake geometries of a two-bladed rotor in axial flights using a time-marching free-wake method without a non-physical model of the far wake are calculated. The computed free-wake geometries of AH-1G model rotor in climb flight are compared with the experimental visualization results. The time-marching free-wake method can predict the behavior of the tip vortex and the wake roil-up phenomena with remarkable agreements. Tip vortices shed from the two-bladed rotor can interact with each other significantly. The interaction consists of a turn of the tip vortex from one blade rolling around the tip vortex from the other. Wake expansion of wake geometries in radial direction after the contraction is a result of adjacent tip vortices begging to pair together and spiral about each other. Detailed numerical results show regular pairing phenomenon in the climb flights, the hover at high angle of attack and slow descent flight too. On the contrary, unstable motions of wake are observed numerically in the hover at low angle of attack and fast descent flight. It is because of the inherent wake instability and blade-vortex-interaction rather then the effect of recirculation due to the experimental equipment.

• International Journal of Aeronautical and Space Sciences
• /
• v.5 no.2
• /
• pp.62-70
• /
• 2004

CFD method has been coupled with a time-marching free-wake model by usingfield velocity approach suggested by J. D. Baeder (Ref. 1). The coupled method hasbeen applied to rectangular and BERP-like blades and the calculated perfonnance dataare compared with the experimental results.For hovering analysis, the present method could yield sufficiently good resultswith reasonable computation time and is particularly suitable for the flow fieldanalysis with the complex shaped blade.

• Journal of the Korea Computer Graphics Society
• /
• v.24 no.1
• /
• pp.1-8
• /
• 2018

We propose a modified real-time marching cubes technique that extracts isosurfaces in the form of connected meshes instead of triangle soup. In this way, a various mesh-based isosurface rendering techniques can be implemented and additional information of the isosurfaces such as its topology can be extracted in real-time. In addition, we propose a real-time technique to extract adjacency-triangle structure for geometry shaders that can be used for various shading effects such as silhouette rendering. Compared with the previous technique that welds the output triangles of classical marching cubes, our technique shows up to 300% performance improvement.

• Proceedings of the Korean Society of Propulsion Engineers Conference
• /
• 2004.03a
• /
• pp.15-25
• /
• 2004

This paper outlines a new convergence acceleration de-signed to solve scramjet flowfields with zones of re-circulation. Named the “marching-window”, the algorithm consists of performing pseudo-time iterations on a minimal width subdomain composed of a sequence of cross-stream planes of nodes. The upstream boundary of the subdomain is positioned such that all nodes upstream exhibit a residual smaller than the user-specified convergence threshold. The advancement of the downstream boundary follows the advancement of the upstream boundary, except in zones of significant streamwise ellipticity where a streamwise ellipticity sensor ensures its continuous progress. Compared to the standard pseudo-time marching approach, the march-ing-window is here seen to decrease the work required for convergence by up to 24 times for supersonic flows with little streamwise ellipticity and by up to 8 times for supersonic flows with large streamwise separated regions. The memory requirements are observed to be reduced sixfold by not allocating memory to the nodes not included in the computational subdomain. The marching-window satisfies the same convergence criterion as the standard pseudo-time stepping methods, hence resulting in the same converged solution within the tolerance of the user-specified convergence threshold. The extension of the marching-window to the weakly-ionized Navier-Stokes equations is also discussed.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.37 no.4
• /
• pp.329-335
• /
• 2009

The unsteady panel and time-marching free wake are applied to the rotor aerodynamics and wake behaviour. Numerical results of panel and free wake are compared and validated with experimental data. Using these methods, unsteady rotor aerodynamics in BVI condition is analyzed and discussed in detail.

• Journal of computational fluids engineering
• /
• v.20 no.1
• /
• pp.32-38
• /
• 2015

A 3-dimensional compressible turbulent boundary layer solver has been developed. A time marching method is used to integrate the turbulent boundary layer equations. While the direct integration of the boundary layer equations is performed for unseparated flow regions, the inverse integration is performed for separated flow regions. The program is verified for flows that have analytical solutions or other numerical results. The solver will be merged with an Euler solver for viscous-inviscid interaction.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.9 no.2 s.25
• /
• pp.152-160
• /
• 2006

Time marching methods are well-suited for high speed compressible flow computations. However, it is well known that the time marching methods suffer a slow down in convergence due to disparity in Eigenvalues. A local preconditioning method is one of numerical methods to enhance convergence characteristics of low mach number flows by modifying Eigenvalues of the governing equations. In this paper, the local preconditioning method of Weiss is applied to a 2 dimensional Navier-Stokes code and the efficiency of the preconditioning method is shown through a number of computational examples.

• Journal of the Korea Computer Graphics Society
• /
• v.26 no.4
• /
• pp.17-26
• /
• 2020

We present a real-time GPU(Graphic Processing Unit) marching tetrahedra technique that extracts isosurfaces in the indexed mesh format from BCC(Body Centered Cubic) volume datasets. Compared to classical marching tetrahedra, our method shows better performance with little memory overhead. Our technique is composed of five stages. In the first stage, which needs to be done only once, we build min/max blocks that is to be used for empty space skipping to boost the performance. Next, we extract active blocks that contain the current isovalue. In the next two stages, we extract the edges and cells that contain the isosurface and then the final triangular mesh is generated in the last stage. When applied 512³ or higher resolution volume dataset, our technique shows up to 5 times speed improvement compared to the classical marching tetrahedra algorithm.