mwc-random
linearEqSolver
mwc-random | linearEqSolver | |
---|---|---|
1 | - | |
54 | 8 | |
- | - | |
0.0 | 0.0 | |
5 days ago | about 3 years ago | |
Haskell | Haskell | |
BSD 3-clause "New" or "Revised" License | BSD 3-clause "New" or "Revised" License |
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.
mwc-random
-
Probabilistic Programming in Haskell
Sampling is the easy part ;) BTW there were already basic Haskell libraries for random sampling : `mwc-random` (https://hackage.haskell.org/package/mwc-random), `splitmix-distributions` https://hackage.haskell.org/package/splitmix-distributions-1.0.0/docs/System-Random-SplitMix-Distributions.html
linearEqSolver
We haven't tracked posts mentioning linearEqSolver yet.
Tracking mentions began in Dec 2020.
What are some alternatives?
mwc-probability - A probability distribution type layered on top of mwc-random.
computational-algebra - General-Purpose Computer Algebra System as an EDSL in Haskell
mcmc-types - Common types for sampling.
statistics - A fast, high quality library for computing with statistics in Haskell.
nimber - Finite nimber arithmetic
deeplearning-hs
th-cas - Compile time CAS(Computer Algebra System) for Haskell
simple-smt
nonlinear-optimization - Various iterative algorithms for optimization of nonlinear functions.
dimensional - Dimensional library variant built on Data Kinds, Closed Type Families, TypeNats (GHC 7.8+).
manifold-random - Coordinate-free hypersurfaces as Haskell types
hgeometry - HGeometry is a library for computing with geometric objects in Haskell. It defines basic geometric types and primitives, and it implements some geometric data structures and algorithms. The main two focusses are: (1) Strong type safety, and (2) implementations of geometric algorithms and data structures that have good asymptotic running time guarantees.