The third batch, 30/06, please find your take-home examination assignments here. You have got three days to do the project. That is, until Thursday, 3/07.

The second batch, 23/06, please find your take-home examination assignments here. You have got three days to do the project. That is, until Thursday, 26/06.

Note that our webserver does not like the filename "README". So, name your file "readme.txt" (or similar) and, importantly, check that you can see it in your browser.

The first batch, 19/06, please find your take-home examination assignments here. You have got three days to do the project. That is, until Sunday, 22/06.

You should generally finish exercises and checking before your examination starts. However, you have the right to do checking already after 9/6 should you insist on that due to some (extraordinary) circumstances.

We shall have have three examination runs, on 19/6, 23/6, and 30/6. Sign up for one of these days at the AULA→Wiki: edit the table and put your name under the examination date of your choice.

The targets in your makefiles must be the output files, not the acts of running some programs. I mean it.

'make clean' should clean the directory, the first 'make' after clean should build all the output files, the second 'make' should do nothing. Punktum.

I will check your exercises by doing 'make clean' then 'make' (in a copy of your directory) and then looking at the results. You will only get points for what is then built. So you better check that all files are group/others readable and that your 'make clean' and 'make' work as intended.

You only have *one* vote for the examination date.

Will you please put zeros (instead of blanks) in the spreadsheet for the exercises which you do not intend to do.

Vote for the examination dates at the AULA page→Wiki: edit the table and put your initials under your preferred examination date. Two dates with most votes will be the examination dates. You will have then to sign up for one of the two dates.

You will have to login to AULA in order to edit the file. AULA does not resolve simultaneous edits gracefully, so check that your edit went through.

Please run your benchmarkings nice, and try not to allocate more that half a gigabyte RAM, ok? ;)

It seems that SR1 update works better than Broyden's update so I suggest you implement SR1 update instead of Broyden's in the optimization exercise.

I have made an implementation of the classic Jacobi eigenvalue algorithm for your reference. In the csharp programming language. It turns out to be about 20% slower that the cyclic algorithm.

My micro-benchmarking shows that Givens QR-decomposition is about three times faster than Gram-Schmidt. So, if your Givens implementation is, on the contraty, 100 times slower, you are probably doing something very wrong. ;)

Listen carefully: In every exercise directory there must be a meaningful output either in the form of a text file, say 'A.txt.out', or a in the form of a figure, say 'A.png'. The output has to prove that you have solved the exercise satisfactorily. An exercise without output is considered not solved and gives you zero points.

For an example look at my java solutions in the directory specified at the spreadsheet.

May I remind you that "if A is invertible, then the QR-factorization is unique under the requirement that the diagonal elements of R are positive".

In the interpolation exercise in the piecewise polynomial part after popular demand we drop the implementation of derivatives and anti-derivatives.

In this spreadsheet you only have to indicate to which extent you have solved the corresponding part of the exercise by giving yourself a number between 0 (nothing done at all) and 1 (an exemplary solution with enlightening illustrations and meaningfull, concise and witty comments in the code) and the spreadsheet will recalculate the points and percentages automatically.

After you have sent me the "HELLOWORLD 2014" email confirming you've solved the HelloWorld exercise I will give you the permission to edit the homework spreadsheet. You have to add youself to the table by adding an extra line at the bottom of the table; the contents of the line *must* be copied from the line #0 (the one with my name in it) and then changed accordingly. The spreadsheet is a program, you *do* need to copy-paste the line #0 to preserve the automatic points counting.

May I remind you that "the official instructions (also for PuTTY) for setting up the RSA-keysa for logging on lifa are here in English and here in Danish. You can also read the official PuTTY documentation about using public keys for SSH authentication.

While the auditorium 1525-319 is under reparation we shall use another auditorium: 1521-318.

This text, Using The Terminal, might be useful.

Java folk, this is approximately what I want from you when you solve your exercises. The java on lifa is *really* old, so you had better use molveno.

The exercises (and notes) below which are grayed-out will probably be modified slightly. Don't rush to solve them just yet.