Arlofin

The sample method is simply incorrect, @tlatarche's proposal is correct. Just to recall the relationships: With the chosen definition (r is number of successes, p is probability of success), the...

Good proposal in my view. I would just like to point out to small technical differences to the analogous (existing) implementation for matrices: - Implemented as an instance method, not...

The implementation of `Polynomial.Roots()` is almost identical to the described workaround, with the difference that it stays in the real numbers by omitting `ToComplex()`. Algebraically, this is a valid algorithm...

Using the complex eigenvalue decomposition would, however, run into issue #595, and other issues as the unit tests hang up even when applying the fix in #944 .

`T` is generic (at least at compile time), hence the non-generic `Math.Round` function cannot be used. For the same reason, the `-` operator is not defined. The implementation is idiomatic...

For inequalities: If `A` is invertible, just rephrase your problem by setting `x' = Ax` and solving for `x'`. Or use the inequality constraint `1/A c

Hello @cdrnet, please let me know whether this PR needs additional work. The CodeQL failure seems to me rather an issue with the analyzer than with my code ("Config file...

Hi, are there any plans to ever merge this PR?

There are several issues here: 1. The code provided by @Mlambrechts is wrong, parameters r and p need to be determined as `double p = 1 / dispersion` and `double...

The description was partially fixed in 9fbd27f53d2b9c84, however the description in the F# interface is still wrong.