• Proceedings of the KIEE Conference
• /
• 2001.07d
• /
• pp.1999-2001
• /
• 2001

The infinite time optimum to regulate the problem of weakly coupled bilinear systems with a quadratic performance criterion is obtained by a sequence of algebraic Lyapunov equations. The new approach is based on the successive approximations. In particular, the order reduction is achieved by using suitable state transformation so that the original Lyapunov equations are decomposed into the reduced-order local Lyapunov equations. The proposed algorithms not only solve optimal control problems in the weakly coupled bilinear system but also reduce the computation time. This paper also includes an example to demonstrate the procedures.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.6 no.2
• /
• pp.63-73
• /
• 2002

The influence of unsteady boundary layer magnetohydrodynamic flow with thermal relaxation of perfectly conducting fluid, past a semi-infinite plate, is considered. The governing non linear partial differential equations are solved using the method of successive approximations. This method is used to obtain the solution for the unsteady boundary layer magnetohydrodynamic flow in the special form when the free stream velocity exponentially depends on time. The effects of Alfven velocity $\alpha$ on the velocity is discussed, and illustrated graphically for the problem.

• East Asian mathematical journal
• /
• v.24 no.3
• /
• pp.295-304
• /
• 2008

We approximate a locally unique solution of a nonlinear operator equation containing a non-differentiable operator in a Banach space setting using Newton's method. Sufficient conditions for the semilocal convergence of Newton's method in this case have been given by several authors using mainly increasing sequences [1]-[6]. Here, we use center as well as Lipschitz conditions and decreasing majorizing sequences to obtain new sufficient convergence conditions weaker than before in many interesting cases. Numerical examples where our results apply to solve equations but earlier ones cannot [2], [5], [6] are also provided in this study.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.28 no.9
• /
• pp.1314-1319
• /
• 2004

In this study, parameter optimization of micro-static mixer with a cantilever beam was accomplished for maximizing the mixing efficiency by using successive response surface approximations. Variables were chosen as the length of cantilever beam and the angle between horizontal and the cantilever beam. Sequential approximate optimization method was used to deal with both highly nonlinear and non-smooth characteristics of flow field in a micro-static mixer. Shape optimization problem of a micro-static mixer can be divided into a series of simple subproblems. Approximation to solve the subproblems was performed by response surface approximation, which does not require the sensitivity analysis. To verify the reliability of approximated objective function and the accuracy of it, ANOVA analysis and variables selection method were implemented, respectively. It was verified that successive response surface approximation worked very well and the mixing efficiency was improved very much comparing with the initial shape of a micro-static mixer.

• Computational Structural Engineering
• /
• v.6 no.4
• /
• pp.57-66
• /
• 1993

The p-version crack model based on integrals of Legendre polynomial and virtual crack extension method is proposed with its potential for application to stress intensity factor computations in linear elastic fracture mechanics. The main advantage of this model is that the data preparation effort is minimal because only a small number of elements are used and high accuracy and the rapid convergence can be achieved in the vicinity of crack tip. There are two important findings from this study. Firstly, the limit value, the strain energy of the exact solution, can be estimated with successive three p-version approximations by ascertaining that the approximations enter the asymptotic range. Secondly, the rate of convergence of p-version model is almost twice that of h-version model on the basis of uniform or quasiuniform mesh refinement for the cracked panel problem subjected to tension.

• Communications of the Korean Institute of Information Scientists and Engineers
• /
• v.1 no.1
• /
• pp.72-74
• /
• 1983

Traditionally, polynomials have been used to approximte functions with prescribed values at a number of points(called the knots) on a given interal on the real line. The method of splines recently developed is more flexible. It approximates a function in a piece-wise fashion, by means of a different polynomial in each subinterval. The cubic spline gas ets origins in beam theory. It possessed continuous first and second deriatives at the knots and is characterised by a minimum curvature property which es rdlated to the physical feature of minimum potential energy of the supported beam. Translated into mathematical terms, this means that between successive knots the approximation yields a third-order polynomial sith its first derivatives continuous at the knots. The minimum curvature property holds good for each subinterval as well as for the whole region of approximation This means that the integral of the square of the second derivative over the entire interval, and also over each subinterval, es to be minimized. Thus, the task of determining the spline lffers itself as a textbook problem in discrete computer programming, since the integral of ghe square of the second derivative can be obviously recognized as the criterion function whicg gas to be minimized. Starting with the initial value of the function and assuming an initial solpe of the curve, the minimum norm property of the curvature makes sequential decision of the slope at successive knots (points) feasible. It is the aim of this paper to derive the cubic spline by the methods of computer programming and show that the results which is computed the all the alues in each subinterval of the spline approximations.

• Magazine of the Korean Society of Agricultural Engineers
• /
• v.29 no.3
• /
• pp.153-162
• /
• 1987

A numerical procedure for the analysis of slender arch buckling problems for uniform dead weight is presented in this paper. Such loading changes in the arch profile. The problem is nonlinear. The numerical procedure is limited to an inextensible analysis and to elastic behavior. Based upon a numerical integration technique developed by Newmark for straight beams, a large deflection bending analysis is combined with small deflection buckling routines to formulate the numerical procedure. The numerical procedure is composed of a combination of the numerical integration and successive approximations procedure. The results obtained in this study are as follows : 1.The critical loads obtained in this study coincide with the results by Austin so that the algorithm developed in this study is verified. 2.The numerical results are converged with good precision when the half arch is divided into 10 segments in both Prime and Quadratic section. 3.The critical loads are decreased as the ratios of rise versus span are increased. 4.The critical loads are increased as the moments of inertia at the ends are increased. 5.The critical loads of Prime section are larger than that of Quadratic section under the same profile conditions.

• Journal of the Korean Society of Safety
• /
• v.12 no.3
• /
• pp.120-131
• /
• 1997

This paper presents an approximate reanalysis methods of structures based on substructuring for an effective optimization of large-scale structural systems. In most optimal design procedures the analysis of the structure must be repeated many times. In particular, one of the main obstacles in the optimization of structural systems are involved high computational cost and expended long time in the optimization of large-scale structures. The purpose of this paper is to evaluate efficiently the structural behavior of new designs using information from previous ones, without solving basic equations for successive modification in the optimal design. The proposed reanalysis procedure is combined Taylor series expansions which is a local approximation and reduced basis method which is a global approximation based on substructuring. This technique is to choose each of the terms of Taylor series expansions as the basis vector of reduced basis method in substructuring system which is one of the most effective analysis of large -scale structures. Several numerical examples illustrate the effectiveness of the solution process.

• Proceedings of the KIEE Conference
• /
• 1987.11a
• /
• pp.106-108
• /
• 1987

Until now, inflow has been handled an independent log-normal random variable in the problem of planning the long-term operation of a multi-reservoir hydrothermal electric power generation system. This paper introduces the detail study for making rule curve by applying weekly time interval for handling inflows. The hydro system model consists of a set of reservoirs and ponds. Thermal units are modeld by one equivalent thermal unit. Objective is minimizing the total cost that the summation of the fuel cost of equivalent thermal unit at each time interval. For optimization, stochastic dynamic programming(SDP) algorithm using successive approximations is used.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.6 no.8
• /
• pp.93-103
• /
• 1983

In this paper, we study an optimal service policy of the M/M/2/K queueing system with two types of customers. The incurred costs consist of waiting cost, service cost and incurred costs consist of waiting cost, service cut and changeover cost. The changeover cost occurs when a server who assigned to serve a particular type of customers reassigned to the other types of customers. Two servers serve two types of customers who arrive to the two separate queues. The two types of customers differ in respect of their arrival rate, service rate, waiting cost, and service cost. The servers require a policy, for determining when they should change their service type, which minimizes the long run expected total cost. The policy is obtained by a Markov decision process model that consists of a finite number of states and actions. In order to find the optimal service policy, we define states and actions of the system, compute onestep transition probabilities, and apply to the successive approximations algorithm.