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

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

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.21 no.8
• /
• pp.1218-1228
• /
• 1997

The move limit strategy is used to avoid the excessive approximation in the structural optimization. The size of move limit has been obtained by engineering experience. Recently, efforts based on analytic methods are performed by some researchers. These methods still have problems, such as prematurity or oscillation of the move limit size. The existing methods usually control the bound of design variables based on the magnitude. Thus, they can not properly handle the configuration variables based on the geometry in the configuration optimization. In this research, the size of move limit is calculated based on the accuracy of approximation. The method is coded and applied to the two-point reciprocal quadratic approximation method. The efficiency is evaluated through examples.

• Korean Journal of Computational Design and Engineering
• /
• v.11 no.1
• /
• pp.1-10
• /
• 2006

This paper addresses B-spline curve approximation of a set of ordered points to a specified toterance. The important issue in this problem is to reduce the number of control points while keeping the desired accuracy in the resulting B-spline curve. In this paper we propose a new method for error-bounded B-spline curve approximation based on adaptive selection of dominant points. The method first selects from the given points initial dominant points that govern the overall shape of the point set. It then computes a knot vector using the dominant points and performs B-spline curve fitting to all the given points. If the fitted B-spline curve cannot approximate the points within the tolerance, the method selects more points as dominant points and repeats the curve fitting process. The knots are determined in each step by averaging the parameters of the dominant points. The resulting curve is a piecewise B-spline curve of order (degree+1) p with $C^{(p-2)}$ continuity at each knot. The shape index of a point set is introduced to facilitate the dominant point selection during the iterative curve fitting process. Compared with previous methods for error-bounded B-spline curve approximation, the proposed method requires much less control points to approximate the given point set with the desired shape fidelity. Some experimental results demonstrate its usefulness and quality.

• 한국전산유체공학회:학술대회논문집
• /
• 2005.10a
• /
• pp.99-104
• /
• 2005

For the efficient reliability analysis, Bi-direction two-point approximation(BTPA) method is developed which solves shortcomings of conventional two-point approximation(TPA) methods that generate an approximate surface with low accuracy or sometimes do an unstable approximate surface. The conventional reliability based design optimization(RBDO) methods require high computational cost compared with the deterministic design optimization(DO) methods. To overcome the computational inefficiency of RBDO, the approximate reliability analysis approaches on the TPA surface are proposed. Using these FORM and SORM analysis strategies, multi-point aerodynamic-structure interacted shape design optimizations with uncertainty are performed very efficiently.

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

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.26 no.12
• /
• pp.2483-2491
• /
• 2002

This study presents an efficient method for robust optimal design. In order to avoid the excessive evaluations of the exact performance functions, two-point diagonal quadratic approximation method is employed for approximating them during optimization process. This approximation method is one of the two point approximation methods. Therefore, the second order sensitivity information of the approximated performance functions are calculated by an analytical method. As a result, this enables one to avoid the expensive evaluations of the exact $2^{nd}$ derivatives of the performance functions unlike the conventional robust optimal design methods based on the gradient information. Finally, in order to show the numerical performance of the proposed method, one mathematical problem and two mechanical design problems are solved and their results are compared with those of the conventional methods.

• Journal of Computational Design and Engineering
• /
• v.3 no.2
• /
• pp.102-111
• /
• 2016

In this paper, we study the problem of computing smooth feature curves from CAD type point clouds models. The proposed method reconstructs feature curves from the intersections of developable strip pairs which approximate the regions along both sides of the features. The generation of developable surfaces is based on a linear approximation of the given point cloud through a variational shape approximation approach. A line segment sequencing algorithm is proposed for collecting feature line segments into different feature sequences as well as sequential groups of data points. A developable surface approximation procedure is employed to refine incident approximation planes of data points into developable strips. Some experimental results are included to demonstrate the performance of the proposed method.

• The Pure and Applied Mathematics
• /
• v.16 no.1
• /
• pp.13-18
• /
• 2009

A semilocal convergence analysis is provided for Newton's method in a Banach space. The inverses of the operators involved are only locally $H{\ddot{o}}lderian$. We make use of a point-based approximation and center-$H{\ddot{o}}lderian$ hypotheses for the inverses of the operators involved. Such an approach can be used to approximate solutions of equations involving nonsmooth operators.

• The Pure and Applied Mathematics
• /
• v.15 no.2
• /
• pp.111-120
• /
• 2008

A semi local convergence analysis is provided for Newton's method in a Banach space setting. The operators involved are only locally Holderian. We make use of a point-based approximation and center-Holderian hypotheses. This approach can be used to approximate solutions of equations involving nonsmooth operators.