University of Utah
Department of Computer Science
Continuous Simulation
CS 4550
Spring Semester 2001
MEB 3151 MW 2:00-2:50
Instructor: Thomas C. Henderson
Overview
of Course
Course Objectives
The following lists the goals for this quarter:
-
Simulation of Physical Systems
-
Numerical Techniques for Simulation
-
Random Number Techniques
-
Monte Carlo Techniques
-
Dynamical Systems
-
Genetic Algorithms
-
Critter Movement Simulation Project
-
Simulation Validation
Prerequisites
The prerequisite is successful completion of CS 3500, CS 3510 or consent
of instructor.
Course
Description
We will work on building simulations of physical systems.
The goal of the course is to provide an overview of techniques which allow
one to do physics on the computer. This will be aprogramming
based course (in Matlab) and will cover topics such as:
* Numerical Integration and Monte Carlo
* Falling Objects
* Two-Body Problem
* Simpler Linear and Nonlinear Systems
* Dynamical Systems
* Random Processes
* Genetic Algorithms
We will explore these topics in the context of creating mechanisms that
crawl, flop, fly, etc. while satisfying various constraints (time,
energy, etc.).
Software
Used to Support Class
Students will develop on a Unix environment in Matlab
Code provided for the class will be in the directory: http://www.cs.utah.ed/~tch/cs4550/code
with subdirectories for C, Matlab, etc.
Required Materials
We will use:
Gould & Tobochnik. An Intro to Computer Simulation Methods,
Second Edition, Addison-Wesley, 1996 (required)
Assignments
Assignments will be given out each week. There will
be various parts to the assignment, including:
-
Problems: These are usually stand alone questions or problems
that require solution and discussion.
-
Laboratory Reports: These are problems which require a complete
lab report write-up.
These must be completed by the due date and made available
in your directory structure.
-
In-class quizzes: Each student is responsible to be up-to-date
on the assignments and reading material each class meeting.
Class
Syllabus
The lectures will cover the text on the following schedule:
|
Date |
Topic |
Material (Text& other) |
Problem Assignments |
|
|
|
|
| Week 1 |
Overview |
Chapter 1 |
A1: due 17 Jan |
| Week 2 |
Solving DE's |
Chapter 2 |
A2: due 24 Jan |
| Week 3 |
Motion |
Chapter 3 |
A3: due Jan 31 |
| Week 4 |
Two-Body Problem |
Chapter 4 |
A4: due Feb 7 |
| Week 5 |
Simple Systems |
Chapter 5 |
A5: due Feb 14 |
| Week 6 |
Simple Systems |
Chapter 5 |
A6: due Feb 21 |
| Week 7 |
Dynamical Systems |
Chapter 6 |
A7: due Feb 28 |
| Week 8 |
Dynamical Systems |
Chapter 6 |
A8: due Mar 7 |
| Week 9 |
Random Processes |
Chapter 7 |
A9: due Mar 14 |
| Week 10 |
Random Processes |
Chapter 7 |
A10: due Mar 21 |
| Week 11 |
Monte Carlo |
Chapter 11, Notes |
A11: due Mar 28 |
| Week 12 |
MC & Genetic Algorithms |
Chapters 11, 15 |
A12: due Apr 4 |
| Week 13 |
Project |
Handouts |
A13: due Apr 11 |
| Week 14 |
Project |
Handouts |
A14: due Apr 18 |
| Week 15 |
Project |
Handouts |
A15: due Apr 25 |
Class
Schedule and Assignments
The lectures and assignments will cover the texts as we progress through
the semester. Class attendance is mandatory. Assignments will usually be
handed out on Monday and due Wednesday of the next week.
On-line handin:
Keep all work in a directory named cs4550 in your home directory.
Create a subdirectory for each problem named after the problem (e.g., A1-1),
and put a README describing the files and your work. Each lab report
should be a complete document as described in the text.
Instructor
Instructor:
Thomas C. Henderson, Professor
E-Mail:
tch@cs.utah.edu
Phone:
801-581-3601
Fax:
801-585-3743
Office Hours:
In-class and by appointment.
Grading Information
The grading distribution will be as follows:
Assignment Results 85%
Quizzes
15%
Note: You are expected to make a good effort on all assignments.
I will assign a grade based on how reasonable your solution is given the
difficulty of the assignment, the time required, and the style and content
of the solution. Very few jobs evaluate performance on a very quantitative
point system; my goal is to look at all your work, and to assign a grade
based on your participation, effort and results. It's better to ask
questions before and during an assignment, than to try and understand what
went wrong after it's due. The proportions given above delineate
how I intend to apportion the weight of the various work in the course.
Assignment Due Time
Unless otherwise stated in an assignment, all assignments will be due by
classtime on the assignment due date. The time that we use for an assignment
is the last modified time of the source file in the student's directories.
Be careful not to overwrite a file and wipe out its last modified time.
Appeals Procedure
See the Code of Student Rights and Responsibilities, located in the
Class Schedule for more details. Also, see:
http://www.coe.utah.edu/dean_coe/t_guidelines.html
Assignment Late
Policy
No late work is accepted.
Individual Work
The purpose of the assignments is to improve your skills at solving problems
and demonstrating that you understand the class material. Collaboration
with other class members is acceptable in understanding problems or software
tools. For any individual assignments or work turned in, you must do your
own work. Using someone else's work or giving someone else your work is
considered plagiarism and will be dealt with using standard College and
University procedures.
Registration
See http://www.coe.utah.edu/dean_coe/t_guidelines.html
for the full academic calendar and withdraw guidelines.
American with Disabilities Act
(ADA)
The University conforms to all standards of the ADA. If you wish to qualify
for exemptions under this act, notify the Center for Disabled Students
Services, 160 Union.