KuiperTest[data] tests whether data is normally distributed using the Kuiper test.KuiperTest[data, dist] tests whether data is distributed according to dist using the Kuiper ...
PearsonChiSquareTest[data] tests whether data is normally distributed using the Pearson \[Chi]^2 test.PearsonChiSquareTest[data, dist] tests whether data is distributed ...
WatsonUSquareTest[data] tests whether data is normally distributed using the Watson U^2 test.WatsonUSquareTest[data, dist] tests whether data is distributed according to dist ...
Computational geometry is the study of efficient algorithms for solving geometric problems. The nearest neighbor problem involves identifying one point, out of a set of ...
LocatorPane[{x, y}, back] represents a pane with a locator at position {x, y} and background back.LocatorPane[Dynamic[pt], back] takes the locator position to be the ...
AndersonDarlingTest[data] tests whether data is normally distributed using the Anderson\[Dash]Darling test.AndersonDarlingTest[data, dist] tests whether data is distributed ...
For many kinds of practical calculations, the only operations you will need to perform on polynomials are essentially structural ones. If you do more advanced algebra with ...
CurrentValue[item] gives the current value of item at a location in the Mathematica system and interface. CurrentValue[{item, spec}] gives the current value for the feature ...
The IDA package is part of the SUNDIALS (SUite of Nonlinear and DIfferential/ALgebraic equation Solvers) developed at the Center for Applied Scientific Computing of Lawrence ...
DeBruijnGraph[m, n] constructs the n-dimensional De Bruijn graph with m symbols for integers m > 0 and n > 1. DeBruijnGraph[alph, n] constructs the n-dimensional De Bruijn ...