Posts

The following paragraphs are mostly personal notes, so that I do not forget about these. Migrating Things Between Git Repositories Recently I had to migrate parts of a git repository hosted on Bitbucket infrastructure over to other git repositories hosted on GitHub. I had to move whole folders as well as single files. One of the requirements was that I migrate things including their whole git history. So just copy and pasting things was out of question.

I probably do a lot of sports. I go jogging, swimming and love functional- and Crossfit training. Recently I also attended my first Hyrox competition. I really enjoyed that challenge, and currently I’m preparing for the next season. Hence, I need a way to analyze the performance in my workouts, track my results and keep an eye on my nutrition. Most people would probably use an app for that. In fact, I do too.

A short overview on how I set up a CI/CD/CT strategy and tried a docs as code model.

My development environment for most of my programming work.

This is the fourth post in our series on Krylov subspaces. The previous ones (i.e Arnoldi Iterations and Lanczos Algorithm were mostly focused on eigenvalue and eigenvector computations. In this post we will have a look at solving strategies for linear systems of equations. In particular, we will derive the famous conjugate gradients algorithm. The conjugate gradients method is one of the most popular solvers for linear systems of equations. There exist countless variations and extensions.

This is the third post in my series on Krylov subspaces. The first post is here and the second one is here. The Lanczos Algorithm In this post we cover the Lanczos algorithm that gives you eigenvalues and eigenvectors of symmetric matrices. The Lanczos algorithm is named after Cornelius Lanczos, who was quite influential with his research. He also proposed an interpolation method and a method to approximate the gamma function.

This is the second post in my series on Krylov subspaces. The first post is here and the third one is here. Arnoldi Iterations Arnoldi iterations is an algorithm to find eigenvalues and eigenvectors of general matrices. The algorithm constructs orthonormal bases of suitable Krylov subspaces and extracts the eigendata from the basis representation. The method is named after the American engineer Walter Edwin Arnoldi and was published in 1951 [1].

This is the first post in a (planned) series on Krylov subspaces, projection processes, and related algorithms. We already discussed projection processes when talking about the Bregman algorithm and we will see that the Krylov (sub-)spaces will be generated by a set of vectors that are not necessarily orthogonal. Getting an orthogonal basis for these spaces can for example be done by applying Gram-Schmidt. Forthcoming posts will discuss further interesting applications such as the Arnoldi iteration or the Lanczos method.

Implementing LeNet for MNist in Wolfram Mathematica

In the previous post in our series on the Bregman algorithm we discussed how to solve convex optimization problems. In this post we want to give reference to some variations and extensions of the Bregman algorithm. First of all, there’s a website related to the Split Bregman Algorithm, which we analysed here. The website provides further documentation and reference implementations in Matlab. There is also a nice paper [1] that discusses its relationship to other frameworks in convex optimisation.