• Journal of Power Electronics
• /
• 제11권3호
• /
• pp.304-310
• /
• 2011

The power series approximation method is proposed for real time implementations of a discrete flux observer. The proposed method improves the performance of the discrete flux observer in the case of a low sampling rate and high speed range, where the simple discrete flux observer converted by the Euler method cannot estimate the actual flux precisely. The performance of discrete flux observers with different orders of approximation is compared to find out the proper order of approximation. The validity of the proposed method is verified through simulation and experiment.

• Honam Mathematical Journal
• /
• 제27권1호
• /
• pp.69-76
• /
• 2005

The aim of this work is to generalize $L_1$-approximation in order to apply them to a discrete approximation. In $L_1$-approximation, we use the norm given by $${\parallel}f{\parallel}_1={\int}{\mid}f{\mid}d{\mu}$$ where ${\mu}$ a non-atomic positive measure. In this paper, we go to the other extreme and consider measure ${\mu}$ which is purely atomic. In fact we shall assume that ${\mu}$ has exactly m atoms. For any ${\ell}$-tuple $b^1,\;{\cdots},\;b^{\ell}{\in}{\mathbb{R}}^m$, we defined the ${\ell}^m_1{w}$-norn, and consider $s^*{\in}S$ such that, for any $b^1,\;{\cdots},\;b^{\ell}{\in}{\mathbb{R}}^m$, $$\array{min&max\\{s{\in}S}&{1{\leq}i{\leq}{\ell}}}\;{\parallel}b^i-s{\parallel}_w$$, where S is a n-dimensional subspace of ${\mathbb{R}}^m$. The $s^*$ is called the Chebyshev center or a discrete simultaneous ${\ell}^m_1$-approximation from the finite dimensional subspace.

• Kyungpook Mathematical Journal
• /
• 제47권4호
• /
• pp.529-548
• /
• 2007

The purpose of this article is to find a relation between the finite difference method and the boundary element method, and propose a new approach deriving a discrete approximation formula as like that of the finite difference method for harmonic functions. We develop a discrete approximation formula on a uniform grid based on the boundary integral formulations. We consider three different boundary integral formulations and derive one discrete approximation formula on the uniform grid for the harmonic function. We show that the proposed discrete approximation formula has the same computational molecules with that of the finite difference formula for the Laplace operator ${\nabla}^2$.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제2권2호
• /
• pp.81-95
• /
• 1998

The superconvergence of the Sloan iterate obtained from a Galerkin method for the approximate solution of the singular integral equation based on the use of two sets of orthogonal polynomials is investigated. The discrete Sloan iterate using Gaussian quadrature to evaluate the integrals in the equation becomes the Nystr$\ddot{o}$m approximation obtained by the same rules. Consequently, it is impossible to expect the faster convergence of the Sloan iterate than the discrete Galerkin approximation in practice.

• Proceedings of the KSME Conference
• /
• 대한기계학회 2008년도 추계학술대회A
• /
• pp.1331-1336
• /
• 2008

This paper suggests a method using Bayesian inference to estimate the parameters of Weibull distribution and acceleration parameters under the condition that the stresses are time-dependent functions. A Bayesian model based on the discrete time approximation is formulated to infer the parameters of interest from the failure data of the virtual tests and a statistical analysis is considered to decide the most probable mean values of the parameters for reasoning of the failure data.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• 제33권10호
• /
• pp.1144-1150
• /
• 2009

This paper investigates the feasibility of the Bayesian discrete time approximation method to estimate the parameters of Weibull distributions of failures for two non-identical components connected in series system. A Bayesian model based on the discrete time approximation method is formulated to infer the Weibull parameters of two non-identical components with the failure data of the virtual tests. The study of this paper comes to a conclusion that the method is feasible only for some special cases under the given constraints on the concerned parameters.

• Structural Engineering and Mechanics
• /
• 제3권4호
• /
• pp.359-372
• /
• 1995

This study presents an efficient method for optimum design of plate and shell structures, when the design variables are continuous or discrete. Both sizing and shape design variables are considered. First the structural responses such as element forces are approximated in terms of some intermediate variables. By substituting these approximate relations into the original design problem, an explicit nonlinear approximate design task with high quality approximation is achieved. This problem with continuous variables, can be solved by means of numerical optimization techniques very efficiently, the results of which are then used for discrete variable optimization. Now, the approximate problem is converted into a sequence of second level approximation problems of separable form and each of which is solved by a dual strategy with discrete design variables. The approach is efficient in terms of the number of required structural analyses, as well as the overall computational cost of optimization. Examples are offered and compared with other methods to demonstrate the features of the proposed method.

• 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.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• 제32A권4호
• /
• pp.15-23
• /
• 1995

In this paper, we evaluate the performance of a transient queueing approximation when it is applied to modeling computer communication networks. An operational computer network that uses the ISO IS-IS(Intermediate System-Intermediate System) routing protocol is modeled as a Jackson network. The primary goal of the approximation pursued in the study was to provide transient queue statistics comparable in accuracy to the results from conventional Monte Carlo simulations. A closure approximation of the M/M/1 queueing system was extended to the general Jackson network in order to obtain transient queue statistics. The performance of the approximation was compared to a discrete event simulation under nonstationary conditions. The transient results from the two simulations are compared on the basis of queue size and computer execution time. Under nonstationary conditions, the approximations for the mean and variance of the number of packets in the queue erer fairly close to the simulation values. The approximation offered substantial speed improvements over the discrete event simulation. The closure approximation provided a good alternative Monte Carlo simulation of the computer networks.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• 제34S권9호
• /
• pp.50-59
• /
• 1997

This paper is on the generalized singular perturbation approximation (GSPA) preserving the discrete positive real property. We transform the discrete positive real(PR) system into a stochastically banlanced system and get the reduced order discrete system from the GSPA of the full order stochastically balanced system. eSPECIALLY, WHEN THE FREE PARAMETER OF THE gspa IS .+-.1, we show that the reduced order discrete system retains stability, minimality, and positive real and stochstically balancing properties. And we derived the .inf.-norm error bound with the reduced order discrete strictly positive real(SPR) system by the proposed method. Finally, we give an example to ascertain the properties of the proposed reduced order discrete system and to compare with the conventional methods.