Force Network Analysis using Complementary Energy

Similar documents
Ones Assignment Method for Solving Traveling Salesman Problem

Octahedral Graph Scaling

Visualization of Gauss-Bonnet Theorem

Optimal Mapped Mesh on the Circle

Assignment 5; Due Friday, February 10

Pattern Recognition Systems Lab 1 Least Mean Squares

Alpha Individual Solutions MAΘ National Convention 2013

Math 10C Long Range Plans

Area As A Limit & Sigma Notation

1 Graph Sparsfication

A New Morphological 3D Shape Decomposition: Grayscale Interframe Interpolation Method

South Slave Divisional Education Council. Math 10C

CS 683: Advanced Design and Analysis of Algorithms

Mathematics and Art Activity - Basic Plane Tessellation with GeoGebra

New Results on Energy of Graphs of Small Order

Exact Minimum Lower Bound Algorithm for Traveling Salesman Problem

MATHEMATICAL METHODS OF ANALYSIS AND EXPERIMENTAL DATA PROCESSING (Or Methods of Curve Fitting)

Computational Geometry

The Closest Line to a Data Set in the Plane. David Gurney Southeastern Louisiana University Hammond, Louisiana

Bezier curves. Figure 2 shows cubic Bezier curves for various control points. In a Bezier curve, only

Recursive Procedures. How can you model the relationship between consecutive terms of a sequence?

The Platonic solids The five regular polyhedra

On Infinite Groups that are Isomorphic to its Proper Infinite Subgroup. Jaymar Talledo Balihon. Abstract

LU Decomposition Method

THIN LAYER ORIENTED MAGNETOSTATIC CALCULATION MODULE FOR ELMER FEM, BASED ON THE METHOD OF THE MOMENTS. Roman Szewczyk

A Note on Least-norm Solution of Global WireWarping

Image Segmentation EEE 508

Dimensionality Reduction PCA

The isoperimetric problem on the hypercube

Eigenimages. Digital Image Processing: Bernd Girod, 2013 Stanford University -- Eigenimages 1

A study on Interior Domination in Graphs

Fundamentals of Media Processing. Shin'ichi Satoh Kazuya Kodama Hiroshi Mo Duy-Dinh Le

Name of the Student: Unit I (Logic and Proofs) 1) Truth Table: Conjunction Disjunction Conditional Biconditional

Eigenimages. Digital Image Processing: Bernd Girod, Stanford University -- Eigenimages 1

EE 584 MACHINE VISION

Data Analysis. Concepts and Techniques. Chapter 2. Chapter 2: Getting to Know Your Data. Data Objects and Attribute Types

CONVERGENCE OF THE RATIO OF PERIMETER OF A REGULAR POLYGON TO THE LENGTH OF ITS LONGEST DIAGONAL AS THE NUMBER OF SIDES OF POLYGON INCREASES

( n+1 2 ) , position=(7+1)/2 =4,(median is observation #4) Median=10lb

IMP: Superposer Integrated Morphometrics Package Superposition Tool

INCI 4022 STRUCTURAL ANALYSIS II

Redundancy Allocation for Series Parallel Systems with Multiple Constraints and Sensitivity Analysis

Assignment Problems with fuzzy costs using Ones Assignment Method

9.1. Sequences and Series. Sequences. What you should learn. Why you should learn it. Definition of Sequence

3D Model Retrieval Method Based on Sample Prediction

Convex hull ( 凸殻 ) property

Lecture 18. Optimization in n dimensions

A Polynomial Interval Shortest-Route Algorithm for Acyclic Network

The Counterchanged Crossed Cube Interconnection Network and Its Topology Properties

The Nature of Light. Chapter 22. Geometric Optics Using a Ray Approximation. Ray Approximation

Cubic Polynomial Curves with a Shape Parameter

1.2 Binomial Coefficients and Subsets

Orientation. Orientation 10/28/15

The number n of subintervals times the length h of subintervals gives length of interval (b-a).

Cluster Analysis. Andrew Kusiak Intelligent Systems Laboratory

condition w i B i S maximum u i

Lecture Notes 6 Introduction to algorithm analysis CSS 501 Data Structures and Object-Oriented Programming

AN OPTIMIZATION NETWORK FOR MATRIX INVERSION

Optimized Aperiodic Concentric Ring Arrays

Normals. In OpenGL the normal vector is part of the state Set by glnormal*()

A SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON

Counting Regions in the Plane and More 1

Our Learning Problem, Again

c-dominating Sets for Families of Graphs

BOOLEAN MATHEMATICS: GENERAL THEORY

Performance Plus Software Parameter Definitions

Section 7.2: Direction Fields and Euler s Methods

An Improved Shuffled Frog-Leaping Algorithm for Knapsack Problem

Adaptive Resource Allocation for Electric Environmental Pollution through the Control Network

. Perform a geometric (ray-optics) construction (i.e., draw in the rays on the diagram) to show where the final image is formed.

Intro to Scientific Computing: Solutions

Protected points in ordered trees

EVALUATION OF TRIGONOMETRIC FUNCTIONS

1 Enterprise Modeler

Lower Bounds for Sorting

Apparent Depth. B' l'

Virtual Construction of Human Lung

Sum-connectivity indices of trees and unicyclic graphs of fixed maximum degree

PLEASURE TEST SERIES (XI) - 04 By O.P. Gupta (For stuffs on Math, click at theopgupta.com)

BOOLEAN DIFFERENTIATION EQUATIONS APPLICABLE IN RECONFIGURABLE COMPUTATIONAL MEDIUM

Lecture 1: Introduction and Strassen s Algorithm

Parabolic Path to a Best Best-Fit Line:

Relationship between augmented eccentric connectivity index and some other graph invariants

Intermediate Statistics

Linear Time-Invariant Systems

BASED ON ITERATIVE ERROR-CORRECTION

Creating Exact Bezier Representations of CST Shapes. David D. Marshall. California Polytechnic State University, San Luis Obispo, CA , USA

1. Introduction o Microscopic property responsible for MRI Show and discuss graphics that go from macro to H nucleus with N-S pole

INSCRIBED CIRCLE OF GENERAL SEMI-REGULAR POLYGON AND SOME OF ITS FEATURES

Relay Placement Based on Divide-and-Conquer

Accuracy Improvement in Camera Calibration

Fuzzy Linear Regression Analysis

prerequisites: 6.046, 6.041/2, ability to do proofs Randomized algorithms: make random choices during run. Main benefits:

Throughput-Delay Scaling in Wireless Networks with Constant-Size Packets

FINITE DIFFERENCE TIME DOMAIN METHOD (FDTD)

CSC165H1 Worksheet: Tutorial 8 Algorithm analysis (SOLUTIONS)

Panel Methods : Mini-Lecture. David Willis

Chapter 3 Classification of FFT Processor Algorithms

Copyright 2016 Ramez Elmasri and Shamkant B. Navathe

CSC 220: Computer Organization Unit 11 Basic Computer Organization and Design

6.854J / J Advanced Algorithms Fall 2008

Transcription:

orce Network Aalysis usig Complemetary Eergy Adrew BORGART Assistat Professor Delft Uiversity of Techology Delft, The Netherlads A.Borgart@tudelft.l Yaick LIEM Studet Delft Uiversity of Techology Delft, The Netherlads yaickliem@gmail.com Summary The method preseted solves statically idetermiate force etworks, which are graphical represetatios of forces (force polygos) of a structure, by usig complemetary eergy. Statically idetermiate force etworks, which have odes where four or more members come together, have for each ode multiple possible force polygos that make euilibrium. This holds for force etworks of structures i oe plae, such as trusses, as for geometric three-dimesioal structures, such as shells. I the case of the latter the surface of thrust of the shell is discretized ito a etwork of forces (euivalet to the thrust lie of a arch), with discrete loads at its vertices. Keywords: graphic statics, force etwork aalysis, force desity, statically idetermiate trusses, shell structures ad complemetary eergy.. Itroductio The force path of a applied load o a shell structure is ot easy to determie, because shells are statically idetermiate. This meas that to determie a force etwork for aalysig a shell s structural behaviour several possible load paths have to be cosidered []. The best result is umerous possible states of euilibriums withi the thickess of the shells surface or defied evelope, fig.. By addig to the force etwork aalysis the cocept of duality betwee geometry ad the i-plae iteral forces of etworks, similar to the duality of the force polygo ad form diagram for lie structures (cable ad arch, fig..), it is possible to have a direct graphical relatio betwee the force etwork ad its possible solutios []. However, the exact solutio is ot provided for by this method, because of the highly idetermiate ature of shell structures, which makes it impossible without the fiite elemet method to calculate the correct iteral forces give i a particular situatio. igure.: force polygos ad relatig thrust lies of arch, possible solutios of force etwork for shell structures rom the force etwork for each ode its reciprocal diagram, the force polygo is draw. This force polygo is scaled by keepig the assumed force desity of the ode costat, to fid the force polygo with the lowest complemetary eergy. The result for each ode is assembled to form the force diagram of the etire structure, the reciprocal diagram of the force etwork.

. Complemetary eergy The potetial eergy accumulated i a elastic body is called strai eergy. The area uder the stress-strai curve is the strai eergy (E v ), the area above the curve is the complemetary eergy (E c ) see fig... [3] complemetary eergy is expressed i stresses: σ Ecompl = E the complemetary eergy per uit of bar legth euals: E compl compl σ N = dv = E EA V per bar with leght l: E N = l EA igure.: strai ad complemetary eergy 3. orce etworks for statically idetermiate trusses Trusses are iterally statically determiate if each ode has three members coected to it (threevalet system, fig. 3.). The truss is the etirely composed of triagles. Statically determiate trusses ca be aalysed by usig graphic static, such as Cremoa diagrams. Trusses are iterally statically idetermiate if each ode has four or more members coected to it (four-valet or higher-valet systems, fig. 3.). Statically determiate ad idetermiate trusses ca be aalysed by usig a matrix method such as the direct stiffess method, the flexibility method, the fiite elemet method or by usig complemetary eergy. igure 3.: three- ad four-valet odes ad their respective force polygos ig. 3. shows a example of a statically idetermiate truss. Although it is composed of triagles because i oe ode four forces come together the structure is statically idetermiate. This ca be solved by makig the structure statically determiate by makig the force i a bar redudat (i fig 3.; the ukow statically idetermiateφ ) ad solvig this by miimizig the al complemetary eergy of the structure (fig. 3.3). igure 3.: iterally statically idetermiate truss

N Ecompl = l EA E =, 4, φ+ 3, 6φ E compl, compl. φ 7 = 0 φ= igure 3.3: solvig the statically idetermiateφ from the complemetary eergy of the members or statically idetermiate trusses with umerous bars solvig the therefore eually umerous redudats is umerically somewhat cumbersome. This problem ca also be solved by searchig for a closed force polygo (which is the reciprocal diagram of the topology of the structure, the force etwork) with the lowest al complemetary eergy of the structure. To be able to objectively compare all the possible force polygos with each other, ad thus searchig for solutios with the same magitude of the applied load, the al sum of the force desity of the structure for each solutio has to be kept costat, fig. 3.4. - search for a force polygo with the lowest complemetary eergy: E = l + l + l = miimum compl, 3 = + l l l3 3 3 - by keepig, for each solutio, the al force desity () of the structure costat: + = costat, l 3, l 3, l igure 3.4: miimizig the al complemetary eergy of the structure, the force etwork This procedure ca be doe by usig a computatio tool such as Grasshopper. This was used to solve this example. Because i the force etwork all members have the same properties, whe calculatig the complemetary eergy the stiffess EA is omitted from the euatios. 4. orce etworks for shell structures Shell structures are statically idetermiate, ad thus also their surface of thrust, which is the 3D euivalet of the thrust lie of a arch. A plaar projectio of the surface of thrust gives the force etwork; its reciprocal diagram is the force polygo. We are dealig with a statically idetermiate structure ad the etwork is a four-valet system. irst we will cosider a four-valet force etwork with oly oe ode with a arbitrary load v, fig 4.. l 3 l l 4 l l = l = l 3 = l 4 = 5 igure 4.: oe ode four-valet force etwork

As oted before to objectively compare the possible solutios with the same load, the al force desity of the ode for each solutio has to be kept costat, fig. 4.. 4 4 4 4 = + + + = 3, 5 5 5 5 8 4 8 = + + + = 4 5 5 5 5 4 4 4 4 = + + + = 3, 5 5 5 5, 6 6, 4, 6 6, 4 = + + + = 3, 5 5 5 5 igure 4.: oe ode four-valet force etwork ad possible force polygos

Now for each possible solutio the complemetary eergy is calculated util oe solutio has the miimum complemetary eergy. This ca be doe by scalig the possible force polygos while keepig the force desity for each polygo the same. The scalig of the force polygos ca be easily doe with the followig euatios, by varyig the costat c, fig. 4.3. a ; a b a a = c ( * ) ( ) e= + c c cos α ; e = + c c cosα c δ =δ arcsi si α ; * β =β arcsi siα * e e siδ siβ c = e; d = e siγ siγ b β β β α γ e d δ δ δ c igure 4.3: oe ode four-valet force polygo To summarize the procedure for a oe ode, four-valet or higher-valet, force etwork. - search for the force polygo with the lowest complemetary eergy by keepig, for each solutio, the al force desity costat: compl, i i E = l = miimum i = = l i costat We will ow look at force etworks with multiple odes, such as surfaces of thrust of shell structures. or a force etwork to be i euilibrium with its reactio forces its reciprocal diagram, the force polygo has to have a circumferece which forms a cotiuous lie. If this is ot the case the case the topology of the force etwork does ot represet a force etwork that is physically possible, see broke red lie i fig 4.4. igure 4.4: multiple ode four-valet force etwork ad its reciprocal diagram the force polygo

Whe searchig for the force polygo for a force etwork with multiple odes (the reciprocal diagram) with the least al complemetary eergy of the whole etwork, oly the al sum of the force desities of the boudary (support reactio) members of the etwork has to remai costat for a give load; the referece force desity. The force desities of the itermediate members have o bearig o the solutio, fig 4.5. i,sup ; l i,sup compl,alsys i i E = l = miimum,ref i,sup = = costat l i,sup igure 4.5: multiple ode four-valet force etwork ad boudary braches ad its solutio procedure The procedure to solve a multiple ode, four-valet or higher-valet, force etwork: - geerate a plaar projectio of a proposed discretized surface of thrust; the force etwork or primal grid (the applied loads are discretized as forces actig o the vertices of the discretized surface of thrust), fig. 4.6 - extract relevat iformatio from the primal grid, e.g. legth of member, agle betwee members, member coectivity, to the geerate a reciprocal grid; the force polygos (also see []) with the least al complemetary eergy by keepig the al referece force desity costat (this ca be doe for example by usig a Geeralized Reduced Gradiet (GRG) algorithm), fig 4.7 * search for the force polygo with the lowest complemetary eergy by keepig, for each solutio, the al referece force desity costat: i,sup Ecompl,alsys = i li = miimum,ref = = cos tat l - whe the problem has bee solved the actual force desities ca be determied i all the members, ad thus the correct forces i the members ad the correct reactio forces - geerate the correct discretized 3D surface of thrust by calculatig the z-coordiates of primal grid, usig the (actual) force desities i the members, fig. 4.7 i,sup

igure 4.6: primal grid z ode - euilibrium of iteral forces ad load, calculcatio of z-coordiate to geerate correct discretized surface of thrust (example for ode ): N N N N z z z z z z z z ( ) ( ) ( ) ( ) a m t l 0 + + 4 + z, = 0 la lm lt ll igure 4.7: possible force polygos (reciprocal grids), correct discretized 3D surface of thrust

5. Coclusios By usig complemetary eergy statically idetermiate structures such as trusses ad shell structures ca be easily solved. urther research eeds to be doe for a rigorous mathematical derivatio. Also further physical explaatios eed to be provided for various aspects such as force desity. Never the less the i this paper described method is yet a further step i uderstadig the structural behaviour of shells. Refereces [] O DWYER D., uicular aalysis of masory vaults, Computers & Structures, Vol. 73, No. -5, 999, pp. 87-97 [] BLOCK P., Thrust Network Aalysis, Explorig Three-dimesioal Euilibrium, PhD, MIT, 009. [3] BLAAUWENDRAAD J., Theory of Elasticity, Eergy Priciples ad Variatioal Methods, DUT, 00