Teaching page G. Sleijpen

Master Course 'Laboratory Class Scientific Computing'

Latest news

2014-10-04 Lecture on Monday, Oct. 6, in BBG017.
Lecture notes (new print) are available from the Book store of the student association A-Eskwadraat (Buys Ballot Building, r.238), openingshours: 11:30-13:30.
2014-09-26 Lecture on Monday, Sept. 29, in MIN022.
2014-09-19 Lecture on Monday, Sept. 22, in MIN016.
Instructions on how to include the C++ library on ubuntu.
An adapted Makefile might be required on Ubuntu or Mac.

This page is the home of the 2014–2015 installment of the Laboratory Class Scientific Computing.

Overview

Participation

Please register through Osiris Online. Course code: WISM454.

Format

Literature

We use lecture notes, available from the Beta student desk on the first floor of the Buys-Ballot building.

Topics

The aim of the course is to learn about a number of important scientific computing subjects, and to meet with the various aspects of scientific computing. You will (partially) write your own computer code and run simulations, handle output data and visualise it. The theory and results of the simulations are to be presented by means of written reports.

Contents

This is a hands on course which is intended to expose you to computer techniques used in scientific computation. It covers the full process from the theory to programming (C++), experimenting (MATLAB), and finally to writing a report. In this year's course we will focus our attention on two subjects:

  1. Monte Carlo integration
  2. Optimisation by genetic algorithms

We will cover topics such as how to choose a good random number generator and how to apply techniques such as biased sampling and discrepancy sampling. Since Monte Carlo does not suffer from the 'curse of dimensionality' we can fairly efficiently approximate the volume of, say, the d-dimensional unit sphere, for large d.

In genetic algorithms we use a population that represents elements in the search space of an optimisation problem. Techniques such as elitism and Gray codes improve the optimising effects of mutation and crossover. Combined with local search, the resulting hybrid method yields a powerful optimisation program, typically for hard (NP-hard) problems.

Reports

For each of the two main subjects in this course, you will have to present your results in a report written in English and formatted using LaTeX. Look here for deadlines and additional demands. Read the Introduction and Appendix A in the lecture notes for further instructions.