Lecture

Deformation Analysis in Elastic Solids

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

CS-457: Geometric computing

This course will cover mathematical concepts and efficient numerical methods for geometric computing. We will explore the beauty of geometry and develop algorithms to simulate and optimize 2D and 3D geometric models with an emphasis towards computational d ...

Description

This lecture covers the manipulation of 3D arrays with Numpy, implementing barycenters and shape matrices in elastic solids, and deriving the volume of tetrahedrons. It also explores the Jacobians, eigendecomposition of the metric tensor, and visualization techniques.

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

Instructor

Mark Pauly

Mark Pauly is a full professor at the School of Computer and Communication Sciences at EPFL. Prior to joining EPFL, he was assistant professor at the CS department of ETH Zurich since April 2005. From August 2003 to March 2005 he was a postdoctoral scholar at Stanford University, where he also held a position as visiting assistant professor during the summer of 2005. He received his Ph.D. degree (with distinction) in 2003 from ETH Zurich and his M.S. degree (with highest honors) in 1999 from TU Kaiserslautern. His research interests include computer graphics and animation, shape modeling and analysis, geometry processing, architectural geometry, and digital fabrication. He received the ETH medal for outstanding dissertation, was awarded the Eurographics Young Researcher Award in 2006 and the Eurographics Outstanding Technical Contributions Award in 2016.

Official source

Ontological neighbourhood

Mathematics

Algebra: Linear algebra

Related concepts (32)

Tetrahedron

In geometry, a tetrahedron (plural: tetrahedra or tetrahedrons), also known as a triangular pyramid, is a polyhedron composed of four triangular faces, six straight edges, and four vertex corners. The tetrahedron is the simplest of all the ordinary convex polyhedra. The tetrahedron is the three-dimensional case of the more general concept of a Euclidean simplex, and may thus also be called a 3-simplex. The tetrahedron is one kind of pyramid, which is a polyhedron with a flat polygon base and triangular faces connecting the base to a common point.

Eigendecomposition of a matrix

In linear algebra, eigendecomposition is the factorization of a matrix into a canonical form, whereby the matrix is represented in terms of its eigenvalues and eigenvectors. Only diagonalizable matrices can be factorized in this way. When the matrix being factorized is a normal or real symmetric matrix, the decomposition is called "spectral decomposition", derived from the spectral theorem. Eigenvalue, eigenvector and eigenspace A (nonzero) vector v of dimension N is an eigenvector of a square N × N matrix A if it satisfies a linear equation of the form for some scalar λ.

Triakis tetrahedron

In geometry, a triakis tetrahedron (or kistetrahedron) is a Catalan solid with 12 faces. Each Catalan solid is the dual of an Archimedean solid. The dual of the triakis tetrahedron is the truncated tetrahedron. The triakis tetrahedron can be seen as a tetrahedron with a triangular pyramid added to each face; that is, it is the Kleetope of the tetrahedron. It is very similar to the net for the 5-cell, as the net for a tetrahedron is a triangle with other triangles added to each edge, the net for the 5-cell a tetrahedron with pyramids attached to each face.

Matrix decomposition

In the mathematical discipline of linear algebra, a matrix decomposition or matrix factorization is a factorization of a matrix into a product of matrices. There are many different matrix decompositions; each finds use among a particular class of problems. In numerical analysis, different decompositions are used to implement efficient matrix algorithms. For instance, when solving a system of linear equations , the matrix A can be decomposed via the LU decomposition.

Truncated tetrahedron

In geometry, the truncated tetrahedron is an Archimedean solid. It has 4 regular hexagonal faces, 4 equilateral triangle faces, 12 vertices and 18 edges (of two types). It can be constructed by truncating all 4 vertices of a regular tetrahedron at one third of the original edge length. A deeper truncation, removing a tetrahedron of half the original edge length from each vertex, is called rectification. The rectification of a tetrahedron produces an octahedron.

Related lectures (64)

Characteristic Polynomials and Similar Matrices

Explores characteristic polynomials, similarity of matrices, and eigenvalues in linear transformations.

Linear Algebra Basics

Covers fundamental concepts in linear algebra, including linear equations, matrix operations, determinants, and vector spaces.

Linear Algebra: Matrices Properties

Explores properties of 3x3 matrices with real coefficients and determinant calculation methods.

Diagonalization of Linear Transformations

Covers the diagonalization of linear transformations in R^3, exploring properties and examples.

Linear Algebra: Matrices and Linear Applications