1.6 Exercises

1.00 E-learning.

1.01 Convergence.

1.02 Finite difference quotients.

1.03 Fourier-Laplace transform.

1.04 Random-walk.

1.05 Stiff ODE.

1.06 Predator-prey model.

1.07 Laplacian in 2D.

1.08 Sampling in a hypercube.

These problems can be edited / submitted for correction from your web browser by selecting assignments under the course main page. The color coding corresponds to the level of difficulty / amount of work:

Easy (2-4 hours).

The problem is a direct illustration of the syllabus and highlights a particular aspect of the theory: the solution consists of a short text with explanations, formulas, maybe an ASCII plot or sometimes a simple modification of the JBONE applet.

Moderate (1 day).

The problem deals with an extension of the syllabus or an application: the solution combines all the steps, starting from the formulation of a model, the analytical derivation of a numerical scheme, the implementation of a program and finishing with a discussion of the simulation in the JBONE applet.

Difficult (2-3 days).

The problem describes an application from a neighbouring field that goes beyond the scope of this course, but can be examined to open the scientific horizon: a certain degree of independence and creativity are required to outline a certain aspect, solve the equations and discuss the result.

SYLLABUS  Previous: 1.5 Computer quiz  Up: 1 INTRODUCTION  Next: 1.7 Further reading