F# Math: Extreme Optimization 4.0 – 50 Quick Start samples in F#

The guys at Extreme Optimization have released version 4.0 of their  .NET math library.

This time the library comes with 50 QuickStart samples for F#, including polynomials in F#, numerical integration in F#, optimization in F#, Fourier Transforms in F#, continuous distributions in F# and discrete distributions in F#. Some other things on offer in 4.0 are:

  • Support for .NET Framework Version 4.0 and Visual Studio 2010
  • Parallellized.
  • New sparse linear program
  • Mixed integer linear programming
  • New special functions: hypergeometric, Riemann zeta, elliptic integrals, Frensel functions, Dawson's integral.
  • Full set of window functions for FFT's.

The original is here: Extreme Optimization Numerical Libraries for .NET.

[ Note, after a comment, I removed the inline description of the product - if you have a math library that can be used with F#, please let me know and I'd be glad to include a blog about it here ]


Comments (3)
  1. Richard says:

    I wasn't aware that MSDN blogs had become an advertising platform for third-party commercial products. Is it just that they provide samples in F#, or did they pay you to advertise their product over anyone else's?

    [ Don says: Hi Richard, sorry about that, agreed that including the inline product description wasn't necessary, and have removed that, trust that's in order now. It's definitely the fact that the library has samples in F# that warrants the post. ]


  2. Trevor Misfeldt says:

    Hi, Don.

    I'm going to take you up on your offer today to mention numerical libraries that can be used from F#. Our .NET products, NMath and NMath Stats, are used by many of our customers in an F# environment.

    Thanks. Great blog. F# is definitely going places.

    – Trevor

    CEO, CenterSpace Software



  3. Math Complete says:

    We have tried to make the subject easy for kids by providing them with useful math resources and triangle tricks on mathematics


Comments are closed.

Skip to main content