CPS296.1 Fall 2004

Mathematical Modeling of Continuous Systems

This course is a tour through fundamental mathematical techniques used to model continuous objects and events, both deterministic and random, in the physical world. It was originally conceived as a preparation for courses in artificial intelligence, robotics, and computer vision, but has turned out to be useful also to students in several disciplines of engineering and the biological sciences, and in general to anyone who wants to develop a firm intuitive understanding of the most applicable aspects of continuous mathematics.

This course emphasizes the geometric, physical, and intuitive meaning of the various concepts over the details of formal proofs. Classical numerical algorithms are viewed as black boxes, rather than by attempting to describe the details of how they work. For instance, you may already have seen the definition of eigenvalue, and know how to compute the eigenvalues of a matrix A. (Hint: type eig(A) in Matlab. This is all we will study about the algorithm). However, what matters to users is the concept itself: what an eigenvalue is, geometrically and physically, why it is important, and what you can do with it. Once you know this, you will also know why the basic algorithms for computing eigenvalues work, when they succeed and fail, and how you can tell.

We will use this same approach for a rather wide array of topics: After an introduction to the geometric meaning of singular values, the pseudo-inverse, and eigenvalues, the course covers geometric transformations (rotations, similarities, affine and projective transformations), elements of numerical unconstrained optimization, stochastic processes and random fields, deterministic and probabilistic dynamic systems, stochastic filtering and state estimation. Time permitting, the course will also cover elements of tensor fields, variational principles, and flow problems in two dimensions.

The class requires some prior exposure to linear algebra, introductory calculus, and elementary probability, but is otherwise self-contained.


Schedule and Venue

Tuesdays and Thursdays 11:40÷12:55 AM in the Levine Science Research Center (LSRC), room D243. Look for the big, red LSRC in a small map, or in a larger one.


Announcements

11/07/2004
The class on Tuesday, November 9, is cancelled. Please attend Shree Nayar's talk on Monday, November 8.
8/26/2004
As determined by registrar rules, the final exam for the course is on Friday, December 10 from 7pm to 10 pm in LSRC D243.
8/26/2004
The midterm exam will be in class on Thursday, October 7, at the regular lecture time.
8/26/2004
Both exams are closed book.

Contact

Please send mail directly, call, or visit. Contact information is enclosed below.


Lecture Notes

Notes for this class can be viewed or downloaded in Postscript or PDF format. They will be handed out in class one chapter at a time. When necessary, additional notes will be handed out in class, and will be made available through links in this space.


Handouts

  1. Additional notes will appear here when needed.

Useful Information

  1. Course mechanics
  2. A sample Midterm  will appear here in due time.

Homework

  1. Homework 1, due on September 7.
  2. Homework 2, due on September 30. You also need the files in hw2.zip.
  3. Homework 3, due on November 4. You also need the files linesearch.m and draw_rosenbrock.m
  4. Homework 4, due on November 30.


Teaching Staff


Carlo Tomasi <tomasi@cs.duke.edu>

Last modified: Thursday, December 09, 2004 06:17 PM