diagrams-solve: Pure Haskell solver routines used by diagrams
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]
Downloads
- diagrams-solve-0.1.2.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
- No Candidates
Versions [RSS] | 0.1, 0.1.0.1, 0.1.1, 0.1.2, 0.1.3, 0.1.3.1 |
---|---|
Change log | CHANGES.markdown |
Dependencies | base (>=4.5 && <5.0) [details] |
Tested with | ghc ==7.6.3, ghc ==7.8.4, ghc ==7.10.3, ghc ==8.0.2, ghc ==8.2.2, ghc ==8.4.3, ghc ==8.6.1, ghc ==8.8.1 |
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 2020-05-05T17:52:07Z |
Distributions | Debian:0.1.2, LTSHaskell:0.1.3.1, NixOS:0.1.3, Stackage:0.1.3.1 |
Reverse Dependencies | 2 direct, 105 indirect [details] |
Downloads | 18425 total (11 in the last 30 days) |
Rating | (no votes yet) [estimated by Bayesian average] |
Your Rating | |
Status | Docs available [build log] Last success reported on 2020-05-05 [all 1 reports] |