algo

:: on linear complementarity problems

6 minute read Published:

Solving systems of equations is the most important.
This Fall 2021, I am taking a course on computational game theory, which insofar is the formulation of various games (e.g. bimatrix, Stackelberg) as mathematical programs and the algorithms that solve them, or approximate solutions. Linear complementarity problems are foundational for computing Nash equilibria of simple games.

:: on fiber tracking

5 minute read Published:

Take a little swim through your brain canals!
After brief description of diffusion tensor images and what information they provide, I discuss an intuitive seed-based line propagation algorithm for computing a tractography map of a neuroimage. The open-source softwares required are 3D Slicer, ITK for C++, and ITK-SNAP.

:: on fast inverse square root

5 minute read Published:

An awe-inspiring C exploit imo.
I found it on YouTube and, as my friend Nolan reminded me the other night, this algorithm is not new. The fast inverse square root shook the nerd world with its implementation in Quake III (1999).