CPS296.1 Fall 2003

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 9:10÷10:25 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

12/09/2003
Graded finals are with Bridgette Colton in LSRC D211
11/21/2003
           The final exam will take place in class on Tuesday, December 9, starting at 9:30 AM.
           This time is within the University-mandated time slot for our class.
9/29/2003
 The midterm exam will take place in class on Thursday, October 9, during the regular class period.
9/16/2003
 The class of Thursday, September 18 is cancelled because of travel changes forced by hurricane Isabel.
8/22/2003
 Please read the course mechanics carefully. This is our contract.
8/22/2003
 Watch this space for date, time, and venue for the midterm exam.

Contact

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


Lecture Notes

Notes from an earlier version of the class can be viewed or downloaded in Postscript or PDF format. These earlier notes are provided for your information only. Relevant notes, both from the old version and original ones, will be handed out in class as necessary, and will be made available through links in this space. Please see the introduction in the old notes for some information about useful books.


Handouts

  1. Introduction and linear systems (Postscript, PDF).
  2. The Singular Value Decomposition (Postscript, PDF).
  3. Function optimization (Postscript, PDF).
  4. Eigenvalues and eigenvectors (Postscript, PDF).
  5. Systems of Linear Ordinary Differential Equations (Postscript, PDF).

Useful Information

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

Homework

  1. Homework 1 (Postscript, PDF), due on September 9, 2003.
  2. Homework 2 (Postscript, PDF), due on September 25, 2003.
  3. Homework 3 (Postscript, PDF), due on October 7, 2003.
  4. Homework 4 (Postscript, PDF), due on November 13, 2003. You will also need the Matlab functions linesearch.m and drawrosenbrock.m
  5. Homework 5 (Postscript, PDF), due on December 2, 2003.


Teaching Staff


Carlo Tomasi <tomasi@cs.duke.edu>

Last modified: Tuesday, December 09, 2003 02:09 PM