LinearAlgebra`Tridiagonal` (Mathematica Compatibility Information)

Mathematica's built-in SparseArray function should be used to create tridiagonal matrices. Mathematica kernel's built-in sparse solver LinearSolve has replaced ...

Miscellaneous`ChemicalElements` (Mathematica Compatibility Information)

New function ElementData has been added to the built-in Mathematica kernel.

NumberTheory`Frobenius` (Mathematica Compatibility Information)

FrobeniusInstance and FrobeniusSolve are now available as the newly added built-in Mathematica kernel function FrobeniusSolve. FrobeniusF is now available as the newly added ...

DiagramPlot (Computational Geometry Package Symbol)

DiagramPlot[{{x_1, y_1}, {x_2, y_2}, ...}] plots the Voronoi diagram of the points {{x_1, y_1}, ...}. DiagramPlot[{{x_1, y_1}, {x_2, y_2}, ...}, {q_1, q_2, ...}, val] plots ...

PlanarGraphPlot (Computational Geometry Package Symbol)

PlanarGraphPlot[{{x_1, y_1}, {x_2, y_2}, ...}] plots the Delaunay triangulation of the points {{x_1, y_1}, ...}.PlanarGraphPlot[{{x_1, y_1}, {x_2, y_2}, ...}, g] plots the ...

MicroscopePlot (Computer Arithmetic Package Symbol)

MicroscopePlot[f, {x, a}] plots the expression f in a small neighborhood of a using machine arithmetic.MicroscopePlot[f, {x, a, n}] plots f from a - n ulps to a + n ulps.

EconomizedRationalApproximation (Function Approximations Package Symbol)

EconomizedRationalApproximation[expr, {x, {x_0, x_1}, m, n}] gives the economized rational approximation to expr that is good over the interval x_0 to x_1, with numerator ...

GeneralRationalInterpolation (Function Approximations Package Symbol)

GeneralRationalInterpolation[{f_x, f_y}, {t, m, n}, x, {t_1, ..., t m + n + 1}]] gives the rational polynomial function of x, with numerator order m and denominator order n, ...

Aggressive (Graph Utilities Package Symbol)

Aggressive is an option to PseudoDiameter that specifies whether an extra iteration is to be carried out.

MinimumBandwidthOrdering (Graph Utilities Package Symbol)

MinimumBandwidthOrdering[g] attempts to find a vertex ordering that minimizes the bandwidth of the undirected graph g.MinimumBandwidthOrdering[m] attempts to find row and ...