HLinear: Exact Dense Linear Algebra in Haskell

05/09/2016
by   Alexandru Ghitza, et al.
0

We present an implementation in the functional programming language Haskell of the PLE decomposition of matrices over division rings. Our benchmarks indicate that it is competitive with 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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/17/2018

EBG: A Lazy Functional Programming Language Implemented on the Java Virtual Machine

This technical report describes the implementation of a lazy functional ...
research
05/17/2017

Nemo/Hecke: Computer Algebra and Number Theory Packages for the Julia Programming Language

We introduce two new packages, Nemo and Hecke, written in the Julia prog...
research
05/19/2018

Productively Expressing High-performance Spatial Designs of Givens Rotation-based QR Decomposition Algorithm

QR decomposition is used prevalently in wireless communication. In this ...
research
08/05/2022

Basic Elements of Logical Graphs

We considers how a particular kind of graph corresponds to multiplicativ...
research
05/19/2022

Neural Networks in Imandra: Matrix Representation as a Verification Choice

The demand for formal verification tools for neural networks has increas...
research
06/26/2017

Parareal Algorithm Implementation and Simulation in Julia

We present a full implementation of the parareal algorithm---an integrat...
research
08/23/2018

FMS: Functional Programming as a Modelling Language

In this paper we introduce the Functional Modelling System (FMS). The sy...

Please sign up or login with your details

Forgot password? Click here to reset