• Proceedings of the Korean Nuclear Society Conference
• /
• 2004.10a
• /
• pp.151-152
• /
• 2004

An acceleration technique combined with the discrete ordinates method which has been widely used in the solution of neutron transport phenomena is applied to the solution of radiative transfer equation. The self-adjoint form of the second order radiation intensity equation is used to enhance the stability of the solution, and a new linearization method is developed to avoid the nonlinearity of the material temperature equation. This new acceleration method is applied to the well known Marshak wave problem, and the numerical result is compared with that of a non-accelerated calculation

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.16 no.5
• /
• pp.899-909
• /
• 1992

An iterative solution technique is presented to analyze the dynamic systems of rigid bodies subjected to kinematic constraints. Lagrange multipliers associated with the constraints are iteratively computed by monotonically reducing an appropriately defined constraint error vector, and the resulting equation of motion is solved by a well-established ODE technique. Constraints on the velocity and acceleration as well as the position are made to be satisfied at joints at each time step. Time integration is efficiently performed because decomposition or orthonormalization of the large matrix is not required at all. An acceleration technique is suggested for the faster convergence of the iterative scheme.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.5 no.2
• /
• pp.120-126
• /
• 1997

In this study, an effective estimation method of wheel acceleration is presented. The wheel acceleration is mainly used in the ABS(anti-lick brake system) and the TCS(traction control system). The wheel acceleration is a derivative term of the wheel speed which is generally measured by the wheel speed sensors. The results of a simple differentiation of the signal and an observation of the signal by Kalman filter show that Kalman filter has better performance than the simple differentiation. The differentiated sine signal which is contaminated with random noise shows a rugged signal compared with the signal which is filtered by the Kalman filter. The covariance of the differentiated signal is higher than that of the Kalman-filtered signal, too. The presented Kalman filter technique shows an effective way of solution to get the estimated wheel acceleration value which is sufficient to be applied to ABS or TCS control algorithms.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.22 no.1
• /
• pp.15-28
• /
• 2018

Recently Machine Learning algorithms are widely used to process Big Data in various applications and a lot of these applications are executed in run time. Therefore the speed of Machine Learning algorithms is a critical issue in these applications. However the most of modern iteration Machine Learning algorithms use a successive iteration technique well-known in Numerical Linear Algebra. But this technique has a very low convergence, needs a lot of iterations to get solution of considering problems and therefore a lot of time for processing even on modern multi-core computers and clusters. Tchebychev iteration technique is well-known in Numerical Linear Algebra as an attractive candidate to decrease the number of iterations in Machine Learning iteration algorithms and also to decrease the running time of these algorithms those is very important especially in run time applications. In this paper we consider the usage of Tchebychev iterations for acceleration of well-known K-Means and SVM (Support Vector Machine) clustering algorithms in Machine Leaning. Some examples of usage of our approach on modern multi-core computers under Apache Spark framework will be considered and discussed.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.1387-1391
• /
• 2003

The fundamental aim of this paper is to present a solution algorithm to achieve cooperative contour controlling, under joint acceleration constraint with maximum cooperative speed. Usually, the specifications like maximum velocity of cooperative trajectory are determined by the application itself. In resolving the cooperative trajectory into two complementary trajectories, an optimum task resolving strategy is employed so that the task assignment for each robot is fair under the joint acceleration constraint. The proposed algorithm of being an off-line technique, this could be effectively and conveniently extended to the existing servo control systems irrespective of the computational power of the controller implemented. Further, neither a change in hardware setup nor considerable reconfiguration of the existing system is required in adopting this technique. A simulation study has been carried out to verify that the proposed method can be realized in the generation of complementary trajectories so that they could meet the stipulated constraints in simultaneous maneuvering.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.16 no.12
• /
• pp.2298-2305
• /
• 1992

To obtain the convenient solution of the multibody dynamic systems composed of flexible beams, linear finite element technique is adopted and the nodal coordinates are interpolated in the global inertia frame. Mass matrix becomes an extremely simple constant matrix and the force vector also becomes extremely simple because Coriolis acceleration and centrifugal force are not required. And the elastic force is also simply computed from the moving frame attached to the material. To solve the global differential algebraic euation. an ODE technique is adopted after Lagrange multiplier is computed by the accelerated iterative technique, and the time demanding procedures such as Newton-Raphson iterations and decomposition of the big matrix are not required. The accuracy of the present solution is checked by a well-known example problem.

• Proceedings of the Earthquake Engineering Society of Korea Conference
• /
• 1998.10a
• /
• pp.304-311
• /
• 1998

An algorithm to enhance spectra matching of acceleration time history used in the seismic analysis of nuclear power plants(NPP) is proposed. The new scheme provides the solution on the highly fluctuating and over conservatism problems that happened in order to satisfy design spectrum enveloping criteria in the traditional method. To obtain optimized spectrum for a time history, a spectrum matching procedure that adapts a system identification technique is also developed. The algorithm also introduces maximum displacement control, baseline correction, clipping and raising of maximum peak of time history, and power spectral density (PSD) control of time history. It is verified through numerical examples that this new scheme can definitely generate acceleration time history, closely matching the target spectra and satisfying other stipulated requirements.

• Transactions of the Korean Society for Noise and Vibration Engineering
• /
• v.24 no.1
• /
• pp.45-53
• /
• 2014

For the time integration solution of the impulsive dynamic contact problem of high-speed rotating disks formulated by the finite element technique, the velocity and acceleration contact constraints as well as the displacement contact constraint are imposed for the numerical stability without spurious oscillations. The solution of the present technique is checked by the numerical simulation using the concentric high-speed rotating disks with the clearance and impulsive loading. It is shown that the almost steady state solution agrees with the corresponding analytical solution of the elasticity and that the differentiated constraints are crucial for the numerical stability of such high-speed contact problems of the disks under impulsive loading.

• 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 Mathematical Society
• /
• v.51 no.4
• /
• pp.679-702
• /
• 2014

Investigation of the numerical solution of singularly perturbed turning point problems dates back to late 1970s. However, due to the presence of layers, not many high order schemes could be developed to solve such problems. On the other hand, one could think of applying the convergence acceleration technique to improve the performance of existing numerical methods. However, that itself posed some challenges. To this end, we design and analyze a novel fitted operator finite difference method (FOFDM) to solve this type of problems. Then we develop a fitted mesh finite difference method (FMFDM). Our detailed convergence analysis shows that this FMFDM is robust with respect to the singular perturbation parameter. Then we investigate the effect of Richardson extrapolation on both of these methods. We observe that, the accuracy is improved in both cases whereas the rate of convergence depends on the particular scheme being used.