• Journal of applied mathematics & informatics
• /
• v.26 no.1_2
• /
• pp.317-324
• /
• 2008

This paper shows the degree of simultaneous neural network approximation for a target function in $C^r$[-1, 1] and its first derivative. We use the Jackson's theorem for differentiable functions to get a degree of approximation to a target function by algebraic polynomials and trigonometric polynomials. We also make use of the de La Vall$\grave{e}$e Poussin sum to get an approximation order by algebraic polynomials to the derivative of a target function. By showing that the divided difference with a generalized translation network can be arbitrarily closed to algebraic polynomials on [-1, 1], we obtain the degree of simultaneous approximation.

• Communications for Statistical Applications and Methods
• /
• v.2 no.2
• /
• pp.376-386
• /
• 1995

Designs for polynomial approximation to the unknown response function are considered. Optimality criteria are monotone functions of the mean squared error matrix of the least squares estimator. They correspond to the classical A-, D-, G- and Q-optimalities. Optimal first order designs are chosen from the invariant designs and then compared with optimal second order designs.

• Journal of applied mathematics & informatics
• /
• v.26 no.5_6
• /
• pp.1057-1069
• /
• 2008

We consider singularly perturbed Boundary Value Problems (BVPs) for third and fourth order Ordinary Differential Equations(ODEs) of convection-diffusion type with discontinuous source term and a small positive parameter multiplying the highest derivative. Because of the type of Boundary Conditions(BCs) imposed on these equations these problems can be transformed into weakly coupled systems. In this system, the first equation does not have the small parameter but the second contains it. In this paper a computational method named as 'An asymptotic finite element method' for solving these systems is presented. In this method we first find an zero order asymptotic approximation to the solution and then the system is decoupled by replacing the first component of the solution by this approximation in the second equation. Then the second equation is independently solved by a fitted mesh Finite Element Method (FEM). Numerical experiments support our theoritical results.

• Korean Management Science Review
• /
• v.15 no.2
• /
• pp.125-142
• /
• 1998

The aggregation on linear large-scale dynamic systems is examined in this paper and a "two-step" approach is proposed. In this procedure, the aggregated system consists of two subsystems. The first subsystem represents aggregation through the retainment of dominant eigenvalues of the original system, leading to a first approximation of the desired output of the original system. The purpose of augmenting it with a second subsystem is to provide an estimation of the error on the first approximation, thus permitting a second correction to the output approximation and resulting in an output approximation of greater accuracy. Optimization techniques are discussed for the determination of unknown parameters in the aggregated system. These techniques use minimization principles of certain suitable performance indices and are developed for both single input-single output and multiple input-multiple output system. Numerical examples illustrating these procedures are given and the results are compared with those obtained using existing methods. Finally, a pharmacokinetics problem is studied from the aggregation point of view.

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

• The Transactions of the Korean Institute of Power Electronics
• /
• v.4 no.3
• /
• pp.223-230
• /
• 1999

A conventional sliding mode control approach is often impractical or difficult when it is applied to high order process b because the number of tuning parameters in the sliding mode controller increases with the order of the plant. C Camacho(l996) proposed a design method of a fixed structure sliding mode controller based on a first order plus dead t time approximation to the higher-order process. But, his method has such problems as chattering, over‘shoot, and c command following due to the Taylor the approximation en‘ors for the time delay term of the first order model. In this p paper, a new design technique for a sliding mode controller based on the modified Taylor approximation considered a w weight is developed to improve the Camacho's problems.

• Journal of KIISE:Software and Applications
• /
• v.28 no.9
• /
• pp.681-687
• /
• 2001

In order to raise a class discrimination power by combining multiple classifiers under the Bayesian decision theory, the upper bound of a Bayes error rate bounded by the conditional entropy of a class variable and decision variables obtained from training data samples should be minimized. Wang and Wong proposed a tree dependence first-order approximation scheme of a high order probability distribution composed of the class and multiple feature pattern variables for minimizing the upper bound of the Bayes error rate. This paper presents an extended high order product approximation scheme dealing with higher order dependency more than the first-order tree dependence, based on the minimization of the upper bound of the Bayes error rate. Multiple recognizers for unconstrained handwritten numerals from CENPARMI were combined by the proposed approximation scheme using the Bayesian formalism, and the high recognition rates were obtained by them.

• The Korean Journal of Applied Statistics
• /
• v.24 no.6
• /
• pp.1161-1168
• /
• 2011

The approximation for the distribution functions of nonparametric test statistics is a significant step in statistical inference. A rank sum test for dispersions proposed by Ansari and Bradley (1960), which is widely used to distinguish the variation between two populations, has been considered as one of the most popular nonparametric statistics. In this paper, the statistical tables for the distribution of the nonparametric Ansari-Bradley statistic is produced by use of polynomially adjusted normal approximation as a semi parametric density approximation technique. Polynomial adjustment can significantly improve approximation precision from normal approximation. The normal-polynomial density approximation for Ansari-Bradley statistic under finite sample sizes is utilized to provide the statistical table for various combination of its sample sizes. In order to find the optimal degree of polynomial adjustment of the proposed technique, the sum of squared probability mass function(PMF) difference between the exact distribution and its approximant is measured. It was observed that the approximation utilizing only two more moments of Ansari-Bradley statistic (in addition to the first two moments for normal approximation provide) more accurate approximations for various combinations of parameters. For instance, four degree polynomially adjusted normal approximant is about 117 times more accurate than normal approximation with respect to the sum of the squared PMF difference.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.36 no.9
• /
• pp.660-669
• /
• 1987

Routh approximation method is the most computationally attractive. But this method may cause time-response error because this method does not match the time-response directly. In this paper a new mixed method for obtaining stable reduced-order models for high-order continuous-time systems is proposed. It makes use of the advantages of the Routh approximation method and the Minimization of Integral Squared Error(MISE) criterion approach. In this mixed method the characteristic polynomial of the reduced-order model is first obtained from that of original system by using the Auxiliary Denominator Polynomial(ADP). The numerator polynomial is then determined so as to minimize the intergral squared-error of unit step responses. The advantages of the propsed method are that the reduced models are always stable if the original system are stable and the frequency domain and time domain characteristic of the original system will be preserved in the reduced models.

• Proceedings of the Korean Society of Machine Tool Engineers Conference
• /
• 1999.10a
• /
• pp.419-424
• /
• 1999

In this paper, the comparison of the first order approximation schemes such as SLP (sequential linear programming), CONLIN(convex linearization), MMA(method of moving asymptotes) and the second order approximation scheme, SQP(sequential quadratic programming) was accomplished for optimization of and nonlinear structures. It was found that MMA and SQP(sequential quadratic programming) was accomplished for optimization of and nonlinear structures. It was found that MMA and SQP are the most efficient methods for optimization. But the number of function call of SQP is much more than that of MMA. Therefore, when it is considered with the expense of computation, MMA is more efficient than SQP. In order to examine the efficiency of MMA for complex optimization problem, it was applied to the helicopter tail boom considering column buckling and local wall buckling constraints. It is concluded that MMA can be a very efficient approximation scheme from simple problems to complex problems.