Lecture

Finite Element Simulation

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

ME-373: Finite element modelling and simulation

L'objectif de ce cours est d'apprendre à réaliser de manière rigoureuse et critique des analyses par éléments finis de problèmes concrets en mécanique des solides à l'aide d'un logiciel CAE moderne. ...

Description

This lecture covers the basics of finite element simulation, focusing on the choice of element types and convergence. It includes a detailed explanation of the approximations in FE models, h-refinement, p-refinement, and the accuracy/computational cost tradeoff. The instructor discusses methods for conducting a mesh convergence study and explains the importance of local mesh refinement. Practical examples and convergence graphs for 2D and 3D elements are also presented.

Instructor

Edouard Boujo

Official source

Related concepts (31)

Finite element machine

The Finite Element Machine (FEM) was a late 1970s-early 1980s NASA project to build and evaluate the performance of a parallel computer for structural analysis. The FEM was completed and successfully tested at the NASA Langley Research Center in Hampton, Virginia. The motivation for FEM arose from the merger of two concepts: the finite element method of structural analysis and the introduction of relatively low-cost microprocessors.

Finite element method

The finite element method (FEM) is a popular method for numerically solving differential equations arising in engineering and mathematical modeling. Typical problem areas of interest include the traditional fields of structural analysis, heat transfer, fluid flow, mass transport, and electromagnetic potential. The FEM is a general numerical method for solving partial differential equations in two or three space variables (i.e., some boundary value problems).

Discrete element method

A discrete element method (DEM), also called a distinct element method, is any of a family of numerical methods for computing the motion and effect of a large number of small particles. Though DEM is very closely related to molecular dynamics, the method is generally distinguished by its inclusion of rotational degrees-of-freedom as well as stateful contact and often complicated geometries (including polyhedra). With advances in computing power and numerical algorithms for nearest neighbor sorting, it has become possible to numerically simulate millions of particles on a single processor.

Mesh generation

Mesh generation is the practice of creating a mesh, a subdivision of a continuous geometric space into discrete geometric and topological cells. Often these cells form a simplicial complex. Usually the cells partition the geometric input domain. Mesh cells are used as discrete local approximations of the larger domain. Meshes are created by computer algorithms, often with human guidance through a GUI , depending on the complexity of the domain and the type of mesh desired.

Delaunay refinement

In mesh generation, Delaunay refinements are algorithms for mesh generation based on the principle of adding Steiner points to the geometry of an input to be meshed, in a way that causes the Delaunay triangulation or constrained Delaunay triangulation of the augmented input to meet the quality requirements of the meshing application. Delaunay refinement methods include methods by Chew and by Ruppert. Chew's second algorithm takes a piecewise linear system (PLS) and returns a constrained Delaunay triangulation of only quality triangles where quality is defined by the minimum angle in a triangle.

Related lectures (64)

Algorithms in Computer Science: Search and Sort Techniques

Provides an overview of essential search and sort algorithms in computer science.

Convergence & Choice of Finite Element Discretizations

Explores convergence, numerical pathologies, and mesh convergence studies in finite element discretizations.

Reservoirs and Dams: Hydraulic Construction and Sizing

Explores sizing reservoirs and dams using cumulative flow curves and tank dimensioning for dry and rainy periods.

Excel Data Analysis and Forecasting

Covers the basics of Excel data analysis and forecasting techniques.

Big Data: Best Practices and Guidelines