Up to
course homepage.
Recent information on 2D1263, Scientific Computing
-
The written examination is now scheduled: According to your wishes, it will be held on September 2, 2005 from 13-18. The room will be 4523.
- Please fill out the course evaluation form:
- Your accounts at PDC are now set up. Your accounting group is edu05.2D1263.
For details, see at the end of this page.
- The lecture room on Monday, Jan 31, will be Simplex.
- The present round of the course starts on January 19, 2005.
- In order to set up accounts for you on the PDC computers,
we need the following information:
Name, e-mail, sw. personnr, Login name for NADA, or if you don't have
NADA account login name for .kth.se.
Please e-mail the information to me
as soon as possible.
- An old exam is available as well. Exam
Lecturer :
Michael Hanke,
Office 4529, Phone 790 6278
Literature : Lecture notes can be bought at the students
expedition. In addition, extracts from books and journals will be
handed out.
Schedule : Lecures are given as follows. You will also find
some information in KTH's central database. However, the only
authoritative place with respect to the schedule is this web page!
The contents of the lectures is tentative and subject to changes.
- L1 (1/19, 8-10, E36): Introduction. Basics about grid generation. Basic concepts of
C/C++. slides1, slides2.
- L2 (1/26, 8-10, E36): Grid generation. Objects in C++ and dynamic memory allocation.
Some Matlab grid generation functions can be found
here . The file is a unix gzipped
tar-archive,
which is unpacked by the command:
tar xzf griddemo.tar.gz (assuming you are using a
unix system, and saved the file under the name griddemo.tar.gz). Winzip
should also be able to handle this file. slides3.
- L3 (1/31, 15-17, ????): More on grid generation. Inheritance, derived classes.
Some very simple C++ exercises to get started can
be found here . A summary of basic C
and C++ statements can be found here here .
Some more examples in C++: C++ examples 1 and
C++ examples 2 .
slides4, slides5.
- L4 (2/2, 8-10, Simplex): Basic properties of PDEs. Finite difference discretizations. slides6.
- L5 (2/9, 8-10, E32): Introduction to parallel programming. Basics of MPI.
Here is a short introduction to
MPI.
slides7, slides8.
- L6 (2/14, 15-17, Simplex): MPI continued
slides9, slides10.
- L7 (2/16, 8-10, E32): Implementation of finite difference methods
slides11, slides12.
- L8 (2/23, 8-10, Simplex): Difference methods on nonuniform grids
slides13, slides14.
- L9 (4/6, 8-10, Simplex): The Navier-Stokes equation
slides15.
- L10 (4/13, 8-10, Simplex): Object-oriented representation of boundary conditions
slides16.
- L11 (4/20, 8-10, Simplex):
slides19, slides20.
- L12 (4/27, 8-10, Simplex): Performance monitoring. Code optimization.
Memory hierarchies
slides21, slides22, slides23.
Scheduled Computer Labs:
- Lab 1 (2/28, 15-17, Spelhallen, Sporthallen)
- Lab 2 (4/14, 13-15, Spelhallen, Sporthallen)
- Lab 3 (4/28, 13-15, Spelhallen, Sporthallen)
- Lab 4 (5/4, 08-10, Musikhallen, Konsthallen)
- Lab 5 (5/11, 08-10, Musikhallen, Konsthallen)
- Lab 6 (5/12, 13-15, Spelhallen, Sporthallen)
Other reading :
These books are not required for the course, but are recommended to
those who would like to learn more.
-
For grid generation:
J.Thompson, Z.Warsi, and C.Mastin, Numerical Grid Generation,
North-Holland, 1985.
P.Knupp and S. Steinberg, Fundamentals of Grid Generation,
CRC Press, 1993, ISBN 0-8493-8987-9.
Thompson, Soni, Weatherill, Handbook of Grid Generation,
CRC Press, 1999, ISBN 0-8493-2687-7.
- For C++:
For this course, any simple book on C++ will probably do.
The standard reference for C++ is The C++ Programming Language
(3rd Edition) by Bjarne Stroustrup. This is an extensive
description of the language, and assumes previous knowledge of
computer programming.
A simpler beginners book is The Object
Concept by Rick Decker and Stuart Hirschfield.
Search at, e.g.,
www.amazon.com for a description of these and other C++ books.
Personally, I
prefer C++ Primer (3rd ed) by Stanley B. Lippman and Josee Lajoie.
- For parallel computing:
Designing and
Building Parallel Programs by Ian Foster.
High Performance
Computing by Charles Severance and Kevin Dowd.
Parallel Programming by B. Wilkinson and M. Allen.
Examination : A written exam will be given June 1, 2005.
Three mandatory
programming exercises must be completed to pass the course. The course
gives 4 credits ("poäng"), distributed with 2 on the exam and 2
on the computer exercises.
Programming exercises : There will be
three exercises. These can be done individually or in groups of two.
Written reports should be handed in for each exercise.
- Algebraic grid generation. Excercise 1
Deadline: February 28, 2005.
- A parallel array class. Excercise 2 Deadline: April 20, 2005. Here is the template starting-point.C.
- Solve a PDE problem on the grid using the parallel array
class. Excercise 3 Deadline: May 20, 2005.
Here is resid.f.
Information from PDC