Menu

Mathpaqs / News: Recent posts

Mathpaqs release 27-Mar-2018

Mathpaqs is a collection of mathematical packages in the Ada programming language.

What's new:

  • Discrete_Random_Simulation: after linear - O(n) - and dichotomic (binary) - O(log(n)) - searches, added the alias method which is O(1). Concretely, the simulation of a discrete, finite random variable of any number of states is as fast as simulating a flip-or-coin !...

  • Added Test_Discrete_Random_Simulation with timing and error measurement.

Posted by Gautier de Montmollin 2018-03-28

Mathpaqs release 13-Mar-2018

What's new:

  • Added special functions Beta and Phi in the numerics part (Beta_function, Test_Beta, Phi_function)
  • Added the Beta distribution in the random distribution part (Generic_Random_Functions)
Posted by Gautier de Montmollin 2018-03-13

Mathpaqs release 23-Dec-2016

The main change in this release is in the Copulas package.
It is now possible to use a vector of pseudo-random generators, one for each dimension.
This way, each independent dimension has a reproducible sequence when using a fixed seed.
Then, results can be reproduced even if a dimension is added or removed.

Posted by Gautier de Montmollin 2016-12-23

Mathpaqs release 19-Dec-2015

  • Added Gamma special function: see Gamma_function package; code courtesy of Stephen L. Moshier
  • Added Normal_inverse_CDF to random functions (as complement to the Box-Muller method)
Posted by Gautier de Montmollin 2015-12-19

Mathpaqs release 30-May-2015

Two additions in the latest release:

  • Formulas, a generic formula package with parsing, evaluation and simplification

  • Contours, a generic contour plot package

Enjoy!

Posted by Gautier de Montmollin 2015-06-02

Recent activity on Formulas package

Formulas is a package for parsing formulas in real numbers, evaluating them quickly in parsed form, and simplifying them if desired.

Recent additions (check-ins around #60 to #70) :

New simplification rules

X + -Y -> X - Y
X - -Y -> X + Y
-cst -> cst (fold unary minus into constant)
cst - cst -> cst
X + n -> X - {abs n} where n < 0
X - n -> X + {abs n} where n < 0
-n -> {abs n} where n < 0
X + {X + Y} -> 2 * X + Y
X + {Y + X} -> 2 * X + Y... read more

Posted by Gautier de Montmollin 2015-04-18
Want the latest updates on software, tech news, and AI?
Get latest updates about software, tech news, and AI from SourceForge directly in your inbox once a month.