• Title/Summary/Keyword: Initial Approximation

Search Result 228, Processing Time 0.021 seconds

Marguerre shell type secant matrices for the postbuckling analysis of thin, shallow composite shells

  • Arul Jayachandran, S.;Kalyanaraman, V.;Narayanan, R.
    • Structural Engineering and Mechanics
    • /
    • v.18 no.1
    • /
    • pp.41-58
    • /
    • 2004
  • The postbuckling behaviour of thin shells has fascinated researchers because the theoretical prediction and their experimental verification are often different. In reality, shell panels possess small imperfections and these can cause large reduction in static buckling strength. This is more relevant in thin laminated composite shells. To study the postbuckling behaviour of thin, imperfect laminated composite shells using finite elements, explicit incremental or secant matrices have been presented in this paper. These incremental matrices which are derived using Marguerre's shallow shell theory can be used in combination with any thin plate/shell finite element (Classical Laminated Plate Theory - CLPT) and can be easily extended to the First Order Shear deformation Theory (FOST). The advantage of the present formulation is that it involves no numerical approximation in forming total potential energy of the shell during large deformations as opposed to earlier approximate formulations published in the literature. The initial imperfection in shells could be modeled by simply adjusting the ordinate of the shell forms. The present formulation is very easy to implement in any existing finite element codes. The secant matrices presented in this paper are shown to be very accurate in tracing the postbuckling behaviour of thin isotropic and laminated composite shells with general initial imperfections.

Coarse to Fine Optical Flow Detection (조세단계를 이용한 광류검출 알고리즘)

  • Lee Her Man;Seo Jeong Man
    • Journal of the Korea Society of Computer and Information
    • /
    • v.10 no.1 s.33
    • /
    • pp.223-229
    • /
    • 2005
  • In this paper a coarse-to-fine optical flow detection method is proposed. Provided that optical flow gives reliable approximation to two-dimensional image motion, it can be used to recover the three-dimensional motion, but usually to set the reliable optical flows are difficult. The proposed algorithm uses Horn's algorithm for detecting initial optical flow, then Thin Plate Spline is introduced to warp a image frame of the initial optical flow to the next image frame. The optical flow for the warped image frame is again used iteratively until the mean square error between two image sequence frames is lowered. The proposed method is experimented for the real moving picture image sequence. The proposed algorithm gives dense optical flow vectors.

  • PDF

Network Design with Non-Linear Optimization Method (비선형(非線型) 최적화기법(最適化技法)에 의한 가로망설계(街路網設計))

  • Jang, Hyun Bong;Park, Chang Ho
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.8 no.1
    • /
    • pp.165-172
    • /
    • 1988
  • An optimal network design method using continuous form of design variables is considered. Modified Hooke-and-Jeeves algorithm has been implemented in order to solve nonlinear progamming problem which is approximately equivalent to the real network design problem (NDP) with system. efficiency criteria(i. e. travel time and costs) and construction cost as objective function. Various forms of construction cost function, locations of initial solution, and dimension of initial step size of link improvement are taken into account to show the validity of this approach. The results obtained are quite promising in terms of the numbers of evaluations in solving NDP, and the speed of convergence. Finally, some techniques in choosing efficient intial solution, initial step size and approximation are given.

  • PDF

Calculation on Electronic State of $MnO_2$ Oxide Semiconductor with other initial spin conditions by First Principle Molecular Orbital Method (제1원리 분자궤도계산법에 의한 초기 spin 조건에 따른 $MnO_2$ 반도체의 전자상태 변화 계산)

  • Lee, Dong-Yoon;Kim, Bong-Seo;Song, Jae-Sung;Kim, Hyun-Sik
    • Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
    • /
    • 2003.11a
    • /
    • pp.148-151
    • /
    • 2003
  • The spin density of ${\beta}-MnO_2$ structure was theoretically investigated by $DV-X_{\alpha}$ (the discrete variation $X{\alpha}$) method, which is a sort of the first principle molecular orbital method using Hatre-Fock-Slater approximation. The used cluster model was $[Mn_{14}O_{56}]^{-52}$. The ${\beta}-MnO_2$ is a paramagnetic oxide semiconductor material having the energy band gap of 0.18 eV and an 3 loan-pair electrons in the 3d orbital of an cation. This material exhibits spin-only magnetism and has the magnetic ordering temperature of 94 K. Below this temperature its magnetism appears as antiferromagnetism. The calculations of electronic state showed that if the initial spin condition of input parameters changed, the magnetic state changed from paramagnetic to antiferromagnetic. When d orbital of all Mn atoms in cluster had same initial spin state as only up spin, paramagnetic spin density distribution appeared by the calculation. On the other way, d orbital had alternately changed spin state along special direction the resulted spin distribution showed antiferromagnetism.

  • PDF

Simulation Study of Discrete Event Systems using Fast Approximation Method of Single Run and Optimization Method of Multiple Run (단일 실행의 빠른 근사해 기법과 반복 실행의 최적화 기법을 이용한 이산형 시스템의 시뮬레이션 연구)

  • Park, Kyoung Jong;Lee, Young Hae
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.32 no.1
    • /
    • pp.9-17
    • /
    • 2006
  • This paper deals with a discrete simulation optimization method for designing a complex probabilistic discrete event simulation. The developed algorithm uses the configuration algorithm that can change decision variables and the stopping algorithm that can end simulation in order to satisfy the given objective value during single run. It tries to estimate an auto-regressive model for evaluating correctly the objective function obtained by a small amount of output data. We apply the proposed algorithm to M/M/s model, (s, S) inventory model, and known-function problem. The proposed algorithm can't always guarantee the optimal solution but the method gives an approximate feasible solution in a relatively short time period. We, therefore, show the proposed algorithm can be used as an initial feasible solution of existing optimization methods that need multiple simulation run to search an optimal solution.

A Study on the Estimation of Scattering Coefficient in the Spheres Using an Inverse Analysis (역해석을 이용한 구형 공간 내의 산란계수 추정에 관한 연구)

  • Kim, Woo-Seung;Kwag, Dong-Seong
    • Transactions of the Korean Society of Mechanical Engineers B
    • /
    • v.23 no.3
    • /
    • pp.364-373
    • /
    • 1999
  • A combination of conjugate gradient and Levenberg-Marquardt method is used to estimate the spatially varying scattering coefficient, ${\sigma}(r)$, in the solid and hollow spheres by utilizing the measured transmitted beams from the solution of an inverse analysis. The direct radiation problem associated with the inverse problem is solved by using the $S_{12}-approximation$ of the discrete ordinates method. The accuracy of the computations increased when the results from the conjugate gradient method are used as an initial guess for the Levenberg-Marquardt method of minimization. Optical thickness up to ${\tau}_0=3$ is used for the computations. Three different values of standard deviation are considered to examine the accuracy of the solution from the inverse analysis.

Optimal Control by the Gradient Method (경사법에의한 최적제어)

  • 양흥석;황희융
    • 전기의세계
    • /
    • v.21 no.3
    • /
    • pp.48-52
    • /
    • 1972
  • The application of pontryagin's Maximum Principle to the optimal control eventually leads to the problem of solving the two point boundary value problem. Most of problems have been related to their own special factors, therfore it is very hard to recommend the best method of deriving their optimal solution among various methods, such as iterative Runge Kutta, analog computer, gradient method, finite difference and successive approximation by piece-wise linearization. The gradient method has been applied to the optimal control of two point boundary value problem in the power systems. The most important thing is to set up some objective function of which the initial value is the function of terminal point. The next procedure is to find out any global minimum value from the objective function which is approaching the zero by means of gradient projection. The algorithm required for this approach in the relevant differential equations by use of the Runge Kutta Method for the computation has been established. The usefulness of this approach is also verified by solving some examples in the paper.

  • PDF

CALCULATION METHODS OF SOLAR ATMOSPHERIC MODEL (태양대기모델 계산법)

  • KIM KAP-SUNG
    • Publications of The Korean Astronomical Society
    • /
    • v.15 no.spc2
    • /
    • pp.65-71
    • /
    • 2000
  • We have investigated the numerical methods to calculate model atmosphere for the analysis of spectral lines emitted from the sun and stars. Basic equations used in our calculations are radiative transfer, statistical equilibrium and charge-particle conservations. Transfer equation has been solved to get emitting spectral line profile as an initial value problem using Adams-Bashforth-Moulton method with accuracy as high as 12th order. And we have calculated above non linear differential equations simultaneously as a boundary value problem by finite difference method of 3 points approximation through Feautrier elimination scheme. It is found that all computing programs coded by above numerical methods work successfully for our model atmosphere.

  • PDF

A FAST KACZMARZ-KOVARIK ALGORITHM FOR CONSISTENT LEAST-SQUARES PROBLEMS

  • Popa, Constantin
    • Journal of applied mathematics & informatics
    • /
    • v.8 no.1
    • /
    • pp.9-26
    • /
    • 2001
  • In some previous papers the author extended two algorithms proposed by Z. Kovarik for approximate orthogonalization of a finite set of linearly independent vectors from a Hibert space, to the case when the vectors are rows (not necessary linearly independent) of an arbitrary rectangular matrix. In this paper we describe combinations between these two methods and the classical Kaczmarz’s iteration. We prove that, in the case of a consistent least-squares problem, the new algorithms so obtained converge ti any of its solutions (depending on the initial approximation). The numerical experiments described in the last section of the paper on a problem obtained after the discretization of a first kind integral equation ilustrate the fast convergence of the new algorithms. AMS Mathematics Subject Classification : 65F10, 65F20.

NUMERICAL SIMULATION OF PLASTIC FLOW BY FINITE ELEMENT LIMIT ANALYSIS

  • Hoon-Huh;Yang, Wei-H.
    • Proceedings of the Korean Society for Technology of Plasticity Conference
    • /
    • 1992.03a
    • /
    • pp.159-176
    • /
    • 1992
  • Limit analysis has been rendered versatile in many problems such as structural problems and metal forming problems. In metal forming analysis, a slip-line method and an upper bound method approach to limit solutions is considered as the most challenging areas. In the present work, a general algorithm for limit solutions of plastic flow is developed with the use of finite element limit analysis. The algorithm deals with a generalized Holder inequality, a duality theorem, and a combined smoothing and successive approximation in addition to a general procedure for finite element analysis. The algorithm is robust such that from any initial trial solution, the first iteration falls into a convex set which contains the exact solution(s) of the problem. The idea of the algorithm for limit solution is extended from rigid/perfectly-plastic materials to work-hardening materials by the nature of the limit formulation, which is also robust with numerically stable convergence and highly efficient computing time.

  • PDF