Lecture

Nonlinear Truss System Analysis

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

In course

CIVIL-449: Nonlinear analysis of structures

This course deals with nonlinear modelling of structures under mechanical loading. ...

Description

This lecture covers the nonlinear analysis of structures, focusing on computing the force-displacement response of a truss system with inelastic material properties. The event-to-event principle is used to identify state changes in bars from elastic to plastic, allowing for piecewise linear force-displacement responses. The lecture discusses the step-by-step analysis strategy, including applying displacements, determining yielding parameters, and calculating resisting forces. Various solution algorithms, such as Newton-Raphson, are illustrated with examples. The importance of convergence criteria and modified algorithms is highlighted. References to course materials and assignments are provided for further study.

Instructors (3)

Katrin Beyer

Since 2017 Associate Professor, School of Architecture, Civil and Environmental Engineering (ENAC), EPFL. Head of the Earthquake Engineering and Structural Dynamics (EESD) Laboratory 2010-2017 Assistant Professor, EPFL. 2008-2010 Post-doctoral researcher, ETH Zürich. 2003-2007 Ph.D., Roseschool / Università di Pavia, Italy. 2001-2003 Ove Arup & Partners, Advanced Technology and Research Group, London. 2001 Diploma, Civil engineering, ETH Zürich.

Dimitrios Lignos

Prof. Lignos joined the École Polytechnique Féderale de Lausanne (EPFL) in 2016 from McGill University in Canada where he was a tenured Associate Professor and a William Dawson Scholar for Infrastructure Resilience. He holds a diploma (National Technical University of Athens, NTUA, 2003), M.S. (Stanford University, 2004) and Ph.D. (Stanford University, 2008). In addition, he was a post-doctoral scientist at Stanford University (2009) and in Kyoto University (2010). Prof. Lignos teaches graduate and undergraduate courses in seismic design, nonlinear behaviour of steel and composite structures as well as supplemental damping systems, Structural Stability, Nonlinear Analysis and Performance-based Earthquake Engineering. His awards for teaching, research and service in Civil Engineering include the 2011 Outstanding Teaching Award (Faculty of Engineering, McGill University), as well as the Outstanding reviewer (2012, 2013) award from ASCE, the 2013 State-of-the-Art in Civil Engineering Award by ASCE and the 2014 Christophe Pierre Award for Research Excellence - Early Career. Just recently, he received the 2019 Walter L. Huber Civil Engineering Research Prize from ASCE for significant contributions in developing state of the art methods to simulate extreme limit states in steel structures.Prof. Lignos is a member of ASCE and the Earthquake Engineering Research Institute. He acts as an Associate Editor for Metal Structures and Seismic Effects of the ASCE Journal of Structural Engineering. He joined the Editorial Board of Earthquake Spectra and Earthquake Engineering and Structural Dynamics International journals. He serves as an acting member of the CEN/TC 250/SC 8/WG 2 and has been selected as a member of the Project Team (PT2) for the Eurocode 8-Part 1 Current Revisions for Steel and Composite Structures. He is also a member of the Canadian Standards Association (CSA) S16 technical committee for Steel Structures. Prof. Lignos is involved as a NEHRP consultant in numerous research-to-practice projects related to the behaviour and nonlinear modelling and analysis of structures applicable to the engineering practice through the Applied Technology Council (ATC). Detailed Curriculum Vitae (last update September 2018)

Official source

Related concepts (32)

Sorting algorithm

In computer science, a sorting algorithm is an algorithm that puts elements of a list into an order. The most frequently used orders are numerical order and lexicographical order, and either ascending or descending. Efficient sorting is important for optimizing the efficiency of other algorithms (such as search and merge algorithms) that require input data to be in sorted lists. Sorting is also often useful for canonicalizing data and for producing human-readable output.

Genetic algorithm

In computer science and operations research, a genetic algorithm (GA) is a metaheuristic inspired by the process of natural selection that belongs to the larger class of evolutionary algorithms (EA). Genetic algorithms are commonly used to generate high-quality solutions to optimization and search problems by relying on biologically inspired operators such as mutation, crossover and selection. Some examples of GA applications include optimizing decision trees for better performance, solving sudoku puzzles, hyperparameter optimization, causal inference, etc.

In-place algorithm

In computer science, an in-place algorithm is an algorithm that operates directly on the input data structure without requiring extra space proportional to the input size. In other words, it modifies the input in place, without creating a separate copy of the data structure. An algorithm which is not in-place is sometimes called not-in-place or out-of-place. In-place can have slightly different meanings. In its strictest form, the algorithm can only have a constant amount of extra space, counting everything including function calls and pointers.

Computer file

In computing, a computer file is a resource for recording data on a computer storage device, primarily identified by its . Just as words can be written on paper, so can data be written to a computer file. Files can be shared with and transferred between computers and mobile devices via removable media, networks, or the Internet. Different are designed for different purposes. A file may be designed to store an , a written message, a video, a program, or any wide variety of other kinds of data.

Approximation algorithm

In computer science and operations research, approximation algorithms are efficient algorithms that find approximate solutions to optimization problems (in particular NP-hard problems) with provable guarantees on the distance of the returned solution to the optimal one. Approximation algorithms naturally arise in the field of theoretical computer science as a consequence of the widely believed P ≠ NP conjecture. Under this conjecture, a wide class of optimization problems cannot be solved exactly in polynomial time.

Related lectures (64)

Matlab: Interactive Mode and Project Steps

Introduces Matlab basics, error handling, and billiards project concepts.

Matlab Programming: Script and Function

Explores Matlab programming with scripts and functions, vectorization, and 2D graphics.

Statistical Signal Processing

Covers Gaussian Mixture Models, Denoising, Data Classification, and Spike Sorting using Principal Component Analysis.

Matlab: 3D Surface Plotting

Covers logical arrays, 3D surface plotting, parametric curves, interpolation, and fitting in Matlab.

Introduction to MATLAB Tools and Installation