Fall 2019
This semester the classes are in
English.
Lecture: We,Th
12:15-13:45, IB134
We are mostly following a Hungarian book but, for example, the book
Matrix Computations by Golub and Van Loan is a good place to look
for algorithms. Wikipedia also contains many useful things.
Exam topics
Exams:
There are 3 occasions: 13 Jan, 20 Jan, 27 Jan, always
starting at 9:00. Let me know if none of these is good for
you.
Important steps before the exam:
- Choose one problem from this
list (one that is not yet taken by someone else).
- Send me an email
with your selection.
- If you are the first, it is yours (I acknowledge it).
- Solve it by a program you write or find somewhere (for example
in MATLAB). If you really want, most of these can be solved with
paper and pen only :)
- Play with it a little bit: use different precisions, add
random noise or do some transformation on the problem and
see how this effects the solution; create larger example
(e.g. randomly) and see how this effects the
solution and the time it takes to compute, etc.
In the first
part of the exam you will talk about your
experiences with the selected problem (method, result, other
considerations). For this you can use whatever you wish: your
notes, printout, computer.
The second part is an oral exam from the
material (definitions, algorithms, theorems, proofs, etc.)
covered during the semester. For this, you can prepare a "cheat
sheet": a sheet of size A4, handwritten by yourselves at home.
The topics are listed here (there will
be some time for preparation before you start talking about the one
selected for you).
In case of any question send me an email.