Function Approximations Package (Function Approximations Package Tutorial)

This loads the package. Economized rational approximations. A Pad é approximation is very accurate near the center of expansion, but the error increases rapidly as you get ...

Computational Geometry Package (Computational Geometry Package Tutorial)

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 ...

DiscreteWaveletData (Built-in Mathematica Symbol)

DiscreteWaveletData[{wind_1 -> coef_1, ...}, wave, wtrans] yields a discrete wavelet data object with wavelet coefficients coef_i corresponding to wavelet index wind_i, ...

Integrate (Built-in Mathematica Symbol)

Integrate[f, x] gives the indefinite integral \[Integral]f d x. Integrate[f, {x, x_min, x_max}] gives the definite integral \[Integral]_x_min^x_max\ f\ d x. Integrate[f, {x, ...

ListLinePlot (Built-in Mathematica Symbol)

ListLinePlot[{y_1, y_2, ...}] plots a line through a list of values, assumed to correspond to x coordinates 1, 2, .... ListLinePlot[{{x_1, y_1}, {x_2, y_2}, ...}] plots a ...

ListPlot (Built-in Mathematica Symbol)

ListPlot[{y_1, y_2, ...}] plots points corresponding to a list of values, assumed to correspond to x coordinates 1, 2, .... ListPlot[{{x_1, y_1}, {x_2, y_2}, ...}] plots a ...

WaveletThreshold (Built-in Mathematica Symbol)

WaveletThreshold[dwd] thresholds the detail wavelet coefficients in the DiscreteWaveletData object dwd.WaveletThreshold[dwd, tspec] thresholds the coefficients using the ...

Integer and Number Theoretic Functions (Mathematica Tutorial)

Some integer functions. The remainder on dividing 17 by 3. The integer part of 17/3.

RectangleChart (Built-in Mathematica Symbol)

RectangleChart[{{x_1, y_1}, {x_2, y_2}, ...}] makes a rectangle chart with bars of width x_i and height y_i. RectangleChart[{..., w_i[{x_i, y_i}, ...], ..., w_j[{x_i, y_j}, ...

BreadthFirstScan (Built-in Mathematica Symbol)

BreadthFirstScan[g, s, {"event_1" -> f_1, "event_2" -> f_2, ...}] performs a breadth-first scan (bfs) of the graph g starting at the vertex s and evaluates f_i whenever ...