We present an implementation in the functional programming language Haskell of the PLE decomposition of matrices over division rings. We discover in our benchmarks that in a relevant number of cases it is significantly faster than the C-based implementation provided in FLINT. Describing the guiding principles of our work, we introduce the reader to basic ideas from high performance functional programming.
['Alexandru Ghitza', 'Martin Westerholt-Raum']
HLinear: Exact Dense Linear Algebra in Haskell