# 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]

Versions [faq] | 0.1, 0.1.0.1, 0.1.1 |
---|---|

Change log | CHANGES.markdown |

Dependencies | base (>=4.5 && <4.13) [details] |

License | BSD-3-Clause |

Author | various |

Maintainer | diagrams-discuss@googlegroups.com |

Revised | Revision 4 made by BrentYorgey at Mon Dec 17 20:28:08 UTC 2018 |

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.1, LTSHaskell:0.1.1, NixOS:0.1.1, Stackage:0.1.1 |

Downloads | 8053 total (125 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] |

## Downloads

- diagrams-solve-0.1.1.tar.gz [browse] (Cabal source package)
- Package description (revised from the package)

Note: This package has metadata revisions in the cabal description newer than included in the tarball. To unpack the package including the revisions, use 'cabal get'.