• Title/Summary/Keyword: Algorithm Element

Search Result 2,132, Processing Time 0.029 seconds

Comparison of alternative algorithms for buckling analysis of slender steel structures

  • Dimopoulos, C.A.;Gantes, C.J.
    • Structural Engineering and Mechanics
    • /
    • v.44 no.2
    • /
    • pp.219-238
    • /
    • 2012
  • Objective of this paper is to compare linear buckling analysis formulations, available in commercial finite element programs. Modern steel design codes, including Eurocode 3, make abundant use of linear buckling loads for calculation of slenderness, and of linear buckling modes, used as shapes of imperfections for nonlinear analyses. Experience has shown that the buckling mode shapes and the magnitude of buckling loads may differ, sometimes significantly, from one algorithm to another. Thus, three characteristic examples have been used in order to assess the linear buckling formulations available in the finite element programs ADINA and ABAQUS. Useful conclusions are drawn for selecting the appropriate algorithm and the proper reference load in order to obtain either the classical linear buckling load or a good approximation of the actual geometrically nonlinear buckling load.

Functional Simulation of Logic Circuits by Prolog (Prolog를 이용한 논리회로의 기능적 시뮬레이션)

  • Kim, J.S.;Cho, S.B.;Park, H.J.;Lim, I.C.
    • Proceedings of the KIEE Conference
    • /
    • 1987.07b
    • /
    • pp.1467-1470
    • /
    • 1987
  • This paper proposes a functional simulation algorithm which decrease the internal memory space and run time in simulation of VLSI. Flip-flop, register, ram, rom, ic and fun are described as functional elements in the simulator. Especially icf is made as new functional element by combining the gate and the functional element, therefore icf is used efficiently in simulation of VLSI. The proposed algorithm is implemented on PC-AT(MS-DOS) in by Prolog-1.

  • PDF

Improved Optimal Approximated Unfolding Algorithm of a Curved Shell Plate with Automatic Mesh Generation (자동 메쉬 생성을 적용한 향상된 자유 곡면의 최적 근사 전개 알고리즘)

  • Ryu C.H.;Shin J.G.
    • Korean Journal of Computational Design and Engineering
    • /
    • v.11 no.3
    • /
    • pp.157-163
    • /
    • 2006
  • Surfaces of many engineering structures, especially, those of ships are commonly made out of either single- or double-curved surfaces to meet functional requirements. The first step in the fabrication process of a three-dimensional design surface is unfolding or flattening the surface, otherwise known as planar development, so that manufacturers can determine the initial flat plate which is required to form the design shape. In this paper, an algorithm for optimal approximated development of a general curved surface, including both single- and double-curved surfaces, is established by minimizing the strain energy of deformation from its planar development to the design surface. The unfolding process is formulated into a constrained nonlinear programming problem, based on the deformation theory and finite element. Constraints are subjected to the characteristics of the fabrication method. And the design surface, or the curved shell plate is subdivided by automatic mesh generation.

A general convergence condition of the Newton-Raphson algorithm applied to compressible hyperelasticity

  • Peyraut, Francois;Feng, Zhi-Qiang;Labed, Nadia
    • Structural Engineering and Mechanics
    • /
    • v.21 no.2
    • /
    • pp.121-136
    • /
    • 2005
  • This paper presents the implementation of the Blatz-Ko hyperelastic compressible model in a finite element program to deal with large deformation problems. We show analytically and numerically that the minimum number of increment steps in the Newton-Raphson algorithm depends on material properties and applied loads. We also show that this dependence is related to the orientation preservation principle. So we propose a convergence criteria based on the sign of eigenvalues of the deformation gradient matrix.

On the Development of GUI and Command Based Finite Element Method Package in CEMTool (CEMTool 환경에서 GUI 및 명령어 기반 유한요소법 패키지 개발에 관하여)

  • Ahn, Choon-Ki;Park, Jeong-Hoon;Kwon, Wook-Hyun
    • Proceedings of the KIEE Conference
    • /
    • 2004.07d
    • /
    • pp.2568-2570
    • /
    • 2004
  • CEMTool is a command style design and analyzing package for scientific and technological algorithm and a matrix based computation language. In this paper, we present new FEM (Finite Element Method) package in CEMTool environment. In contrast to the existing MATLAB PDE Toolbox, our proposed FEM package can deal with the combination of the reserved words. Also, we can control the mesh in a very effective way With the introduction of new mesh generation algorithm and NDM (Hosted Dissection Method), our FEM package can guarantee the shorter computational time than MATLAB PDE Toolbox. In addition, using the advanced electromagnetics library of CEMTool FEM package, we can analyze the practical problems such as the motor field analysis. Consequently, with our new FEM package, we can overcome some disadvantages of the existing MATLAB PDE Toolbox.

  • PDF

Design of Initial Billet using the Artificial Neural Network for a Hot Forged Product (신경망을 이용한 열간단조품의 초기 소재 설계)

  • Kim, D.J.;Kim, B.M.;Park, J.C.
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.12 no.11
    • /
    • pp.118-124
    • /
    • 1995
  • In the paper, we have proposed a new technique to determine the initial billet for the forged products using a function approximation in neural network. A three-layer neural network is used and a back propagation algorithm is employed to train the network. An optimal billet which satisfied the forming limitation, minimum of incomplete filling in the die cavity, load and energy as well as more uniform distribution of effective strain, is determined by applying the ability of function approximation of the neural network. The amount of incomplete filling in the die, load and forming energy as well as effective strain are measured by the rigid-plastic finite element method. This new technique is applied to find the optimal billet size for the axisymmetric rib-web product in hot forging. This would reduce the number of finite element simulation for determining the optimal billet of forging products, further it is usefully adopted to physical modeling for the forging design

  • PDF

Buckling optimization of laminated composite plate with elliptical cutout using ANN and GA

  • Nicholas, P. Emmanuel;Padmanaban, K.P.;Vasudevan, D.
    • Structural Engineering and Mechanics
    • /
    • v.52 no.4
    • /
    • pp.815-827
    • /
    • 2014
  • Buckling optimization of laminated composite plates is significant as they fail because of buckling under in-plane compressive loading. The plate is usually modeled without cutout so that the buckling strength is found analytically using classical laminate plate theory (CLPT). However in real world applications, the composite plates are modeled with cutouts for getting them assembled and to offer the provisions like windows, doors and control system. Finite element analysis (FEA) is used to analyze the buckling strength of the plate with cutouts and it leads to high computational cost when the plate is optimized. In this article, a genetic algorithm based optimization technique is used to optimize the composite plate with cutout. The computational time is highly reduced by replacing FEA with artificial neural network (ANN). The effectiveness of the proposed method is explored with two numerical examples.

A technique for optimally designing fibre-reinforced laminated structures for minimum weight with manufacturing uncertainties accounted for

  • Walker, M.
    • Steel and Composite Structures
    • /
    • v.7 no.3
    • /
    • pp.253-262
    • /
    • 2007
  • A methodology to design symmetrically laminated fibre-reinforced structures under transverse loads for minimum weight, with manufacturing uncertainty in the ply angle, is described. The ply angle and the ply thickness are the design variables, and the Tsai-Wu failure criteria is the design constraint implemented. It is assumed that the probability of any tolerance value occurring within the tolerance band, compared with any other, is equal, and thus the approach is a worst-case scenario approach. The finite element method, based on Mindlin plate and shell theory, is implemented, and thus effects like bending-twisting coupling are accounted for. The Golden Section method is used as the search algorithm, but the methodology is flexible enough to allow any appropriate finite element formulation, search algorithm and failure criterion to be substituted. In order to demonstrate the procedure, laminated plates with varying aspect ratios and boundary conditions are optimally designed and compared.

Development of an Algorithm for the Vision-Based Surface-Strain Measurment of Large Stamped Parts (비전을 이용한 중.대형 판재성형 제품의 곡면 변형률 측정 알고리듬 개발)

  • 김형종
    • Proceedings of the Korean Society for Technology of Plasticity Conference
    • /
    • 1999.03b
    • /
    • pp.269-272
    • /
    • 1999
  • It is still hard to measure the strain distribution over entire surface of a medium or large-size stamped part even by using an automated strain measurement system. Several methods which enable to enlarge the measurement range without losing accuracy and precision are suggested in this study, The superposition of images having different high-lightened or damaged part each other results in an enhanced image. A new method for constructing the element connectivity from a line-thinned image makes it possible to identify up to 1,000 elements. And the geometry assembling algorithm is proved very efficient in which the whole area to be measured is divided into several parts ; the coordinate transformation between every two adjacent parts is obtained from the concept of the least square error ; and the 3-D shape or strain distribution over the whole surface is assembled,

  • PDF

The Design of a Code-String Matching Processor using an EWLD Algorithm (EWLD 알고리듬을 이용한 코드열 정합 프로세서의 설계)

  • 조원경;홍성민;국일호
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.31A no.4
    • /
    • pp.127-135
    • /
    • 1994
  • In this paper we propose an EWLD(Enhanced Weighted Levenshtein Distance) algorithm to organize code-string pattern matching linear array processor based on the mappting to an one-dimensional array from a two-dimensional matching matrix, and design a processing element(PE) of the processor, N PEs are required instead of NS02T in the processor because of the mapping. Data input and output between PEs and all internal operations of each PE are performed in bit-serial fashion. The bit-serial operation consists of the computing of word distance (WD) by comparison and the selection of optimal code transformation path, and takes 22 clocks as a cycle. The layout of a PE is designed based on the double metal $1.5\mu$m CMOS rule. About 1,800 transistors consistute a processing element and 2 PEs are integrated on a 3mm$\times$3mm sized chip.

  • PDF