Structure of global stiffness matrix Global stiffness matrix K is completed by additions from element matrices, as described in detail in the illustrative.

Slides:



Advertisements
Similar presentations
Lecture 6; The Finite Element Method 1-dimensional spring systems (modified ) 1 Lecture 6; The Finite Element Method 1-dimensional spring systems.
Advertisements

Linear Algebra Applications in Matlab ME 303. Special Characters and Matlab Functions.
1D MODELS Logan; chapter 2.
B.Macukow 1 Lecture 12 Neural Networks. B.Macukow 2 Neural Networks for Matrix Algebra Problems.
Operations Research Assignment Problem.
1 Copyright © 2015, 2011, 2007 Pearson Education, Inc. Chapter 4-1 Systems of Equations and Inequalities Chapter 4.
Mathematics. Matrices and Determinants-1 Session.
Special Matrices and Gauss-Siedel
1 Systems of Linear Equations (Optional) Special Matrices.
Arithmetic Operations on Matrices. 1. Definition of Matrix 2. Column, Row and Square Matrix 3. Addition and Subtraction of Matrices 4. Multiplying Row.
Fundamentals of matrices
MANE 4240 & CIVL 4240 Introduction to Finite Elements
Row 1 Row 2 Row 3 Row m Column 1Column 2Column 3 Column 4.
Plate and shell elements All the following elements enable to create FE mesh of a thin-walled body, with the thickness being one of the important input.
4.2 Operations with Matrices Scalar multiplication.
System of Linear Equations Nattee Niparnan. LINEAR EQUATIONS.
Barnett/Ziegler/Byleen Finite Mathematics 11e1 Review for Chapter 4 Important Terms, Symbols, Concepts 4.1. Systems of Linear Equations in Two Variables.
Chapter 4 Matrices By: Matt Raimondi.
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 Chapter 11.
Row 1 Row 2 Row 3 Row m Column 1Column 2Column 3 Column 4.
Copyright © 2013, 2009, 2005 Pearson Education, Inc. 1 5 Systems and Matrices Copyright © 2013, 2009, 2005 Pearson Education, Inc.
Unit 6 : Matrices.
Linear Systems and Augmented Matrices. What is an augmented matrix?  An augmented matrix is essentially two matrices put together.  In the case of a.
If A and B are both m × n matrices then the sum of A and B, denoted A + B, is a matrix obtained by adding corresponding elements of A and B. add these.
Convergence and error estimation Convergence means that for increasing density of meshes, the FE numerical solution should come closer to the appropriate.
11/11/20151 Trusses. 11/11/20152 Element Formulation by Virtual Work u Use virtual work to derive element stiffness matrix based on assumed displacements.
Class Opener:. Identifying Matrices Student Check:
THE ANALYSIS OF BEAMS & FRAMES
Illustration of FE algorithm on the example of 1D problem Problem: Stress and displacement analysis of a one-dimensional bar, loaded only by its own weight,
Relations, Functions, and Matrices Mathematical Structures for Computer Science Chapter 4 Copyright © 2006 W.H. Freeman & Co.MSCS Slides Relations, Functions.
4.5 Inverse of a Square Matrix
BAR ELEMENT IN 2D (TRUSS, LINK)
3.6 Solving Systems Using Matrices You can use a matrix to represent and solve a system of equations without writing the variables. A matrix is a rectangular.
Chapter 7 Finite element programming May 17, 2011.
MT411 Robotic Engineering Asian Institution of Technology (AIT) Chapter 1 Introduction to Matrix Narong Aphiratsakun, D.Eng.
Linear solid elements in 2D and 3D By the term ”linear element” we mean here the elements with linear approximation of displacement and constant stress/strain.
TH EDITION LIAL HORNSBY SCHNEIDER COLLEGE ALGEBRA.
Matrices and Matrix Operations. Matrices An m×n matrix A is a rectangular array of mn real numbers arranged in m horizontal rows and n vertical columns.
MATRIX A set of numbers arranged in rows and columns enclosed in round or square brackets is called a matrix. The order of a matrix gives the number of.
2.5 – Determinants and Multiplicative Inverses of Matrices.
 Recall that when you wanted to solve a system of equations, you used to use two different methods.  Substitution Method  Addition Method.
LEARNING OUTCOMES At the end of this topic, student should be able to :  D efination of matrix  Identify the different types of matrices such as rectangular,
Do Now: Perform the indicated operation. 1.). Algebra II Elements 11.1: Matrix Operations HW: HW: p.590 (16-36 even, 37, 44, 46)
Chapter 5: Matrices and Determinants Section 5.5: Augmented Matrix Solutions.
4.1 An Introduction to Matrices Katie Montella Mod. 6 5/25/07.
If A and B are both m × n matrices then the sum of A and B, denoted A + B, is a matrix obtained by adding corresponding elements of A and B. add these.
Chapter 8: Lesson 8.1 Matrices & Systems of Equations
Matrix Operations SpringSemester 2017.
CHAPTER 9: GAUSSIAN ELIMINATION.
Chapter 6 Direct Methods for Solving Linear Systems
PRINCIPLES OF STIFFNESS METHOD FOR BEAMS AND PLANE FRAMES
CHAPTER 2 BASIC CONCEPTS OF DISPLACEMENT OR STIFFNESS METHOD:
4-2 Adding & Subtracting Matrices
Lecture 11 Matrices and Linear Algebra with MATLAB
Chapter 4 Systems of Linear Equations; Matrices
DIRECT STIFFNESS METHOD FOR TRUSSES:
Numerical Analysis Lecture14.
Determinant of a Matrix
Linear Algebra Lecture 18.
3.6 Multiply Matrices.
Chapter 4 Systems of Linear Equations; Matrices
Chapter 4 Matrices & Determinants
1.8 Matrices.
Matrix Operations SpringSemester 2017.
Matrix A matrix is a rectangular arrangement of numbers in rows and columns Each number in a matrix is called an Element. The dimensions of a matrix are.
Chapter 11 Chapter 11.
1.8 Matrices.
3.5 Perform Basic Matrix Operations Algebra II.
Matrix Multiplication Sec. 4.2
THE SIMPLEX ALGORITHM Step 1
Presentation transcript:

Structure of global stiffness matrix Global stiffness matrix K is completed by additions from element matrices, as described in detail in the illustrative example of FE algorithm. For large and complicated structures, this addition can be made in different ways and is connected with the node numbering of the mesh. We shall present this on the example of a four-element plane triangular mesh according to Fig.7-1.FE algorithm Fig.7-1 Different node numbering of triangular mesh Global matrix of deformation parameters The first element of 7-1a) mesh contains the deformation parameters u 1, v 1, u 2, v 2, u 4, v 4. They occupy the position no. 1,2,3,4,7 and 8 in the global matrix U. This means, that the element stiffness matrix of the first element will be distributed into the rows and columns no.1,2,3,4,7 and 8 of the global matrix K :

Adding the element matrices of all the four elements into the global matrix according to the algorithm described in Chapter 2, we obtain finally the following structure of K matrix: Again, we can see the banded structure of K matrix, quantified here by so called bandwidth, which is the distance of the most distant non zero element among all rows from the diagonal. In this example, the bandwidth is equal to 8.

We can now repeat the whole procedure for the mesh, numbered according to Fig.8- 1b). It is easy to show, that the K matrix now has the most compact form with the bandwidth equal to six: So the mesh numbering has an influence on the K matrix structure and this is important for the time necessary for solution of the basic equation K.U = F : solution time ≈ (number of unknowns). (bandwidth) 2