Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Lecture

Finite Element Modeling

In course

CIVIL-321: Numerical modelling of solids and structures

La modélisation numérique des solides est abordée à travers la méthode des éléments finis. Les aspects purement analytiques sont d'abord présentés, puis les moyens d'interpolation, d'intégration et de résolution de la mécanique sont étudiés. ...

Description

This lecture covers the derivation of the equation of motion for a mass density, interpolation introduction for finite elements, Newton's equation for continuum mechanics, and the integration for displacement. It also discusses the mass and stiffness matrices, stability of Newmark method, and energy conservation verification. The lecture concludes with the implementation of explicit Newmark scheme and the importance of natural frequencies and mode shapes in structural dynamics.

This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.

Watch on Mediaspace

Instructors (2)

Jean-François Molinari

Professor J.F. Molinari is the director of the Computational Solid Mechanics Laboratory (http://lsms.epfl.ch) at EPFL, Switzerland. He holds an appointment in the Civil Engineering institute, which he directed from 2013 to 2017, and a joint appointment in the Materials Science institute. He started his tenure at EPFL in 2007, and was promoted to Full Professor in 2012. He is currently an elected member of the Research Council of the Swiss National Science Foundation in Division 2 (Mathematics, Natural and Engineering Sciences), and co editor in chief of the journal Mechanics of Materials. J.F. Molinari graduated from Caltech, USA, in 2001, with a M.S. and Ph.D. in Aeronautics. He held professorships in several countries besides Switzerland, including the United States with a position in Mechanical Engineering at the Johns Hopkins University (2000-2006), and France at Ecole Normale Supérieure Cachan in Mechanics (2005-2007), as well as a Teaching Associate position at the Ecole Polytechnique de Paris (2006-2009). The work conducted by Prof. Molinari and his collaborators takes place at the frontier between traditional disciplines and covers several length scales from atomistic to macroscopic scales. Over the years, Professor Molinari and his group have been developing novel multiscale approaches for a seamless coupling across scales. The activities of the laboratory span the domains of damage mechanics of materials and structures, nano- and microstructural mechanical properties, and tribology.

Guillaume Anciaux

Official source

Ontological neighbourhood

Mathematics

Analysis: Numerical analysis

Related concepts (32)

Interpolation

In the mathematical field of numerical analysis, interpolation is a type of estimation, a method of constructing (finding) new data points based on the range of a discrete set of known data points. In engineering and science, one often has a number of data points, obtained by sampling or experimentation, which represent the values of a function for a limited number of values of the independent variable. It is often required to interpolate; that is, estimate the value of that function for an intermediate value of the independent variable.

Multivariate interpolation

In numerical analysis, multivariate interpolation is interpolation on functions of more than one variable (multivariate functions); when the variates are spatial coordinates, it is also known as spatial interpolation. The function to be interpolated is known at given points and the interpolation problem consists of yielding values at arbitrary points . Multivariate interpolation is particularly important in geostatistics, where it is used to create a digital elevation model from a set of points on the Earth's surface (for example, spot heights in a topographic survey or depths in a hydrographic survey).

Polynomial interpolation

In numerical analysis, polynomial interpolation is the interpolation of a given bivariate data set by the polynomial of lowest possible degree that passes through the points of the dataset. Given a set of n + 1 data points , with no two the same, a polynomial function is said to interpolate the data if for each . There is always a unique such polynomial, commonly given by two explicit formulas, the Lagrange polynomials and Newton polynomials.

Bilinear interpolation

In mathematics, bilinear interpolation is a method for interpolating functions of two variables (e.g., x and y) using repeated linear interpolation. It is usually applied to functions sampled on a 2D rectilinear grid, though it can be generalized to functions defined on the vertices of (a mesh of) arbitrary convex quadrilaterals. Bilinear interpolation is performed using linear interpolation first in one direction, and then again in another direction.

Nearest-neighbor interpolation

Nearest-neighbor interpolation (also known as proximal interpolation or, in some contexts, point sampling) is a simple method of multivariate interpolation in one or more dimensions. Interpolation is the problem of approximating the value of a function for a non-given point in some space when given the value of that function in points around (neighboring) that point. The nearest neighbor algorithm selects the value of the nearest point and does not consider the values of neighboring points at all, yielding a piecewise-constant interpolant.

Related lectures (56)

Numerical analysis

Covers advanced numerical analysis topics including deep neural networks and optimization methods.

Quasi-newton optimization

Covers gradient line search methods and optimization techniques with an emphasis on Wolfe conditions and positive definiteness.

Numerical Analysis: Introduction to Computational Methods

Covers the basics of numerical analysis and computational methods using Python, focusing on algorithms and practical applications in mathematics.

Optimization Methods

Covers optimization methods without constraints, including gradient and line search in the quadratic case.

Optimal Control: KKT Conditions