90 likes | 266 Vues
This lecture provides an in-depth exploration of the generalization of the 1D finite element method. Key topics include the strong formulation and the weak formulation, detailing how to derive each. The session also covers the discretization process of finite element methods, showcasing exemplary shape functions for two finite elements over the interval [0, l]. Additionally, attendees will learn about the composition of global shape functions from local ones and how the transition from finite differences to finite elements affects local systems of equations.
E N D
Graph grammarand algorithmic transformations Lecture topics: Generalization to 1D finite element method
GENERALIZATION TO 1D FINITE ELEMENT METHOD Strong formulation Find such that Weak formulation Find such that
GENERALIZATION TO 1D FINITE ELEMENT METHOD Finite element method disretization Exemplary shape functions for [0,l] = [0,1], for two finite elements
GENERALIZATION TO 1D FINITE ELEMENT METHOD Exemplary shape functions for [0,l] = [0,1], for two finite elements
GENERALIZATION TO 1D FINITE ELEMENT METHOD Exemplary shape functions for [0,l] = [0,1], for two finite elements
GENERALIZATION TO 1D FINITE ELEMENT METHOD Global shape functionsare composed with local shape functions, e.g. Local system of equations generated over the element K
GENERALIZATION TO 1D FINITE ELEMENT METHOD Notice that when we switch from finite difference to finite elements, it only changes the local systems of equations at tree nodes
GENERALIZATION TO 1D FINITE ELEMENT METHOD Notice that when we switch from finite difference to finite elements, it only changes the local systems of equations at tree nodes