• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1988년도 한국자동제어학술회의논문집(국제학술편); 한국전력공사연수원, 서울; 21-22 Oct. 1988
• /
• pp.934-938
• /
• 1988

In this paper we present a method of determining the unknown degree of any 2D discrete linear shift-invariant system which is characterized only by the coefficients of the double power series of a transfer function, i.e. a 2D impulse response array. Our method is based on a 2D extension of Berlekamp-Massey algorithm for synthesis of linear feedback shift registers, and it gives a novel approach to identification and approximation of 2D linear systems, which can be distinguished in its simplicity and potential of applicability from the other 2D Levinson-type algorithms. Furthermore, we can solve problems of 2D Pade approximation and 2D system reduction on a reasonable assumption in the context of 2D linear systems theory.

• 한국공작기계학회:학술대회논문집
• /
• 한국공작기계학회 1999년도 춘계학술대회 논문집
• /
• pp.141-146
• /
• 1999

A new method, so called MMA(Method of Moving Asymptotes) was applied to the optimization problems of non-linear functions and non-linear structures. In each step of the iterative process, tile MMA generates a strictly convex approximation subproblems and solves them by using the dual problems. The generation of these subproblems is controlled by so called 'moving asymptotes', which may both make no oscillation and speed up tile convergence rate of optimization process. By contrast in generalized dual function, the generated function by MMA is always explicit type. Both the objective and behaviour constraints which were approximated are optimized by dual function. As the results of some examples, it was found that this method is very effective to obtain the global solution for problems with many local solutions. Also it was found that MMA is a very effective approximate method using the original function and its 1st derivatives.

• 한국해안·해양공학회논문집
• /
• 제20권6호
• /
• pp.553-563
• /
• 2008

만일 임의의 지형을 다수의 계단으로 근사하면 이 지형 위를 지나는 선형 파랑의 변형을 계산하기 위해 변분근사법과 고유함수 전개법을 사용할 수 있다. 본 논문에서는 반사율과 투과율을 계산하기 위해 변분근사식과 연계된 산란체법을 제시하였다. 본 기법은 O'Hare and Davies의 변환행렬 축차법보다 간단하고 직접적인 방법임을 보였다. 또한 수 개의 수치실험을 실시하여 기존 결과와 거의 같은 결과를 얻었다.

• Interaction and multiscale mechanics
• /
• 제3권2호
• /
• pp.123-143
• /
• 2010

The essential idea of the element-free Galerkin method (EFG) is that moving least-squares (MLS) approximation are used for the trial and test functions with the variational principle (weak form). By using the weighted orthogonal basis function to construct the MLS interpolants, we derive the formulae for an improved element-free Galerkin (IEFG) method for solving three-dimensional problems in linear elasticity. There are fewer coefficients in improved moving least-squares (IMLS) approximation than in MLS approximation. Also fewer nodes are selected in the entire domain with the IEFG method than is the case with the conventional EFG method. In this paper, we selected a few example problems to demonstrate the applicability of the method.

• Journal of applied mathematics & informatics
• /
• 제14권1_2호
• /
• pp.319-328
• /
• 2004

In this paper we investigate the qualitative behaviour of numerical approximation to a class delay differential equation. We consider the numerical solution of the delay differential equations undergoing a Hopf bifurcation. We prove the numerical approximation of delay differential equation had a Hopf bifurcation point if the true solution does.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2008년도 하계종합학술대회
• /
• pp.297-298
• /
• 2008

A new equalization method for perpendicular magnetic recording channels is proposed. The proposed equalizer incorporates the Gaussian sum approximation into a Kalman filtering framework to mitigate inter-symbol interference in perpendicular magnetic recording systems. The proposed equalizer consists of a bank of linear equalizers using the Kalman filtering algorithm and its output is obtained by combining the outputs of linear equalizers through the Gaussian sum approximation.

• Journal of applied mathematics & informatics
• /
• 제27권5_6호
• /
• pp.1221-1234
• /
• 2009

In this paper, we construct fully discrete discontinuous Galerkin approximations to the solution of linear Sobolev equations. We apply a symmetric interior penalty method which has an interior penalty term to compensate the continuity on the edges of interelements. The optimal convergence of the fully discrete discontinuous Galerkin approximations in ${\ell}^{\infty}(L^2)$ norm is proved.

• 한국콘텐츠학회논문지
• /
• 제21권3호
• /
• pp.616-625
• /
• 2021

심층신경망은 임의의 함수를 근사화하는 방법으로 선형모델로 근사화한 후에 비선형 활성함수를 이용하여 추가적 근사화를 반복하는 근사화 방법이다. 이 과정에서 근사화의 성능 평가 방법은 손실함수를 이용한다. 기존 심층학습방법에서는 선형근사화 과정에서 손실함수를 고려한 근사화를 실행하고 있지만 활성함수를 사용하는 비선형 근사화 단계에서는 손실함수의 감소와 관계가 없는 비선형변환을 사용하고 있다. 본 연구에서는 기존의 활성함수에 활성함수의 크기를 변화시킬 수 있는 크기 파라메터와 활성함수의 위치를 변화시킬 수 있는 위치 파라미터를 도입한 파라메트릭 활성함수를 제안한다. 파라메트릭 활성함수를 도입함으로써 활성함수를 이용한 비선형 근사화의 성능을 개선시킬 수 있다. 각 은닉층에서 크기와 위치 파라미터들은 역전파 과정에서 파라미터들에 대한 손실함수의 1차 미분계수를 이용한 학습과정을 통해 손실함수 값을 최소화시키는 파라미터를 결정함으로써 심층신경망의 성능을 향상시킬 수 있다. MNIST 분류 문제와 XOR 문제를 통하여 파라메트릭 활성함수가 기존의 활성함수에 비해 우월한 성능을 가짐을 확인하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권3호
• /
• pp.1243-1263
• /
• 2018

The two-stage linear discrimination analysis (TSLDA) is a feature extraction technique to solve the small size sample problem in the field of image recognition. The TSLDA has retained all subspace information of the between-class scatter and within-class scatter. However, the feature information in the four subspaces may not be entirely beneficial for classification, and the regularization procedure for eliminating singular metrics in TSLDA has higher time complexity. In order to address these drawbacks, this paper proposes an improved two-stage linear discriminant analysis (Improved TSLDA). The Improved TSLDA proposes a selection and compression method to extract superior feature information from the four subspaces to constitute optimal projection space, where it defines a single Fisher criterion to measure the importance of single feature vector. Meanwhile, Improved TSLDA also applies an approximation matrix method to eliminate the singular matrices and reduce its time complexity. This paper presents comparative experiments on five face databases and one handwritten digit database to validate the effectiveness of the Improved TSLDA.

• 한국원자력학회:학술대회논문집
• /
• 한국원자력학회 1997년도 추계학술발표회논문집(1)
• /
• pp.85-90
• /
• 1997

Previous our numerical results in computing point kinetics equations show a possibility in developing approximations to estimate sensitivity responses of nuclear reactor We recalculate sensitivity responses by maintaining the corrections with first order of sensitivity parameter. We present a method for computing sensitivity responses of nuclear reactor based on an approximation derived from point kinetics equations. Exploiting this approximation, we found that the first order approximation works to estimate variations in the time to reach peak power because of their linear dependence on a sensitivity parameter, and that there are errors in estimating the peak power in the first order approximation for larger sensitivity parameters. To confirm legitimacy of our approximation, these approximate results are compared with exact results obtained from our previous numerical study.