You are on page 1of 2

TAM 470 / CSE 450: COMPUTATIONAL MECHANICS Fall 2008; 1:00 MWF; 243 MEB Prerequisites: {MATH 385,

MATH 386, or MATH 441}; CS 101 Course web site: Prof. Haber, 2101A MEL, 333-3826, Objectives: This course provides a survey of numerical methods and applications in computational mechanics; we focus on methods to construct approximate solutions to the ordinary and partial dierential equations that arise in continuum mechanics. We rst introduce a toolkit of basic methods for interpolation, dierentiation and integration. We use these to develop the two most widely-used numerical methods in computational mechanics: the nite dierence and nite element methods. The course material will be developed with formulation, applications and programming exercises. Oce hours: MWF 2-3:00 PM, or by appointment.

Course Web Site You can access general information about the course, download lecture notes, etc. at the TAM 470 web site (URL appears above). Text: Parvis Moin, Fundamentals of Engineering Numerical Analysis, Cambridge University Press, 2001. I will post additional notes on the course web site for you to download. Student Responsibilities: Your course grade will be based on your performance on homework, two hour exams, and a nal exam. The exams will be open book. The course grade will be determined as follows. Homework Hour exams (2) FInal exams 50% 30% 20%

The homework assignments will include programming exercises and will be due roughly every other week, as listed on the syllabus. Students may choose to use any appropriate programming language for the homework assignments. There will be extra or extended homework problems assigned for students registered for 4 credit hours. Reference Material and Resources: R. D. Cook, D. S. Malkus, M. E. Plesha, and R. J. Witt, Concepts and Applications of Finite Element Analysis, 4th Edition, Wiley, 2002. O. C. Zienkiewicz and R. L. Taylor, The Finite Element Method, Vols. 1-3, 5th Edition, ButterworthHeinemann, 2000. T.J.R. Hughes, The Finite Element Method, PrenticeHall, 1987. Claes Johnson, Numerical Solution of Partial Dierential Equations by the Finite Element Method, 2nd Edition, Cambridge University Press, 1987. (Out of Print) K. Ericsson, D. Estep, P. Hansbo and C. Johnson, Computational Dierential Equations, Cambridge University Press, 1996. S. C. Brenner and L. R. Scott, The Mathematical Theory of Finite Element Methods, Springer-Verlag, 1994. W. H. Press (Ed.), Numerical Recipes, (Fortran, C or C++), Cambridge University Press. Software: MATLAB, Mathematica, Maple, etc.

SYLLABUS & SCHEDULE TAM 470, Fall 2008, MWF 1:00, 243 MEB, Prof. Haber Date M 8/25 W 8/27 F 8/28 M 9/1 W 9/3 F 9/5 M 9/8 W 9/10 F 9/12 M 9/15 W 9/17 F 9/19 M 9/22 W 9/24 F 9/26 M 9/29 W 10/1 F 10/3 M 10//6 W 10/8 F 10/10 M 10/13 W 10/15 F 10/17 M 10/20 W 10/22 F 10/24 M 10/27 W 10/29 F 10/31 Su. 11/2 M 11/3 W 11/5 F 11/7 M 11/10 W 11/12 F 11/14 M 11/17 W 11/19 F 11/21 11/2211/30 M 12/1 W 12/3 F 12/5 M 12/8 W 12/10 F 12/12 Topic INTRODUCTION: Organization and objectives REVIEW OF LINEAR ALGEBRA NUMERICAL TOOLKIT: Interpolation: Lagrange polynomials LABOR DAY FEM basis functions Interpolation on simplices cubic splines Numerical dierentiation: Finite dierence; accuracy Optimal dierence schemes Pade approximation, non-uniform grids Dierentiation of interpolations Numerical integration: Trap. & Simpsons rules; accuracy Gauss Quadrature - 1D, Product domains Integration on simplices NUM. SOLUTION OF ODEs: Forward Euler Backward Euler; trapezoidal method; Linearization Runge-Kutta; multi-step methods Systems of 1st-order ODEs HOUR EXAM I NUM. SOLUTION OF PDEs I: Finite dierences: BVPs Semi-discretization von Neumann stability analysis Wavenumber analysis Implicit time marching; accuracy (skip Du Fort-Frankel) Multi-dimensions, explicit methods Implicit methods in higher dimensions Approximate factorization: stability Elliptic PDEs and iterative methods Point Jacobi; Gauss Seidel Successive over relaxation: STANDARD TIME BEGINS NUM. SOLUTION OF PDEs II: Finite element method: Math prelims. Elliptic problems ... Galerkin projections: Method of Weighted Residuals HOUR EXAM II Ritz method Finite element discretization Error equation and error analysis FALL BREAK Algorithms: Quadrature; element and global assembly Isoparametric elements Adaptive analysis Parabolic problems Semidiscretization and time marching FINAL EXAM 1:30-4:30 PM. Location TBA Set 7 notes Set 5 Set 6 Reading App. A 1.1 notes 1.2 2.1 2.2, 2.3 2.4, 2.5, notes notes 3.1-3.4 3.5, 3.6 notes 4.14.3 4.44.7 4.8,4.9 4.10 4.11 5.1 5.2 5.3 5.4, 5.5 5.7 5.8 5.9 5.10.2, 5.10.3 HW due Set 1 Set 2 Set 3 Set 4