OCaml vs F#: QR decomposition
Recent articles in the OCaml and F#.NET Journals derived high-level implementations of QR decomposition via Householder reductions. This numerical method has many applications, most notably in the computation of best fit parameters of linear sums. Imperfections in OCaml The OCaml programming language allows this algorithm to be expressed very elegantly in only 15 lines of code: # let qr a =
let m, n = Matrix.dim a in
let rec qr_aux k q r qa =
if k = n then q, Ma...