• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.28 no.4
• /
• pp.475-480
• /
• 2004

Function approximation is one of the most important and active research fields in design optimization. Accurate function approximations can reduce the repetitive computational effort fur system analysis. So this study presents an enhanced two-point diagonal quadratic approximation method. The proposed method is based on the Two-point Diagonal Quadratic Approximation method. But unlike TDQA, the suggested method has two quadratic terms, the diagonal term and the correction term. Therefore this method overcomes the disadvantage of TDQA when the derivatives of two design points are same signed values. And in the proposed method, both the approximate function and derivative values at two design points are equal to the exact counterparts whether the signs of derivatives at two design points are the same or not. Several numerical examples are presented to show the merits of the proposed method compared to the other forms used in the literature.

• Korean Journal of Computational Design and Engineering
• /
• v.12 no.1
• /
• pp.27-38
• /
• 2007

This paper describes a multiresidual approximation method for scattered volumetric data modeling. The approximation method employs a volumetric NURBS or VNURBS as a data interpolating function and proposes two multiresidual methods as a data modeling algorithm. One is called as the residual series method that constructs a sequence of VNURBS functions and their algebraic summation produces the desired approximation. The other is the residual merging method that merges all the VNURBS functions mentioned above into one equivalent function. The first one is designed to construct wavelet-type multiresolution models and also to achieve more accurate approximation. And the second is focused on its improvement of computational performance with the save fitting accuracy for more practical applications. The performance results of numerical examples demonstrate the usefulness of VNURBS approximation and the effectiveness of multiresidual methods. In addition, several graphical examples suggest that the VNURBS approximation is applicable to various applications such as surface modeling and fitting problems.

• Kyungpook Mathematical Journal
• /
• v.57 no.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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.1
• /
• pp.81-98
• /
• 2013

Since Probabilistic Latent Semantic Analysis (PLSA) and Latent Dirichlet Allocation (LDA) were introduced, many revised or extended topic models have appeared. Due to the intractable likelihood of these models, training any topic model requires to use some approximation algorithm such as variational approximation, Laplace approximation, or Markov chain Monte Carlo (MCMC). Although these approximation algorithms perform well, training a topic model is still computationally expensive given the large amount of data it requires. In this paper, we propose a new method, called non-simultaneous sampling deactivation, for efficient approximation of parameters in a topic model. While each random variable is normally sampled or obtained by a single predefined burn-in period in the traditional approximation algorithms, our new method is based on the observation that the random variable nodes in one topic model have all different periods of convergence. During the iterative approximation process, the proposed method allows each random variable node to be terminated or deactivated when it is converged. Therefore, compared to the traditional approximation ways in which usually every node is deactivated concurrently, the proposed method achieves the inference efficiency in terms of time and memory. We do not propose a new approximation algorithm, but a new process applicable to the existing approximation algorithms. Through experiments, we show the time and memory efficiency of the method, and discuss about the tradeoff between the efficiency of the approximation process and the parameter consistency.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.13 no.3
• /
• pp.217-224
• /
• 2009

In this paper we present an approximation method of quadric surface using quartic spline. Our method is based on the approximation of quadratic rational B$\acute{e}$zier patch using quartic B$\acute{e}$zier patch. We show that our approximation method yields $G^1$ (tangent plane) continuous quartic spline surface. We illustrate our results by the approximation of helicoid-like surface.

• Journal of Integrative Natural Science
• /
• v.9 no.1
• /
• pp.10-15
• /
• 2016

In this paper the approximation methods of offset curve of conic with explicit error bound are considered. The quadratic approximation of conic(QAC) method, the method based on quadratic circle approximation(BQC) and the Pythagorean hodograph cubic(PHC) approximation have the explicit error bound for approximation of offset curve of conic. We present the explicit upper bound of the Hausdorff distance between the offset curve of conic and its PHC approximation. Also we show that the PHC approximation of any symmetric conic is closer to the line passing through both endpoints of the conic than the QAC.

• Management Science and Financial Engineering
• /
• v.21 no.2
• /
• pp.25-30
• /
• 2015

This short article compares different solution methods for a basic RBC model (Hansen, 1985). We solve and simulate the model using two main algorithms: the methods of perturbation and projection, respectively. One novelty is that we offer a type of the hybrid method: we compute easily a second-order approximation to decision rules and use that approximation as an initial guess for finding Chebyshev polynomials. We also find that the second-order perturbation method is most competitive in terms of accuracy for standard RBC model.

• Journal of Power Electronics
• /
• v.11 no.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.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.23 no.3
• /
• pp.153-168
• /
• 1998

In this study we consider a CONWIP system in which the processing times at each station follow an exponential distribution and the demands for the finished Products arrive according to a compound Poisson process. The demands that are not satisfied instantaneously are assumed to be backordered. For this system we develop an approximation method to obtain the performance measures such as steady state probabilities of the number of parts at each station, the proportion of backordered demands, the average number of backordered demands and the mean waiting time of a backordered demand. For the analysis of the proposed CONWIP system, we model the CONWIP system as a closed queueing network with a synchronization station and analyze the closed queueing network using a product form approximation method. A matrix geometric method is used to solve the subnetwork in the application of the product-form approximation method. To test the accuracy of the approximation method, the results obtained from the approximation method were compared with those obtained by simulation. Comparisons with simulation have shown that the approximate method provides fairly good results.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.17 no.3
• /
• pp.171-179
• /
• 2013

In this paper we present a method of circular arc approximation by quartic B$\acute{e}$zier curve. Our quartic approximation method has a smaller error than previous quartic approximation methods due to the alternation of the error function of our quartic approximation. Our method yields a closed form of error so that subdivision algorithm is available, and curvature-continuous quartic spline under the subdivision of circular arc with equal-length until error is less than tolerance. We illustrate our method by some numerical examples.