• 대한기계학회논문집A
• /
• 제24권7호
• /
• pp.1878-1884
• /
• 2000

In multibody dynamic analysis, one of the most important problems is to reduce computation times for real time simulation. In this paper, a symbolic computation method is implemented and tested for each dynamic analysis step. Applying symbolic formulations to the vehicle dynamics program AutoDyn7, the effectiveness of the symbolic computation method is verified.

• 한국소음진동공학회논문집
• /
• 제12권9호
• /
• pp.674-684
• /
• 2002

In order to decrease remarkably the computation time and storage used in the direct integration method without the loss of accuracy, authors suggest a new transient analysis algorithm. This algorithm is derived from the combination of three techniques, that is, the transfer technique of the transfer stiffness coefficient method, the modeling technique of the finite element method, and the numerical integration technique of the Newmark method. In this paper, the transient analysis algorithm of a frame structure is formulated by the proposed method. The accuracy and computation efficiency of the proposed method are demonstrated through the comparing with the computation results by the direct integration method for three computation models under various excitations.

• 한국항공운항학회지
• /
• 제6권1호
• /
• pp.21-29
• /
• 1998

The purpose of the present paper is to determine the time required and error tolerance limits for flight data computation. The results of statistical analysis showed that the calculator side computation required about 50 seconds for each question and wind side computation needed about 115 seconds for each question. In case of error tolerance limits, it was found that the error tolerance limit for altitude computation war 90 feet and two knots of interval was recommanded for the speed computation in calculator side, and one degree of interval for heading computation and five knots interval for speed computation in wind side.

• Nuclear Engineering and Technology
• /
• 제53권7호
• /
• pp.2162-2173
• /
• 2021

In this paper, the coupling of fine-mesh computational fluid dynamics (CFD) thermal-hydraulics (TH) code and neutronics code is achieved using the Ansys Fluent User Defined Function (UDF) for code development, including parallel meshing mapping, data computation, and data transfer. Also, some CFD schemes are designed for mesh mapping and data transfer to guarantee physical conservation in the coupling computation. Because there is no rigorous research that gives robust guidance on the various CFD schemes that must be obtained before the fine-mesh coupling computation, this work presents a quantitative analysis of the CFD meshing and mapping schemes to improve the accuracy of the value and location of key physical prediction. Furthermore, the effect of the sub-pin scale coupling computation is also studied. It is observed that even the pin-resolved coupling computation can also create a large deviation in the maximum value and spatial locations, which also proves the significance of the research on mesh mapping and data transfer for CFD code in a coupling computation.

• 대한기계학회:학술대회논문집
• /
• 대한기계학회 2001년도 춘계학술대회논문집E
• /
• pp.512-517
• /
• 2001

In this study, spin-up flows in a rectangular container are analysed by using three-dimensional computation. In the numerical computation, we use the parallel computer system of PC-cluster type. We compared our results with those obtained by two-dimensional computation. Effect of velocity and vorticity on the flow is studied. The result shows that two-dimensional solution is in good agreement with the 3-D result. Attention is given to the region where the 3-D flow is significant.

• 대한전기학회논문지:전기물성ㆍ응용부문C
• /
• 제54권1호
• /
• pp.41-44
• /
• 2005

A new method to reduce the computation time in power/ground-plane analysis is proposed. The existing method using the two dimensional infinite series summation take a lot of computation time. The proposed method is based on the approximation of impedance in the frequency domain through the Mobius transform. This method shows the good accuracy and the high speed in computing. In the case of impedance calculation for 9'x4' board, the proposed method takes 0.16 second of computing time whereas the existing method takes 2.2 second. This method can be applied to the analysis and design of power/ground-plane that need a lot of computation steps.

• 한국정밀공학회지
• /
• 제12권9호
• /
• pp.137-147
• /
• 1995

The unbalance response analysis is one of the essential area in the forced vibration analysis of rotor-bearing systems. Local bearing parameters in rotor-bearing systems are the major sources which give rise to a difficulty in unbalance response computation due to the complicated dynamic properties such as rotational speed dependency and anisotropy. In the present paper, an efficient method for unbalance responses is proposed so as to easily take into account bearing parameters in computation. An exact matrix condensation procedure is proposed which enables the present method to compute unbalance responses by dealing with condensed, small matrices. The proposed method causes no errors even though the computation procedure is based on the small matrices condensed from the full matrices. The present method is illustrated through a numerical example and compared with the conventional method.

• 대한기계학회논문집A
• /
• 제33권12호
• /
• pp.1433-1441
• /
• 2009

In multibody dynamic analysis, one of the most important problems is to reduce computation times for real-time simulation. This paper presents the derivation procedure of equations of motion of a 6${\times}$6 autonomous vehicle in terms of chassis local coordinates which do not require coordinates transformation matrix to enhance efficiency for real-time dynamic analysis. Also, equations of motion are derived using the VT(velocity transformation) technique and symbolic computation method coded by MATLAB. The Jacobian matrix of the equations of motion of a system is derived from symbolic operations to apply the implicit integration method. The analysis results were compared with ADAMS results to verify the accuracy and approve the feasibility of real time analysis.

• Nuclear Engineering and Technology
• /
• 제46권5호
• /
• pp.641-654
• /
• 2014

A new computer code, named CORONA (Core Reliable Optimization and thermo-fluid Network Analysis), was developed for the core thermo-fluid analysis of a prismatic gas cooled reactor. The CORONA code is targeted for whole-core thermo-fluid analysis of a prismatic gas cooled reactor, with fast computation and reasonable accuracy. In order to achieve this target, the development of CORONA focused on (1) an efficient numerical method, (2) efficient grid generation, and (3) parallel computation. The key idea for the efficient numerical method of CORONA is to solve a three-dimensional solid heat conduction equation combined with one-dimensional fluid flow network equations. The typical difficulties in generating computational grids for a whole core analysis were overcome by using a basic unit cell concept. A fast calculation was finally achieved by a block-wise parallel computation method. The objective of the present paper is to summarize the motivation and strategy, numerical approaches, verification and validation, parallel computation, and perspective of the CORONA code.

• 전자공학회논문지A
• /
• 제31A권6호
• /
• pp.159-168
• /
• 1994

Stochastic computation is adopted to reduce the silicon area of the multipliers in implementing neural network in VLSI. In addition to this advantage, the stochastic computation has inherent random errors which is required for implementing Boltzmann machine. This random noise is useful for the simulated annealing which is employed to achieve the global minimum for the Boltzmann Machine. In this paper, we propose a method to implement the Boltzmann machine with stochastic computation and discuss the addition problem in stochastic computation and its simulated annealing in detail. According to this analysis Boltzmann machine using stochastic computation is suitable for the pattern recognition/completion problems. We have verified these results through the simulations for XOR, full adder and digit recognition problems, which are typical of the pattern recognition/completion problems.