Difference between revisions of "Applications and libraries/Mathematics"
From HaskellWiki
m (MathematicsLibraries moved to Libraries and tools/Mathematics) 

(No difference)

Revision as of 21:39, 22 March 2006
 The copyright status of this work is not known. Please help resolve this on the talk page.
This page contains a list of libraries and tools in a certain category. For a comprehensive list of such pages, see Applications and libraries.
Libraries for numerical algorithms and mathematics
 Geometric Algorithms
 A small Haskell library, that contains algorithms for twodimensional convex hulls, triangulations of polygons, Voronoidiagrams and Delaunaytriangulations, the QEDS data structure, kdtrees and rangetrees.
 Digital Signal Processing
 Modules for matrix manpulation, digital signal processing, spectral estimation, and frequency estimation.
 Papers by Jerzy Karczmarczuk
 Some interesting uses of Haskell in mathematics, including functional differentiation, power series, continued fractions.
 DoCon  Algebraic Domain Constructor
 A small Computer Algebra System
 HaskellMath
 The HaskellMath library is a sandbox for me to experiment with mathematics algorithms. So far I've implemented a few quantitative finance models (Black Scholes, Binomial Trees, etc) and basic linear algebra functions. Next I might work on either computer algebra or linear programming. All comments welcome!
 GSLHaskell
 High level functional interface to standard linear algebra computations and other numerical algorithms based on the GNU Scientific Library.
 Numeric Prelude
 Experimental revised framework for numeric type classes.
 Exact Real Arithmetic
 A portallike treatment of the topic. There are functional programming materials too, even with downloadable Haskell source.
 Probabilistic Functional Programming
 The PFP library is a collection of modules for Haskell that facilitates probabilistic functional programming, that is, programming with stochastic values. The probabilistic functional programming approach is based on a data type for representing distributions. A distribution represent the outcome of a probabilistic event as a collection of all possible values, tagged with their likelihood. A nice aspect of this system is that simulations can be specified independently from their method of execution. That is, we can either fully simulate or randomize any simulation without altering the code which defines it.
 Numerics with fractions(via Internet Archive since 10/06/2003).
 Roots of polynomials(via Internet Archive since 10/06/2003). It implements the well known Laguerre's method for finding complex roots of polynomials.
 Indexless linear algebra algorithms(via Internet Archive since 10/06/2003). Orthogonalization, solution of linear equations, eigenvalues and eigenvectors.
 State vector evolution(via Internet Archive since 10/06/2003)
 Short study of fuzzy oscillator(via Internet Archive since 10/06/2003)
 Ndimensional tensors(via Internet Archive since 10/06/2003)