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: http://www.mechse.uiuc.edu/courses/TAM470 Prof. Haber, 2101A MEL, 333-3826, r-haber@illinois.edu

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 differential equations that arise in continuum mechanics. We first introduce a toolkit of basic methods for interpolation, differentiation and integration. We use these to develop the two most widely-used numerical methods in computational mechanics: the finite difference and finite element methods. The course material will be developed with formulation, applications and programming exercises.

Office hours:

MWF 2-3:00 PM, or by appointment.

Course Web Site

470 web site (URL appears above).

You can access general information about the course, download lecture notes, etc. at the TAM

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:

and a final exam. The exams will be ”open book”. The course grade will be determined as follows.

Your course grade will be based on your performance on homework, two hour exams,

Homework 50%

Hour exams (2)

30%

FInal exams

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 Differential 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 Differential 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

 

Topic

Reading

HW due

M

8/25

INTRODUCTION: Organization and objectives

W

8/27

REVIEW OF LINEAR ALGEBRA NUMERICAL TOOLKIT:

App. A

F

8/28

Interpolation: Lagrange polynomials

1.1

M

9/1

LABOR DAY

 

W

9/3

FEM basis functions

notes

F

9/5

Interpolation on simplices

M

9/8

cubic splines

1.2

W

9/10

Numerical differentiation: Finite difference; accuracy

2.1

F

9/12

Optimal difference schemes

2.2, 2.3

Set 1

M

9/15

Pade approximation, non-uniform grids

2.4, 2.5, notes notes

W

9/17

Differentiation of interpolations

F

9/19

Numerical integration: Trap. & Simpsons rules; accuracy

3.1-3.4

M

9/22

Gauss Quadrature - 1D, Product domains

3.5, 3.6

W

9/24

Integration on simplices

notes

F

9/26

NUM. SOLUTION OF ODEs: Forward Euler

4.1–4.3

Set 2

M

9/29

Backward Euler; trapezoidal method; Linearization

4.4–4.7

W

10/1

Runge-Kutta; multi-step methods

4.8,4.9

F

10/3

Systems of 1st-order ODEs

4.10

M

10//6

HOUR EXAM I

W

10/8

NUM. SOLUTION OF PDEs I: Finite differences: BVPs

4.11

F

10/10

Semi-discretization

5.1

Set 3

M

10/13

von Neumann stability analysis

5.2

W

10/15

Wavenumber analysis

5.3

F

10/17

Implicit time marching; accuracy (skip Du Fort-Frankel)

5.4, 5.5

M

10/20

Multi-dimensions, explicit methods

5.7

W

10/22

Implicit methods in higher dimensions

5.8

F

10/24

Approximate factorization: stability

5.9

Set 4

M

10/27

Elliptic PDEs and iterative methods

5.10–5.10.1

W

10/29

Point Jacobi; Gauss Seidel

5.10.2, 5.10.3

F

10/31

Successive over relaxation:

5.10.4–5.10.5

Su. 11/2

STANDARD TIME BEGINS

 

M

11/3

NUM. SOLUTION OF PDEs II: Finite element method:

notes

W

11/5

Math prelims.

F

11/7

Elliptic problems

Set 5

M

11/10

.

.

.

W

11/12

Galerkin projections: Method of Weighted Residuals

F

11/14

HOUR EXAM II

M

11/17

Ritz method

W

11/19

Finite element discretization

F

11/21

Error equation and error analysis

Set 6

11/22–11/30

FALL BREAK

 

M

12/1

Algorithms: Quadrature; element and global assembly

W

12/3

Isoparametric elements

F

12/5

Adaptive analysis

M

12/8

Parabolic problems

W

12/10

Semidiscretization and time marching

Set 7

F

12/12

FINAL EXAM 1:30-4:30 PM. Location TBA