# 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.3.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'.

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

Change log | CHANGES.markdown |

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

License | BSD-3-Clause |

Author | various |

Maintainer | diagrams-discuss@googlegroups.com |

Revised | Revision 1 made by BrentYorgey at 2021-08-17T18:08:57Z |

Category | Math |

Home page | https://diagrams.github.io |

Source repo | head: git clone http://github.com/diagrams/diagrams-solve.git |

Uploaded | by BrentYorgey at 2021-02-13T12:55:46Z |

Distributions | Debian:0.1.2, LTSHaskell:0.1.3, NixOS:0.1.3, Stackage:0.1.3 |

Reverse Dependencies | 2 direct, 102 indirect [details] |

Downloads | 16509 total (83 in the last 30 days) |

Rating | (no votes yet) [estimated by Bayesian average] |

Your Rating | |

Status | Docs available [build log] Last success reported on 2021-02-13 [all 1 reports] |