• ETRI Journal
• /
• 제37권4호
• /
• pp.727-735
• /
• 2015

This paper deals with the problem of blind source separation (BSS), where observed signals are a mixture of delayed sources. In reference to a previous work, when the delay time is small such that the first-order Taylor approximation holds, delayed observations are transformed into an instantaneous mixture of original sources and their derivatives, for which an extended second-order blind identification (SOBI) approach is used to recover sources. Inspired by the results of this previous work, we propose to generalize its first-order Taylor approximation to suit higher-order approximations in the case of a large delay time based on a similar version of its extended SOBI. Compared to SOBI and its extended version for a first-order Taylor approximation, our method is more efficient in terms of separation quality when the delay time is large. Simulation results verify the performance of our approach under different time delays and signal-to-noise ratio conditions, respectively.

• 대한기계학회논문집A
• /
• 제26권12호
• /
• pp.2483-2491
• /
• 2002

This study presents an efficient method for robust optimal design. In order to avoid the excessive evaluations of the exact performance functions, two-point diagonal quadratic approximation method is employed for approximating them during optimization process. This approximation method is one of the two point approximation methods. Therefore, the second order sensitivity information of the approximated performance functions are calculated by an analytical method. As a result, this enables one to avoid the expensive evaluations of the exact $2^{nd}$ derivatives of the performance functions unlike the conventional robust optimal design methods based on the gradient information. Finally, in order to show the numerical performance of the proposed method, one mathematical problem and two mechanical design problems are solved and their results are compared with those of the conventional methods.

• 한국원자력학회:학술대회논문집
• /
• 한국원자력학회 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.

• 대한전자공학회논문지
• /
• 제23권5호
• /
• pp.647-652
• /
• 1986

The controller tuning methods proposed by Yuwana-Seborg and Suh utilizes Pade first order approximation for the delay terms in the closed loop transfer function. In this paper, the use of a Pade second-order approximation method is investigated. The simulation results show that the new method is superior to pervious approaches such as Ziegler-Nichols and Cohen-Coon methods.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제28권1호
• /
• pp.22-32
• /
• 2024

In this paper we present a method of conic section approximation by hexic Bézier curves. The hexic Bézier approximants are G³ Hermite interpolations of conic sections. We show that there exists at least one hexic Bézier approximant for each weight of the conic section The hexic Bézier approximant depends one parameter and it can be obtained by solving a quartic polynomial, which is solvable algebraically. We present the explicit upper bound of the Hausdorff distance between the conic section and the hexic Bézier approximant. We also prove that our approximation method has the maximal order of approximation. The numerical examples for conic section approximation by hexic Bézier curves are given and illustrate our assertions.

• 대한수학회보
• /
• 제46권4호
• /
• pp.701-712
• /
• 2009

In this paper, we study the simultaneous approximation to functions in $C^m$[0, 1] by neural networks with a squashing function and the complexity related to the simultaneous approximation using a Bernstein polynomial and the modulus of continuity. Our proofs are constructive.

• 한국전산구조공학회논문집
• /
• 제31권6호
• /
• pp.331-337
• /
• 2018

본 논문은 MLS(moving least squares) 차분법의 1차 미분 근사함수를 바탕으로 시간에 따른 수치해석이 가능한 해석기법을 제시한다. 오직 1차 미분 근사함수로만 지배방정식을 이산화했으며, 근사함수를 조립하는 형태로 전체 시스템 방정식을 구성하여 차분법으로 이산화된 운동방정식이 유한요소법(finite element method)과 유사한 모습을 갖게 되었다. 운동방정식을 시간적분하기 위해서 중앙차분법(central difference method)을 사용하였다. 유한요소 알고리즘을 통해서 MLS 차분법과 유한요소법의 고유진동 해석을 수행하였으며, 두 해석결과를 비교하였다. 또한, 동적해석 결과를 기존의 2차 미분 근사함수를 활용한 해석결과와 함께 도시함으로써 제안된 수치기법의 정확성을 검증하였다. 1차 미분 근사함수를 조립하는 과정에서 해석결과의 떨림현상이 억제되었으며 상대적으로 균일한 응력분포를 구할 수 있었다.

• Kyungpook Mathematical Journal
• /
• 제57권3호
• /
• pp.493-502
• /
• 2017

We propose an accurate approximation method via discrete Krawtchouk orthogonal polynomials to the distribution of a sum of independent but non-identically distributed binomial random variables. This approximation is a weighted binomial distribution with no need for continuity correction unlike commonly used density approximation methods such as saddlepoint, Gram-Charlier A type(GC), and Gaussian approximation methods. The accuracy obtained from the proposed approximation is compared with saddlepoint approximations applied by Eisinga et al. [4], which are the most accurate method among higher order asymptotic approximation methods. The numerical results show that the proposed approximation in general provide more accurate estimates over the entire range for the target probability mass function including the right-tail probabilities. In addition, the method is mathematically tractable and computationally easy to program.

• Industrial Engineering and Management Systems
• /
• 제7권2호
• /
• pp.143-149
• /
• 2008

There have been some approximation analysis methods for a GI/G/1 queueing system. As one of them, an approximation technique for the steady-state probability in the GI/G/1 queueing system based on the iteration numerical calculation has been proposed. As another one, an approximation formula of the average queue length in the GI/G/1 queueing system by using the diffusion approximation or the heuristics extended diffusion approximation has been developed. In this article, an approximation technique in order to analyze the GI/G/1 queueing system is considered and then the formulae of both the steady-state probability and the average queue length in the GI/G/1 queueing system are proposed. Through some numerical examples by the proposed technique, the existing approximation methods, and the Monte Carlo simulation, the effectiveness of the proposed approximation technique is verified.

• 제어로봇시스템학회논문지
• /
• 제4권2호
• /
• pp.170-177
• /
• 1998

In this paper, a unified solution of Hankel norm approximation problem is proposed by $\delta$-operator. To derive the main result, all-pass property is derived from the inner and co-inner property in the $\delta$-domain. The solution of all-pass becomes an optimal Hankel norm approximation problem in .delta.-domain through LLFT(Low Linear Fractional Transformation) inserting feedback term $\phi(\gamma)$, which is a free design parameter, to hold the error bound desired against the variance between the original model and the solution of Hankel norm approximation problem. The proposed solution does not only cover continuous and discrete ones depending on sampling interval but also plays a key role in robust control and model reduction problem. The verification of the proposed solution is exemplified via simulation for the zero-order Hankel norm approximation problem and the model reduction problem applied to a 16th order MIMO system.