Matrix Inversion using Quadtrees Implemented in Gofer

Using literate programming, complete Gofer code to invert a floating-point quadtree matrix is presented along with exposition. The code is a full implementation some of the algorithms presented in "UndulantBlock Pivoting and Integer-Preserving Matrix Inversion" [4] by the second author. CR categories and Subject Descriptors: G.1.3 [Numerical Linear Algebra]: Matrix inversion, Sparse and very large systems; E.1 [Data Structures]: Trees; D.1.1 [Applicative (Functional) Programming Techniques]; I.1.2 [Algebraic Manipulation]: Algebraic algorithms; D.2.7 [Distribution and Maintenance]: Documentation; C.1.2 [Multiple Data Stream Architectures (Multiprocessors)]: Parallel processors. General Term: Algorithms. Additional Key Words and Phrases: Gaussian elimination, block algorithm, undulant pivoting, LU factorization, quaternary trees, Haskell, literate programming. Contents 0 Introduction 1 0.1 Overview of this Report : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : ..