• Journal of Institute of Control, Robotics and Systems
• /
• v.15 no.11
• /
• pp.1137-1143
• /
• 2009

This paper presents the FPGA implementation of efficient algorithms for approximating exponential function based on floating point format data. The Taylor-Maclaurin expansion as a conventional approximation method becomes inefficient since high order expansion is required for the large number to satisfy the approximation error. A format converter is designed to convert fixed data format to floating data format, and then the real number is separated into two fields, an integer field and an exponent field to separately perform mathematic operations. A new assembly command is designed and added to previously developed command set to refer the math table. To test the proposed algorithm, assembly program has been developed. The program is downloaded into the Altera DSP KIT W/STRATIX II EP2S180N Board. Performances of the proposed method are compared with those of the Taylor-Maclaurin expansion.

• Proceedings of the KSME Conference
• /
• 2001.06c
• /
• pp.386-391
• /
• 2001

This paper presents a new two-point approximation method based on the exponential intervening variable. To avoid the lack of definition of the conventional exponential intervening variables due to zero- or negative-valued design variables the shifting level into each exponential intervening variable is introduced. Then a new quadratic approximation, whose Hessian matrix has only diagonal elements of different values, is proposed in terms of these intervening variables. These diagonal elements are computed in a closed form, which correct the typical error in the approximate gradient of the TANA series due to the lack of definition of exponential type intervening variables and their incomplete second-order terms. Also, a correction coefficient is multiplied to the pre-determined quadratic term to match the value of approximate function with that of the original function at the previous point. Finally, the authors developed a sequential approximate optimizer, solved several typical design problems used in the literature and compared these optimization results with those of TANA-3. These comparisons show that the proposed method gives more efficient and reliable results than TANA-3.

• Journal of Mechanical Science and Technology
• /
• v.15 no.9
• /
• pp.1257-1267
• /
• 2001

For efficient mechanical system optimization, a new two-point approximation method is presented. Unlike the conventional two-point approximation methods such as TPEA, TANA, TANA-1, TANA-2 and TANA-3, this introduces the shifting level into each exponential intervening variable to avoid the lack of definition of the conventional exponential intervening variables due to zero-or negative-valued design variables. Then a new quadratic approximation whose Hessian matrix has only diagonal elements of different values is proposed in terms of these shifted exponential intervening variables. These diagonal elements are determined in a closed form that corrects the typical error in the approximate gradient of the TANA series due to the lack of definition of exponential type intervening variables and their incomplete second-order terms. Also, a correction coefficient is multiplied to the pre-determined quadratic term to match the value of approximate function with that of the previous point. Finally, in order to show the numerical performance of the proposed method, a sequential approximate optimizer is developed and applied to solve six typical design problems. These optimization results are compared with those of TANA-3. These comparisons show that the proposed method gives more efficient and reliable results than TANA-3.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.9 no.3
• /
• pp.21-30
• /
• 2013

Powell-Miller theory is a good method to express or treat incorrect information. But it has limitation that requires too much time to apply to actual situation because computational complexity increases in exponential and functional way. Accordingly, there have been several attempts to reduce computational complexity but side effect followed - certainty factor fell. This study suggested expanded Approximation Algorithm. Expanded Approximation Algorithm is a method to consider both smallest supersets and largest subsets to expand basic space into a space including inverse set and to reduce Approximation error. By using expanded Approximation Algorithm suggested in the study, basic probability assignment function value of subsets was alloted and added to basic probability assignment function value of sets related to the subsets. This made subsets newly created become Approximation more efficiently. As a result, it could be known that certain function value which is based on basic probability assignment function is closely near actual optimal result. And certainty in correctness can be obtained while computational complexity could be reduced. by using Algorithm suggested in the study, exact information necessary for a system can be obtained.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.25 no.9
• /
• pp.1423-1431
• /
• 2001

Based on the exponential intervening variable, a new two-point approximation method is presented. This introduces the shifting level into each exponential intervening variable to avoid the lack of def inition of the conventional exponential intervening variables due to zero-or negative-valued design variables. Then a new quadratic approximation whose Hessian matrix has only diagonal elements of different values is proposed in terms of these intervening variables. These diagonal elements are determined in a closed form that corrects the typical error in the approximate gradient of the TANA series due to the lack of definition of exponential type intervening variables and their incomplete second-order terms. Also, a correction coefficient is multiplied to the pre-determined quadratic term to match the value of approximate function with that of the previous point. Finally, in order to show the numerical performance of the proposed method, a sequential approximate optimizer is developed and applied to solve six typical design problems. These optimization results are compared with those of TANA-3. These comparisons show that the proposed method gives more efficient and reliable results than TANA-3.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.31 no.4
• /
• pp.490-495
• /
• 2007

This research aims to examine accuracy and efficiency of the first four moments corresponding to mean, standard deviation, skewness, and kurtosis, which are estimated by a function approximation moment method (FAMM). In FAMM, the moments are estimated from an approximating quadratic function of a system response function. The function approximation is performed on a specially selected experimental region for accuracy, and the number of function evaluations is taken equal to that of the unknown coefficients for efficiency. For this purpose, three error-minimizing conditions are utilized and corresponding canonical experimental regions constructed accordingly. An interpolation function is then obtained using a D-optimal design and then the first four moments of it are obtained as the estimates for the system response function. In order to verify accuracy and efficiency of FAMM, several non-linear examples are considered including a polynomial of order 4, an exponential function, and a rational function. The moments calculated from various coefficients of variation show very good accuracy and efficiency in comparison with those from analytic integration or the Monte Carlo simulation and the experimental design technique proposed by Taguchi and updated by D'Errico and Zaino.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.12
• /
• pp.4567-4583
• /
• 2021

This study proposes an analytical approximation algorithm based on extreme value theory (EVT) for the inverse of the power of the incomplete Gamma function. First, the Gumbel function is used to approximate the power of the incomplete Gamma function, and the corresponding inverse problem is transformed into the inversion of an exponential function. Then, using the tail equivalence theorem, the normalized coefficient of the general Weibull distribution function is employed to replace the normalized coefficient of the random variable following a Gamma distribution, and the approximate closed form solution is obtained. The effects of equation parameters on the algorithm performance are evaluated through simulation analysis under various conditions, and the performance of this algorithm is compared to those of the Newton iterative algorithm and other existing approximate analytical algorithms. The proposed algorithm exhibits good approximation performance under appropriate parameter settings. Finally, the performance of this method is evaluated by calculating the thresholds of space-time block coding and space-frequency block coding pattern recognition in multiple-input and multiple-output orthogonal frequency division multiplexing. The analytical approximation method can be applied to other related situations involving the maximum statistics of independent and identically distributed random variables following Gamma distributions.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2002.10a
• /
• pp.583-590
• /
• 2002

Point collocation method based on the fast derivatives approximation of meshfree shape function is applied to solid mechanics in this study. Enhanced meshfree approximation with approximated derivative of shape function is reviewed, and formulation of linear elastic solid mechanics by point collocation method is presented. It implies that governing equation of solid mechanics with strong form is directly formulated without no numerical integration cells or grid. The regularity of weight function is not required due to a use of approximated derivative, so we propose the exponential type weight function that is discontinuous in first derivative. The convergence and stability of the proposed method is verified by passing the generalized patch test. Also, the efficiency and applicability of the proposed method in solid mechanics is verified by solving types of solid problems. Numerical results show that not only a use of proposed weight function leads lower error and higher convergence rate than that of the conventional weight functions, but also the improved collocation method with derivative approximation enables to compute the derivatives of shape function very fast and accurately enough to replace the classical direct derivative calculation.

• The Korean Journal of Applied Statistics
• /
• v.20 no.2
• /
• pp.333-343
• /
• 2007

The auxiliary renewal function has an important role in analyzng queues in which the either of the inter-arrival time and the service time of customers is not exponential. As like the renewal function, the auxiliary renewal function is hard to compute although it can be defined theoretically. In this paper, we suggest two approximations for auxiliary renewal function and compare the two with the true value of auxiliary renewal function which can be computed in some special cases.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.27 no.6
• /
• pp.1041-1049
• /
• 2003

In this paper, a new local two-point approximation method which is based on the exponential intervening variable is proposed. This new algorithm, called the Two-Point Convex Approximation(TPCA), use the function and design sensitivity information from the current and previous design points of the sequential approximate optimization to generate a sequence of convex, separable subproblems. This paper describes the derivation of the parameters associated with the approximation and the numerical solution procedure. In order to show the numerical performance of the proposed method, a sequential approximate optimizer is developed and applied to solve several typical design problems. These optimization results are compared with those of other optimizers. Numerical results obtained from the test examples demonstrate the effectiveness of the proposed method.