diagrams-solve: Pure Haskell solver routines used by diagrams

[ bsd3, library, math ] [ Propose Tags ]
Versions 0.1,, 0.1.1
Change log CHANGES.markdown
Dependencies base (>=4.5 && <4.11) [details]
License BSD-3-Clause
Author various
Maintainer diagrams-discuss@googlegroups.com
Category Math
Home page http://projects.haskell.org/diagrams
Source repo head: git clone http://github.com/diagrams/diagrams-solve.git
Uploaded by BrentYorgey at Mon Jul 3 15:23:52 UTC 2017
Distributions Debian:0.1, NixOS:0.1.1, openSUSE:0.1.1
Downloads 6737 total (79 in the last 30 days)
Rating (no votes yet) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2017-07-03 [all 1 reports]
Hackage Matrix CI

Pure Haskell solver routines used by the diagrams project. Currently includes finding real roots of low-degree (n < 5) polynomials, and solving tridiagonal and cyclic tridiagonal linear systems.

[Skip to Readme]




Maintainer's Corner

For package maintainers and hackage trustees

Readme for diagrams-solve-0.1.1

[back to package description]

Build Status

Miscellaneous pure-Haskell solver routines used in diagrams, a Haskell embedded domain-specific language for compositional, declarative drawing.

This is split out into a separate package with no dependencies on the rest of diagrams in case it is useful to others, but no particular guarantees are made as to the suitability or correctness of the code (though we are certainly open to bug reports).

Currently the package contains:

  • functions to find real roots of quadratic, cubic, and quartic polynomials, in Diagrams.Solve.Polynomial

  • functions to solve tridiagonal and cyclic tridiagonal systems of linear equations, in Diagrams.Solve.Tridiagonal