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

• Kyungpook Mathematical Journal
• /
• v.46 no.3
• /
• pp.389-397
• /
• 2006

A fixed point theorem of Singh and Singh [10] is generalized to locally convex spaces and the new result is applied to extend a result on invariant approximation of Jungck and Sessa [5].

• The Mathematical Education
• /
• v.18 no.1
• /
• pp.21-23
• /
• 1980

In [3], an extension of B. Brosowski s T-invariant Point Theorem is given where the linearity of the function and the convexity of the set are relaxed. In this paper, our main purpose is to generalize S. P. Singh's T-invariant Point Theorem to Approximation Theory.

• Bulletin of the Korean Mathematical Society
• /
• v.44 no.3
• /
• pp.537-545
• /
• 2007

Necessary conditions for the existence of common fixed points for noncommuting mappings satisfying generalized contractive conditions in the setup of certain metrizable topological vector spaces are obtained. As applications, related results on best approximation are derived. Our results extend, generalize and unify various known results in the literature.

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

• Journal of applied mathematics & informatics
• /
• v.29 no.3_4
• /
• pp.713-719
• /
• 2011

The problem of approximation from a set of scattered data arises in a wide range of applied mathematics and scientific applications. In this study, we present a quasi-interpolatory approximation scheme for scattered data approximation problem, which reproduces a certain space of polynomials. The proposed scheme is local in the sense that for an evaluation point, the contribution of a data value to the approximating value is decreasing rapidly as the distance between two data points is increasing.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.35 no.3
• /
• pp.259-266
• /
• 2011

We present a new dual sequential approximate optimization (SAO) algorithm called SD-TDQAO (sequential dual two-point diagonal quadratic approximate optimization). This algorithm solves engineering optimization problems with a nonlinear objective and nonlinear inequality constraints. The two-point diagonal quadratic approximation (TDQA) was originally non-convex and inseparable quadratic approximation in the primal design variable space. To use the dual method, SD-TDQAO uses diagonal quadratic explicit separable approximation; this can easily ensure convexity and separability. An important feature is that the second-derivative terms of the quadratic approximation are approximated by TDQA, which uses only information on the function and the derivative values at two consecutive iteration points. The algorithm will be illustrated using mathematical and topological test problems, and its performance will be compared with that of the MMA algorithm.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.19 no.2
• /
• pp.433-442
• /
• 1995

For the line search of a multi-variable optimization, an efficient algorithm is presented. The algorithm sequentially employs several polynomial approximations such as 2-point quadratic interpolation, 3-point cubic interpolation/extrapolation and 4-point cubic interpolation/extrapolation. The order of polynomial function is automatically increased for improving the accuracy of approximation. The method of approximation (interpolation or extrapolation) is automatically switched by checking the slope information of the sample points. Also, for selecting the initial step length along the descent vector, a new approach is presented. The performance of the proposed method is examined by solving typical test problems such as mathematical problems, mechanical design problems and dynamic response problems.

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

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