singular-factory
Singular
singular-factory | Singular | |
---|---|---|
1 | 1 | |
0 | 244 | |
- | 2.5% | |
0.0 | 9.7 | |
over 4 years ago | 3 days ago | |
Haskell | C++ | |
LicenseRef-GPL | GNU General Public License v3.0 or later |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
singular-factory
-
Looking for a library to solve systems of multivariate polynomial equations
Your best bet would be just call out to, say, Singular; either directly executing it by supplying textual input, or make a Haskell binding for the relevant parts (for example I wrote Haskell bindings to the multivariate polynomial factorization engine. It was kind of painful)
Singular
-
Looking for a library to solve systems of multivariate polynomial equations
As for the "reasonably straightforward" comment, I was looking at Singular's triangMH function which does most of the work in solving such a polynomial system, and it didn't seem too tricky. It starts off with a reduced lexicographic Gröbner basis and eliminates variables one at a time by recursively calling itself, yielding a triangular decomposition of the 0-dimensional variety. Then a univariate root finding algorithm can be used to solve for each variable in turn. It might not have the best numerical stability properties or etc, but it seems manageable (given a basic framework for commutative algebra). I agree that, in general, it's unreasonable to expect to be able to cook up something in a few days of work that is of equivalent robustness to these battle-tested algorithms (for instance I can see all the complexity that's in Singular's Laguerre solver to attempt to improve numerical stability, compared to the simple Laguerre solver I wrote myself). However this case didn't seem quite as difficult as usual (for Singular's algorithm specifically, PHCpack's algorithm looks extremely involved).
What are some alternatives?
hermit - Haskell Equational Reasoning Model-to-Implementation Tunnel
rotki - A portfolio tracking, analytics, accounting and management application that protects your privacy
rounded - MPFR bindings for Haskell
vector-sized
bayes-stack - Framework for Gibbs sampling of probabilistic models
math-functions - Special mathematical functions
dimensional - Dimensional library variant built on Data Kinds, Closed Type Families, TypeNats (GHC 7.8+).
sbvPlugin - Formally prove properties of Haskell programs using SBV/SMT.
vector - An efficient implementation of Int-indexed arrays (both mutable and immutable), with a powerful loop optimisation framework .
type-natural - Type-level well-kinded natural numbers.
hblas - haskell bindings for blas and lapack
estimator - State-space estimation algorithms and models