• Structural Engineering and Mechanics
• /
• v.67 no.6
• /
• pp.603-616
• /
• 2018

In this study, the acceleration vector in each time step is assumed to be a mth order time polynomial. By using the initial conditions, satisfying the equation of motion at both ends of the time step and minimizing the square of the residual vector, the m+3 unknown coefficients are determined. The order of accuracy for this approach is m+1, and it has a very low dispersion error. Moreover, the period error of the new technique is almost zero, and it is considerably smaller than the members of the Newmark method. The proposed scheme has an appropriate domain of stability, which is greater than that of the central difference and linear acceleration techniques. The numerical tests highlight the improved performance of the new algorithm over the fourth-order Runge-Kutta, central difference, linear and average acceleration methods.

• Kyungpook Mathematical Journal
• /
• v.57 no.2
• /
• pp.287-299
• /
• 2017

In this paper, we develop an enhanced Chebyshev collocation method based on an integration scheme of the generalized Chebyshev interpolations for solving stiff initial value problems. Unlike the former error embedded Chebyshev collocation method (CCM), the enhanced scheme calculates the solution and its truncation error based on the interpolation of the derivative of the true solution and its integration. In terms of concrete convergence and stability analysis, the constructed algorithm turns out to have the $7^{th}$ convergence order and the A-stability without any loss of advantages for CCM. Throughout a numerical result, we assess the proposed method is numerically more efficient compared to existing methods.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.10 no.3
• /
• pp.57-65
• /
• 1990

The finite element menthod for the investigation of the static and dynamic stability of the plane framed structures subjected to non-conservative forces is presented. By using the Hermitian polynomial as the shape function, the geometric stiffness matrix, the load correction stiffness matrix for non-conservative forces, and the matrix equation of internal and external damping are derived. Then, a matrix equation of the motion for the non-conservative system is formulated and the critical divergence and flutter loads are determined from this equation.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.442-442
• /
• 2000

The intelligent auto-tuning method fur a strongly stable adaptive control system of a DC motor with great load inertia variation is proposed. The stable characteristic polynomial that is designed by an optimal servo is specified for the adaptive pole placement control system. The appropriate adaptive control system can be derived, by adjusting automatically the weight of a performance criterion in optimal control by means of the fuzzy inference on the basis of the stability index.

• Journal of the Korean Society for Precision Engineering
• /
• v.18 no.11
• /
• pp.58-66
• /
• 2001

GPC has been reported as a useful self-tuning control algorithm for systems with unknown time-delay and parameters. GPC is easy to understand and implement, and thus has won popularity among many practicing engineers. Despite its success, GPC does not guarantee is nominal stability. So, in this paper, GPC is rederived in frequency domain instead of in the time domain to guarantee its nominal stability. Derivation of GPC in frequency domain involves spectral factorization and Diophantine equation. Frequency domain GPC control law is stable because the zeros of characteristic polynomial are strictly Schur. Recursive least square algorithm is used to identify unknown parameters. To see the effectiveness of the proposed controller, the controller is simulated for a numerical problem that changes in dead-time, in order and in parameters.

• Proceedings of the KIEE Conference
• /
• 1998.11b
• /
• pp.546-548
• /
• 1998

This paper deals with ZMP trajectory generation in multi step walking of IWR-III(Inha Walking Robot) Biped Walking Robot. Biped walking is realized by combining 6-types of pre-defined steps and the actual ZMP can be used as a stability index of a robot. For the good tracking of actual ZMP, desired ZMP trajectory is generated during the whole walking time not for each step. Trajectory generation is performed considering velocities and accelerations of given via points using 5-th order polynomial interpolation method. As a result, balancing joints have a more smooth and continuous motion and actual ZMP has a better tracking ability. Numerical simulator is done by MATLAB to guarantee the walking of a robot satisfying the ZMP stability.

• Nuclear Engineering and Technology
• /
• v.49 no.6
• /
• pp.1143-1156
• /
• 2017

This paper describes recent development activities of the GENESIS code, which is a transport code for heterogeneous three-dimensional geometry, focusing on applications to reactor core analysis. For the treatment of anisotropic scattering, the concept of the simplified Pn method is introduced in order to reduce storage of flux moments. The accuracy of the present method is verified through a benchmark problem. Next, the iteration stability of the GENESIS code for the highly voided condition, which would appear in a severe accident (e.g., design extension) conditions, is discussed. The efficiencies of the coarse mesh finite difference and generalized coarse mesh rebalance acceleration methods are verified with various stabilization techniques. Use of the effective diffusion coefficient and the artificial grid diffusion coefficients are found to be effective to stabilize the acceleration calculation in highly voided conditions.

• Korean Journal of Agricultural Science
• /
• v.41 no.3
• /
• pp.169-175
• /
• 2014

Objective of this study was to investigate effects of pre-processing method and number of sampling leaves on stability of the reflectance measurement for Chinese cabbage and kale leaves. Chinese cabbage and kale were transplanted and cultivated in a plant factory. Leaf samples of the kale and cabbage were collected at 4 weeks after transplanting of the seedlings. Spectra data were collected with an UV/VIS/NIR spectrometer in the wavelength region from 190 to 1130 nm. All leaves (mature and young leaves) were measured on 9 and 12 points in the blade part in the upper area for kale and cabbage leaves, respectively. To reduce the spectral noise, the raw spectral data were preprocessed by different methods: i) moving average, ii) Savitzky-Golay filter, iii) local regression using weighted linear least squares and a $1^{st}$ degree polynomial model (lowess), iv) local regression using weighted linear least squares and a $2^{nd}$ degree polynomial model (loess), v) a robust version of 'lowess', vi) a robust version of 'loess', with 7, 11, 15 smoothing points. Effects of number of sampling leaves were investigated by reflectance difference (RD) and cross-correlation (CC) methods. Results indicated that the contribution of the spectral data collected at 4 sampling leaves were good for both of the crops for reflectance measurement that does not change stability of measurement much. Furthermore, moving average method with 11 smoothing points was believed to provide reliable pre-processed data for further analysis.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.2
• /
• pp.443-446
• /
• 2005

As modern society needs to process of acquisition, storage and transmission of much information, the importance of signal processing is increasing and various digital filters are used in the two-dimensional signal such as image. And kinds of these digital filters are IIR(infinite impulse response) filter and FIR(finite impulse response) filter. And FIR filter which has the phase linearity, the easiness of creation and stability is applied to many fields. In design of this FIR filter, flatness property is a important factor in pass-band and stop-band. In this paper, we designed a 2-D Circular FIR filter using the Bernstein polynomial, it is presented flatness property in pass-band and stop-band. And we simulated the designed filter with noisy test image and compared the results with existing methods.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.4
• /
• pp.611-618
• /
• 1995

In the high information societies, the requirement of encryption security is increasing so as to protect information from the threat of attacks by illegal changes of data, illegal leakage of data, disorder of data sequences and the unauthorized sender and an unauthorized receiver etc. In this paper, multivariable knapsack crytosystem is proposed for security of computer communication. This system is securer and simpler than the conventional knapsack cryptosystems. And, proposed cryptosystem composed what represented each element of superincreasing vector with multivar able polynomial after transforming it of ciphervector. For the deciphering of ciphertext, the plaintext is determined by using the integers of secret and the superincreasing vector of secret key. Thus, the stability of this cryptosystem is based on the difficulty of obtaining the root that ciphervector becomes the superincreasing vector, in substituting the integers of secret for ciphervector to represent with the miltivariable polynomial. The propriety of proposed multivariable knapsack cryptosystem was proved through computer simulation.