• Proceedings of the KSME Conference
• /
• 2003.11a
• /
• pp.1882-1887
• /
• 2003

The response surface method (RSM) became one of famous meta modeling techniques, however its approximation errors give designers several restrictions. Classical RSM uses the least squares method (LSM) to find the best fitting approximation models from the all given data. This paper discusses how to construct RSM efficiently and accurately using moving least squares method (MLSM) with sensitivity information. In this method, several parameters should be determined during the construction of RSM. Parametric study and optimization for these parameters are performed. Several difficulties during approximation processes are described and numerical examples are demonstrated to verify the efficiency of this method.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2004.04a
• /
• pp.275-283
• /
• 2004

The paper describes the integrated design system using MDO and approximation technique. In MDO related research, final target is an integrated and automated MDO framework systems. However, in order to construct the integrated design system, the prerequisite condition is how much save computational cost because of iterative process in optimization design and lots of data information in CAD/CAE integration. Therefore, this paper presents that an efficient approximation method, Adaptive Approximation, is a competent strategy via MDO framework systems.

• Communications of the Korean Mathematical Society
• /
• v.20 no.4
• /
• pp.861-873
• /
• 2005

In this paper we approximate a cylindrical helix by bi-conic and bi-quadratic Bezier curves. Each approximation method is $G^1$ end-points interpolation of the helix. We present a sharp upper bound of the Hausdorff distance between the helix and each approximation curve. We also show that the error bound has the approximation order three and monotone increases as the length of the helix increases. As an illustration we give some numerical examples.

• Bulletin of the Korean Mathematical Society
• /
• v.38 no.2
• /
• pp.293-302
• /
• 2001

We improve the greedy algorithm which is one of the general convergence criterion for certain iterative sequence in a given space by building a constructive greedy algorithm on a normed linear space using an arithmetic average of elements. We also show the degree of approximation order is still $Ο(1\sqrt{\n}$) by a bounded linear functional defined on a bounded subset of a normed linear space which offers a good approximation method for neural networks.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1994.10a
• /
• pp.188-192
• /
• 1994

This paper presenta new method for tool interference acoidance using rectanguar approximation in NC machining of scuptured surface. The procedure of algorithm for approximation of sculptured surface to rectangular surface is described. Using this algorithm, we can check concave, convex, and side interference region and avoid these interferenes.

• Proceedings of the KIEE Conference
• /
• 1988.07a
• /
• pp.679-682
• /
• 1988

From the viewpoint of general recognition system, B-spline is introduced for the approximation and recognition of human profile contours. Profile contour is approximated to the cublic B-spline curve by least square fitting so that B-Spline nodes nearly correspond with the curvature extrema of the contour. This method is designed for the spline to be good features in recognition, and also showed good approximation compared with the variants of B-spline appraximation.

• Journal of Mechanical Science and Technology
• /
• v.16 no.7
• /
• pp.896-901
• /
• 2002

This paper presents a nonlinear modeling method for dynamic analysis of flexible structures undergoing overall motions that employs the mode approximation method. This method, different from the naive nonlinear method that approximates only Cartesian deformation variables, approximates not only deformation variables but also strain variables. Geometric constraint relations between the strain variables and the deformation variables are introduced and incorporated into the formulation. Two numerical examples are solved and the reliability and the accuracy of the proposed formulation are examined through the numerical study.

• ETRI Journal
• /
• v.25 no.6
• /
• pp.535-537
• /
• 2003

We propose a rigorous 2D approximation technique for the 3D waveguide structures; it can minimize the well-known approximation errors of the commonly used effective index method. The main concept of the proposed technique is to compensate for the effective cladding index in the equivalent slab model of the original channel waveguide from the modal effective index calculated by the nonuniform 2D finite difference method. With simulations, we used the proposed technique to calculate the coupling characteristics of a directional coupler by the 2D beam propagation method, and the results were almost exactly the same as the results calculated by the 3D beam propagation method.

• Journal of applied mathematics & informatics
• /
• v.35 no.5_6
• /
• pp.623-649
• /
• 2017

Retrial queues have been widely used to model the many practical situations arising from telephone systems, telecommunication networks and call centers. An approximation method for a simple Markovian retrial queue by reducing the two dimensional problem to one dimensional problem was presented by Fredericks and Reisner in 1979. The method seems to be a promising approach to approximate the retrial queues with complex structure, but the method has not been attracted a lot of attention for about thirty years. In this paper, we exposit the method in detail and show the usefulness of the method by presenting the recent results for approximating the retrial queues with complex structure such as multi-server retrial queues with phase type distribution of retrial time, impatient customers with general persistent function and/or multiclass customers, etc.

• 전기의세계
• /
• v.22 no.1
• /
• pp.28-34
• /
• 1973

This paper treats with the sub-optimal control problem of noninear systems by approximation method. This method involves the approximation by linearization which provides the sub-optimal solution of non-linear control problems. The result of this work shows that, in the problem in which the controlled plant is characterized by an ordinary differential equation of first order, the solution obtained by this method coincides with the exact solution of problem. In of case of the second or higher order systems, it is proved analytically that this method of linearization produces the sub-optimal solution of the given problem. It is also shown that the sub-optimality of solution by the method can be evaluated by introducing the upper and lower bounded performance indices. Discussion is made on the procedure with some illustrative examples whose performance indices are given in the quadratic forms.