• Interaction and multiscale mechanics
• /
• 제2권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.

• 산업경영시스템학회지
• /
• 제34권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.

• 한국통신학회논문지
• /
• 제10권3호
• /
• pp.130-134
• /
• 1985

영상신호의 이차원 코사인 변환부호화에 있어서 변환계수의 분포계수화는 매우 중요하다. 그 이유는 블록양자화 시 분포함수를 잘못 가정하면 양자화잡음이 매우 커지기 때문이다. 본 논문에서는 일반화된 가우시안 분포함수를 이용하여 test를 행한 결과 AC변환계수들은 shape parameter가 0.6인 일반화된 가우시안 분포로 잘 근사화된다는 결과를 얻었다. 이차원코사인 변환부호화의 컴퓨터 시뮤레이션을 통해 Laplacian이나 Gaussian분포로의 근사화와 비교한 결과 shape parameter가 0.6인 일반화된 가우시안 분포로 근사화하는 경우 실험치와 이론치가 거의 일치하며 추력신호 잡음비도 가장 크게 나타났다.

• Journal of applied mathematics & informatics
• /
• 제32권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.

• 대한산업공학회지
• /
• 제42권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.

• 응용통계연구
• /
• 제7권2호
• /
• pp.323-333
• /
• 1994

본 논문에서는 주어진 n개의 적률을 갖는 최적의 확률 밀도 함수를 찾는 문제와 관련된 몇가지 근사 정리들을 제안하고 증명한다. 또한, 이 근사 정리들이 예를 통하여 수행될 것이다.

• 대한수학회보
• /
• 제48권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.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1999년도 추계학술대회 논문집 학회본부 B
• /
• 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년도 ICCAS
• /
• 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
• /
• 제28권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.