Start of a series of blog articles about linkers.

Interesting essays about software design.

Announcement of "Tricki", a collection of mathematical knowledge. Sounds interesting, despite the delay.

Some notes on David McClains DSP software. Check whether I still have a copy.

A styx/9p2000 file server that accesses files over http/webdav.

Geoid models.

Matlab/Octave code for interfacing with Google earth.

Abstract: This paper shows how linear algebra can be done better without determinants. The standard proof that a square matrix of complex numbers has an eigenvalue uses determinants. The simpler and clearer proof presented here provides more insight and avoids determinants. Without using determinants, this allows us to define the multiplicity of an eigenvalue and to prove that the number of eigenvalues, counting multiplicities, equals the dimension of the underlying space. Without using determinants, we can define the characteristic and minimal polynomials and then prove that they behave as expected. This leads to an easy proof that every matrix is similar to a nice upper-triangular one. Turning to inner product spaces, and still without mentioning determinants, this paper gives a simple proof of the finite-dimensional spectral theorem.

This paper was published in the American Mathematical Monthly 102 (1995), 139-154.
In 1996 this paper received the Lester R. Ford Award for expository writing from the Mathematical Association of America.

Good explanation of black hole physics (in german).