This section is designed to discuss how to make compiled functions run efficiently. It will cover features that make them run faster, as well as problems that can make them ...
FindMinValue[f, x] gives the value at a local minimum of f.FindMinValue[f, {x, x_0}] gives the value at a local minimum of f, found by a search starting from the point x = ...
PoissonConsulDistribution[\[Mu], \[Lambda]] represents a Poisson\[Dash]Consul distribution with parameters \[Mu] and \[Lambda].
The Mathematica compiler provides an important way both to speed up and also to work with Mathematica computations. It does this by taking assumptions about the computations ...
RandomGraph[{n, m}] gives a pseudorandom graph with n vertices and m edges.RandomGraph[{n, m}, k] gives a list of k pseudorandom graphs.RandomGraph[gdist, ...] samples from ...
DifferenceDelta[f, i] gives the discrete difference \[DifferenceDelta]_i f = f(i + 1) - f(i).DifferenceDelta[f, {i, n}] gives the multiple difference DifferenceDelta[f, {i, ...
This loads packages containing some test problems and utility functions. One of the first and simplest methods for solving initial value problems was proposed by Euler: ...
CopulaDistribution[ker, {dist_1, dist_2, ...}] represents a copula distribution with kernel distribution ker and marginal distributions dist_1, dist_2, ....
NProbability[pred, x \[Distributed] dist] gives the numerical probability for an event that satisfies the predicate pred under the assumption that x follows the probability ...
The function FindClusters finds clusters in a dataset based on a distance or dissimilarity function. This package contains functions for generating cluster hierarchies and ...