• Title/Summary/Keyword: Starting algorithm

Search Result 399, Processing Time 0.024 seconds

Period doubling of the nonlinear dynamical system of an electrostatically actuated micro-cantilever

  • Chen, Y.M.;Liu, J.K.
    • Smart Structures and Systems
    • /
    • v.14 no.5
    • /
    • pp.743-763
    • /
    • 2014
  • The paper presents an investigation of the nonlinear dynamical system of an electrostatically actuated micro-cantilever by the incremental harmonic balance (IHB) method. An efficient approach is proposed to tackle the difficulty in expanding the nonlinear terms into truncated Fourier series. With the help of this approach, periodic and multi-periodic solutions are obtained by the IHB method. Numerical examples show that the IHB solutions, provided as many as harmonics are taken into account, are in excellent agreement with numerical results. In addition, an iterative algorithm is suggested to accurately determine period doubling bifurcation points. The route to chaos via period doublings starting from the period-1 or period-3 solution are analyzed according to the Floquet and the Feigenbaum theories.

NEW COMPLEXITY ANALYSIS OF PRIMAL-DUAL IMPS FOR P* LAPS BASED ON LARGE UPDATES

  • Cho, Gyeong-Mi;Kim, Min-Kyung
    • Bulletin of the Korean Mathematical Society
    • /
    • v.46 no.3
    • /
    • pp.521-534
    • /
    • 2009
  • In this paper we present new large-update primal-dual interior point algorithms for $P_*$ linear complementarity problems(LAPS) based on a class of kernel functions, ${\psi}(t)={\frac{t^{p+1}-1}{p+1}}+{\frac{1}{\sigma}}(e^{{\sigma}(1-t)}-1)$, p $\in$ [0, 1], ${\sigma}{\geq}1$. It is the first to use this class of kernel functions in the complexity analysis of interior point method(IPM) for $P_*$ LAPS. We showed that if a strictly feasible starting point is available, then new large-update primal-dual interior point algorithms for $P_*$ LAPS have $O((1+2+\kappa)n^{{\frac{1}{p+1}}}lognlog{\frac{n}{\varepsilon}})$ complexity bound. When p = 1, we have $O((1+2\kappa)\sqrt{n}lognlog\frac{n}{\varepsilon})$ complexity which is so far the best known complexity for large-update methods.

Design optimization of spot welded structures to attain maximum strength

  • Ertas, Ahmet H.
    • Steel and Composite Structures
    • /
    • v.19 no.4
    • /
    • pp.995-1009
    • /
    • 2015
  • This study presents design optimization of spot welded structures to attain maximum strength by using the Nelder-Mead (Simplex) method. It is the main idea of the algorithm that the simulation run is executed several times to satisfy predefined convergence criteria and every run uses the starting points of the previous configurations. The material and size of the sheet plates are the pre-assigned parameters which do not change in the optimization cycle. Locations of the spot welds, on the other hand, are chosen to be design variables. In order to calculate the objective function, which is the maximum equivalent stress, ANSYS, general purpose finite element analysis software, is used. To obtain global optimum locations of spot welds a methodology is proposed by modifying the Nelder-Mead (Simplex) method. The procedure is applied to a number of representative problems to demonstrate the validity and effectiveness of the proposed method. It is shown that it is possible to obtain the global optimum values without stacking local minimum ones by using proposed methodology.

Intersections of a polyhedral surface with parallel planes using characteristics points (특성점의 성질을 이용한 다면체 곡면과 평행한 평면들과의 교선)

  • 전차수;김영일
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 1995.04a
    • /
    • pp.603-616
    • /
    • 1995
  • Presented in this paper is an algorithm to obtain the intersections of a polyhedral surface composed of triangle facets with a series of parallel planes for extracting machining information from the surface. The change of the topology of the intersection curves is caused by characteristic points of the surface when sectioning the surface with parallel planes. The characteristic points are internal maximum, internal minimum, internal saddle, boundary maximum, boundary minimum, boundary max-saddle, and boundary min-saddle points. The starting points of the intersects are found efficiently and robustly using the characteristic points. The characteristic points as well as the intersection contours can be used to evaluate the machining information for process planning, and to generate NC tool path in CAD/CAM system.

  • PDF

Establishment of GIS River Section for Water Flow Management (하천유량관리를 위한 GIS 하도단면 구축)

  • 최철관;김상호;배덕효;한건연
    • Spatial Information Research
    • /
    • v.8 no.1
    • /
    • pp.131-140
    • /
    • 2000
  • The systematic data management system in the area of river flow analysis has not yet constructed, even though the need is evident due to the complicated process of tremendous input/output data in the modeling study and the importance of visualization of spatial flow variation. The objectives of this study are to suggest the method for constructing the NGIS-based river database based on contour, river, elevation, boundary layers and river cross sections and to provide the algorithm for interpolating equi-distance river cross section points. The selected study area is the main Han River starting from Paldang dam site to Indogyo bridge. The constructed database will be useful for the scientific water flow management system in the study area.

  • PDF

Adaptive digital control system of flow rates for an OTEC plant

  • Nakamura, Masatoshi;Uehara, Haruo
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1987.10a
    • /
    • pp.753-758
    • /
    • 1987
  • The purpose of ocean thermal energy conversion (OTEC) plant control is to provide stable power efficiently by appropriately regulating the seawater flow rates and the working fluid flow rate under conditions of continually changing seawater temperatures. This paper describes digital control of working fluid flow rate based on an adaptive control theory for the "Imari 2" OTEC plant at Saga University. Provisions have been made for linkage between the software of the adaptive control theory and the hardware of the OTEC plant. In implementing the working fluid flow rate control, if persistency of excitation conditions are lost, the algorithm of identification often exhibits bursting phenomena. To avoid this difficulty, the stopping-and-starting rule for identification was derived and was used for the working fluid flow rate control. Satisfactory control performance was then obtained by using this digital control system.ol system.

  • PDF

A Study on a Current Controller using TMS320F240 Microprocessor (TMS320F240 마이크로프로세스를 이용한 전류제어기 연구)

  • Bae, Jong-Il
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.64 no.9
    • /
    • pp.1380-1384
    • /
    • 2015
  • The DC motor has the strong characteristics in the speed response, the system parameter variations and the external influence and is used as the speed controller with its good starting torque in the distributing industry. However development of the Microprocessor which is for high speed switching program can make better control system. This paper introduce to design of the high-effective DC motor controller that is using Software Bang-Bang Program of Fuzzy algorithm and to verify a PI controller and a Fuzzy controller.

Simulation of Voltage and Current Distributions in Transmission Lines Using State Variables and Exponential Approximation

  • Dan-Klang, Panuwat;Leelarasmee, Ekachai
    • ETRI Journal
    • /
    • v.31 no.1
    • /
    • pp.42-50
    • /
    • 2009
  • A new method for simulating voltage and current distributions in transmission lines is described. It gives the time domain solution of the terminal voltage and current as well as their line distributions. This is achieved by treating voltage and current distributions as distributed state variables (DSVs) and turning the transmission line equation into an ordinary differential equation. Thus the transmission line is treated like other lumped dynamic components, such as capacitors. Using backward differentiation formulae for time discretization, the DSV transmission line component is converted to a simple time domain companion model, from which its local truncation error can be derived. As the voltage and current distributions get more complicated with time, a new piecewise exponential with controllable accuracy is invented. A segmentation algorithm is also devised so that the line is dynamically bisected to guarantee that the total piecewise exponential error is a small fraction of the local truncation error. Using this approach, the user can see the line voltage and current at any point and time freely without explicitly segmenting the line before starting the simulation.

  • PDF

A Study on the Characteristics of the Wheel/Roller Contact Geometry (차륜/궤조륜 기하학적 접촉특성에 관한 연구)

  • Hur, Hyun-Moo
    • Journal of the Korean Society for Railway
    • /
    • v.9 no.5 s.36
    • /
    • pp.618-623
    • /
    • 2006
  • Understanding the contact between wheel and rail is a starting point in railway vehicle dynamic research area and especially analysis for the contact geometry between wheel and rail is important. On the one hand, the critical speed as the natural characteristics of rolling-stock is generally tested on the roller rig. The geometrical characteristics of the wheel/roller contact on the roller rig are different from these of the general wheel/rail contact because the longitudinal radius of roller is not infinite compared with rail. Thus, in this paper we developed the algorithm to analyze the wheel/roller contact geometry of our roller rig which is constructed now and analyzed the difference between whee/roller contact and wheel/rail contact. In conclusion, we found that the yaw motion of wheelset and the roller radius influence the geometrical contact parameters in wheel flange contact area.

Inversion of Geophysical Data Using Genetic Algorithms (유전적 기법에 의한 지구물리자료의 역산)

  • Kim, Hee Joon
    • Economic and Environmental Geology
    • /
    • v.28 no.4
    • /
    • pp.425-431
    • /
    • 1995
  • Genetic algorithms are so named because they are analogous to biological processes. The model parameters are coded in binary form. The algorithm then starts with a randomly chosen population of models called chromosomes. The second step is to evaluate the fitness values of these models, measured by a correlation between data and synthetic for a particular model. Then, the three genetic processes of selection, crossover, and mutation are performed upon the model in sequence. Genetic algorithms share the favorable characteristics of random Monte Carlo over local optimization methods in that they do not require linearizing assumptions nor the calculation of partial derivatives, are independent of the misfit criterion, and avoid numerical instabilities associated with matrix inversion. An additional advantage over converntional methods such as iterative least squares is that the sampling is global, rather than local, thereby reducing the tendency to become entrapped in local minima and avoiding the dependency on an assumed starting model.

  • PDF