• Interaction and multiscale mechanics
• /
• v.2 no.4
• /
• pp.333-352
• /
• 2009

We introduce a radial basis collocation method to solve axially moving beam problems which involve $2^{nd}$ order differentiation in time and $4^{th}$ order differentiation in space. The discrete equation is constructed based on the strong form of the governing equation. The employment of multiquadrics radial basis function allows approximation of higher order derivatives in the strong form. Unlike the other approximation functions used in the meshfree methods, such as the moving least-squares approximation, $4^{th}$ order derivative of multiquadrics radial basis function is straightforward. We also show that the standard weighted boundary collocation approach for imposition of boundary conditions in static problems yields significant errors in the transient problems. This inaccuracy in dynamic problems can be corrected by a statically condensed semi-discrete equation resulting from an exact imposition of boundary conditions. The effectiveness of this approach is examined in the numerical examples.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.34 no.2
• /
• pp.30-34
• /
• 2011

Variable precision rough set models have been successfully applied to problems whose domains are discrete values. However, there are many situations where discrete data is not available. When it comes to the problems with interval values, no variable precision rough set model has been proposed. In this paper, we propose a variable precision rough set model for interval values in which classification errors are allowed in determining if two intervals are same. To build the model, we define equivalence class, upper approximation, lower approximation, and boundary region. Then, we check if each of 11 characteristics on approximation that works in Pawlak's rough set model is valid for the proposed model or not.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.10 no.3
• /
• pp.130-134
• /
• 1985

In two-dimensional discrete cosine transform(DCT) coding, the measurements of the distributions of the transform coefficients are important because a better approximation yields a smaller mean square distorition. This paper presents the results of distribution tests which indicate that the statistics of the AC coefficients are well approximated to a generalized Gaussian distribution whose shape parameter is 0.6. Furthermore, from a simulation of the DCT coding, it was shown that the above approximation yields a higher experimental SNR and a better agreement between theory and simulation than the Gaussian or Laplacian assumptions.

• Journal of applied mathematics & informatics
• /
• v.32 no.5_6
• /
• pp.567-584
• /
• 2014

In this paper, we consider approximation of eigenelements of a two dimensional compact integral operator with a smooth kernel by discrete collocation and iterated discrete collocation methods. By choosing numerical quadrature appropriately, we obtain convergence rates for gap between the spectral subspaces, and also we obtain superconvergence rates for eigenvalues and iterated eigenvectors. We then apply Richardson extrapolation to obtain further improved error bounds for the eigenvalues. Numerical examples are presented to illustrate theoretical estimates.

• Journal of Korean Institute of Industrial Engineers
• /
• v.42 no.5
• /
• pp.304-313
• /
• 2016

This work suggests a new analysis approach for a discrete-time GI/G/1 queue with multiple vacations. The method used is called a modified supplementary variable technique and our result is an exact transform-free expression for the steady state queue length distribution. Utilizing this result, we propose a simple two-moment approximation for the queue length distribution. From this, approximations for the mean queue length and the probabilities of the number of customers in the system are also obtained. To evaluate the approximations, we conduct numerical experiments which show that our approximations are remarkably simple yet provide fairly good performance, especially for a Bernoulli arrival process.

• The Korean Journal of Applied Statistics
• /
• v.7 no.2
• /
• pp.323-333
• /
• 1994

In this paper we present some approximation theorems related to the problem of finding optimal densities with prescribed moments. The implementation of the approximation theorems is to be done in some examples.

• Bulletin of the Korean Mathematical Society
• /
• v.48 no.5
• /
• pp.897-915
• /
• 2011

In this paper, we develop a symmetric Galerkin method with interior penalty terms to construct fully discrete approximations of the solution for nonlinear Sobolev equations. To analyze the convergence of discontinuous Galerkin approximations, we introduce an appropriate projection and derive the optimal $L^2$ error estimates.

• Proceedings of the KIEE Conference
• /
• 1999.11c
• /
• pp.591-593
• /
• 1999

The finite time optimum regulation problem of a discrete time bilinear system with a quadratic performance criterion is obtained in terms of a sequence discrete algebraic Lyapunov equations. Our new method is based on the successive approximations. This algorithm saves the computation time to solve the optimal problem, and the design procedure is illustrated for an example.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.571-574
• /
• 2005

This paper gives some sufficient conditions for a given polyhedral set which is represented as a set of linear inequalities to be positive D-invariant for uncertain linear discrete-time systems in the case such that the systems matrices depend linearly on uncertain parameters whose ranges are given intervals. Further, the results will be applied to uncertain linear continuous systems in the sense of the above by using Euler approximation.

• Journal of applied mathematics & informatics
• /
• v.28 no.3_4
• /
• pp.953-966
• /
• 2010

In this paper, we develop discontinuous Galerkin methods with penalty terms, namaly symmetric interior penalty Galerkin methods to solve nonlinear parabolic equations. By introducing an appropriate projection of u onto finite element spaces, we prove the optimal convergence of the fully discrete discontinuous Galerkin approximations in ${\ell}^2(L^2)$ normed space.