Analysis of Continuous Beams in General

Similar documents
Hermite Splines in Lie Groups as Products of Geodesics

Complex Numbers. Now we also saw that if a and b were both positive then ab = a b. For a second let s forget that restriction and do the following.

AP PHYSICS B 2008 SCORING GUIDELINES

2x x l. Module 3: Element Properties Lecture 4: Lagrange and Serendipity Elements


Module 6: FEM for Plates and Shells Lecture 6: Finite Element Analysis of Shell

For instance, ; the five basic number-sets are increasingly more n A B & B A A = B (1)

3D vector computer graphics

Electrical analysis of light-weight, triangular weave reflector antennas

Pose, Posture, Formation and Contortion in Kinematic Systems

Proper Choice of Data Used for the Estimation of Datum Transformation Parameters

R s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes

LECTURE NOTES Duality Theory, Sensitivity Analysis, and Parametric Programming

Improving Low Density Parity Check Codes Over the Erasure Channel. The Nelder Mead Downhill Simplex Method. Scott Stransky

ROBOT KINEMATICS. ME Robotics ME Robotics

A Binarization Algorithm specialized on Document Images and Photos

Accounting for the Use of Different Length Scale Factors in x, y and z Directions

Lecture #15 Lecture Notes

An Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices

UNIT 2 : INEQUALITIES AND CONVEX SETS

Mathematics 256 a course in differential equations for engineering students

Optimization Methods: Integer Programming Integer Linear Programming 1. Module 7 Lecture Notes 1. Integer Linear Programming

Life Tables (Times) Summary. Sample StatFolio: lifetable times.sgp

S1 Note. Basis functions.

Inverse-Polar Ray Projection for Recovering Projective Transformations

An Approach in Coloring Semi-Regular Tilings on the Hyperbolic Plane

y and the total sum of

The example below contains two doors and no floor level obstacles. Your panel calculator should now look something like this: 2,400

Parallelism for Nested Loops with Non-uniform and Flow Dependences

Support Vector Machines

3D Virtual Eyeglass Frames Modeling from Multiple Camera Image Data Based on the GFFD Deformation Method

GSLM Operations Research II Fall 13/14

TN348: Openlab Module - Colocalization

Modeling of Fillets in Thin-walled Beams Using Shell/Plate and Beam Finite. Elements

Kinematics of pantograph masts

Communication-Minimal Partitioning and Data Alignment for Af"ne Nested Loops

An Optimal Algorithm for Prufer Codes *

LOOP ANALYSIS. The second systematic technique to determine all currents and voltages in a circuit

Programming in Fortran 90 : 2017/2018

A New Approach For the Ranking of Fuzzy Sets With Different Heights

Lecture 5: Multilayer Perceptrons

Outline. Midterm Review. Declaring Variables. Main Variable Data Types. Symbolic Constants. Arithmetic Operators. Midterm Review March 24, 2014

Classifier Selection Based on Data Complexity Measures *

Detection of an Object by using Principal Component Analysis

AMath 483/583 Lecture 21 May 13, Notes: Notes: Jacobi iteration. Notes: Jacobi with OpenMP coarse grain

Problem Definitions and Evaluation Criteria for Computational Expensive Optimization

DESIGN OF A HAPTIC DEVICE FOR EXCAVATOR EQUIPPED WITH CRUSHER

X- Chart Using ANOM Approach

UB at GeoCLEF Department of Geography Abstract

An Entropy-Based Approach to Integrated Information Needs Assessment

c 2009 Society for Industrial and Applied Mathematics

Some material adapted from Mohamed Younis, UMBC CMSC 611 Spr 2003 course slides Some material adapted from Hennessy & Patterson / 2003 Elsevier

A Comparison and Evaluation of Three Different Pose Estimation Algorithms In Detecting Low Texture Manufactured Objects

Ecient Computation of the Most Probable Motion from Fuzzy. Moshe Ben-Ezra Shmuel Peleg Michael Werman. The Hebrew University of Jerusalem

Cluster Analysis of Electrical Behavior

Intra-Parametric Analysis of a Fuzzy MOLP

AVO Modeling of Monochromatic Spherical Waves: Comparison to Band-Limited Waves

Content Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers

Constructing Minimum Connected Dominating Set: Algorithmic approach

SENSITIVITY ANALYSIS IN LINEAR PROGRAMMING USING A CALCULATOR

Subspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points;

A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS

Load Balancing for Hex-Cell Interconnection Network

Smoothing Spline ANOVA for variable screening

Inverse Kinematics (part 2) CSE169: Computer Animation Instructor: Steve Rotenberg UCSD, Spring 2016

Pass by Reference vs. Pass by Value

Kent State University CS 4/ Design and Analysis of Algorithms. Dept. of Math & Computer Science LECT-16. Dynamic Programming

Improvement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration

Signature and Lexicon Pruning Techniques

S.P.H. : A SOLUTION TO AVOID USING EROSION CRITERION?

CMPS 10 Introduction to Computer Science Lecture Notes

Run-Time Operator State Spilling for Memory Intensive Long-Running Queries

Sorting Review. Sorting. Comparison Sorting. CSE 680 Prof. Roger Crawfis. Assumptions

Inverse kinematic Modeling of 3RRR Parallel Robot

arxiv: v3 [physics.soc-ph] 14 Mar 2014

Any Pair of 2D Curves Is Consistent with a 3D Symmetric Interpretation

Math Homotopy Theory Additional notes

Solutions to Programming Assignment Five Interpolation and Numerical Differentiation

CHARUTAR VIDYA MANDAL S SEMCOM Vallabh Vidyanagar

DETC ANALYSIS OF THREE DEGREE OF FREEDOM 6 6 TENSEGRITY PLATFORM

arxiv: v1 [stat.me] 28 Feb 2018

THE design of mechanical systems exploits numerical

cos(a, b) = at b a b. To get a distance measure, subtract the cosine similarity from one. dist(a, b) =1 cos(a, b)

CHAPTER 2 DECOMPOSITION OF GRAPHS

Lecture 15: Memory Hierarchy Optimizations. I. Caches: A Quick Review II. Iteration Space & Loop Transformations III.

WORKSPACE OPTIMIZATION OF ORIENTATIONAL 3-LEGGED UPS PARALLEL PLATFORMS

Line geometry, according to the principles of Grassmann s theory of extensions. By E. Müller in Vienna.

A mathematical programming approach to the analysis, design and scheduling of offshore oilfields

Esc101 Lecture 1 st April, 2008 Generating Permutation

Adaptive Transfer Learning

A Five-Point Subdivision Scheme with Two Parameters and a Four-Point Shape-Preserving Scheme

Medical X-ray Image Classification Using Gabor-Based CS-Local Binary Patterns

Reducing Frame Rate for Object Tracking

Related-Mode Attacks on CTR Encryption Mode

CE 221 Data Structures and Algorithms


An Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation

Loop Permutation. Loop Transformations for Parallelism & Locality. Legality of Loop Interchange. Loop Interchange (cont)

CS240: Programming in C. Lecture 12: Polymorphic Sorting

A Facet Generation Procedure. for solving 0/1 integer programs

Transcription:

Analyss of Contnuous Beams n General Contnuous beams consdered here are prsmatc, rgdly connected to each beam segment and supported at varous ponts along the beam. onts are selected at ponts of support, at any free end, and changes n cross secton occur at support ponts (.e., the beam s prsmatc. A contnuous beam havng m members and m+ jonts s depcted n fgure (a to the left. Support restrants of two types may exst ant any jont n a contnuous beam. These are restrants aganst rotaton and/or restrants aganst translatons. We wll only consder flexural deformatons. Torson and axal dsplacements are not consdered. d Thus only two dsplacements can occur at each jont.

Gven the numberng system n fgure (b the translaton at a partcular jont s numbered pror to a rotaton and t follows that the number of translatons s equal to the number of jonts mnus one, whle the rotaton s twce the jont number. Thus at jont j the translatons and rotaton are number 2j- and 2j respectvely. It s evdent that the total number of possble jont dsplacements s twce the jonts (or 2n j. If the total number of support restrants aganst translaton and rotatons s denoted n r, then the actual degrees of freedom are n 2n j 2m + n 2 r n r Here n s the number of degrees of freedom.

To relate the end dsplacements of a partcular member to the dsplacements of a jont, consder a typcal member n fgure (c below. The member end dsplacements are numbered j, j2, k and k3 and correspond to end dsplacements, 2, 3 and 4 n fgure (b. The new notaton helps facltate computer programmng. The four end dsplacements correspond to the four jont dsplacements as follows: j 2 j k 2 k j2 2 j k2 2k Snce j and k are equal numercally to and d(+, then: j j2 2 2 k k2 2 2 + + 2 Ths ndexng system s necessary to construct the jont stffness matrx [S j ]

The analyss of contnuous beams conssts of establshng the stffness matrx and the load matrx. The most mportant matrx generated s the overall jont stffness matrx [S j ]. The jont stffness matrx conssts of contrbutons from the beam stffness matrx [S m ]. It s convenent to assess the contrbutons for one typcal member and repeat the process for members through m. So the next step nvolves expressng the stffness coeffcents shown n the fgure to the left n terms of the varous member stffnesses the contrbute to the jont stffnesses.

Ths next step requres that the member stffnesses be obtaned from the matrx below: For example the contrbuton to the jont stffness (S j j, j from member - s the stffness S m33 for that member. Smlarly, the contrbuton to (S j j,j from member s the stffneess S m from member

In general the contrbuton of one member to a partcular jont stffness wll be denoted by appendng the member subscrpt to the member stffness tself. From ths dscusson one can see that the jont stffness matrx coeffcents are generated by the followng expressons: ( j j M 33 + S, M + j 2, j M 43 k, j M 3 M 4 k 2, j M 2 whch represent the transfer of elements of the frst column of the member stffness matrx [S m ]to the approprate p locaton n the jont stffness matrx [S j ]

Expressons analogous to the prevous expressons are easly obtaned for a unt rotaton about the z axs at jont j: ( j j M 34 + S, 2 M 2 + j 2, j 2 M 44 k, j 2 M 32 M 42 k 2, j 2 M 22 Expressons analogous to a unt y dsplacement at jont k are: 3 j, k 2 M j 2, k M 23 + k, k M 33 M + M 43 + M 2 + k 2, k

Fnally the expressons for a unt z rotaton at jont k are: 4 j, k 2 M j 2, k 2 M 24 (, M 34 + S k k M 2 + M 44 + M 22 + k 2, k 2 The last 4 sets of equatons show that the sxteen elements of the 4x4 member stffness matrx [S M ] for member I contrbute to the sxteen of the stffness matrx [S ] coeffcents n a very regular pattern. Ths pattern can be observed n the fgure on the next overhead.

For ths structure the number of jonts s seven, the number of possble jont dsplacements s fourteen, and the jont stffness matrx [S ] s dmensonally 4x4. The ndexng scheme s shown down the left hand edge and across the top. The contrbutons of ndvdual members are ndcated n the hatched block., each of whch s dmensonally 4x4. The blocks are numbered n the upper rght corner to ndcated the member assocated wth the block. The overlappng blocks are dmensonally 2x2 and denote elements that receve contrbutons from adjacent members.

Suppose that the actual beam has smple supports at all the jonts as ndcated n the fgure below. The rearranged and parttoned jont stffness matrx s shown at the lower rght. To obtan ths rearranged matrx, rows and columns of the orgnal matrx have been swtched n proper sequence n order t place the stffnesses pertanng to the actual degrees of freedom n the frst seven rows and columns. As an ad n the rearrangng process, the new row and column desgnatons are lsted n the prevous fgure for the matrx along the rght hand sde and across the bottom. The rearrangng process s consstent wth the numberng system n the fgure above.

In summary, the procedure followed n generatng the jont stffness matrx [S ] conssts of takng the members n sequence and evaluatng ther contrbutons one at a tme. Then the stffness matrx [S M ] s generated, and the elements of ths matrx are transferred to the [S ] as ndcated n the prevous overheads. After all members have been processed n ths manner, the [S ] matrx s complete. Ths matrx can be rearranged and parttoned n order to solate the [S] matrx. The nverse of ths matrx s then determned and the unknown dsplacements are computed.