WaveletBestBasis[dwd] computes a best basis representation in the DiscreteWaveletData object dwd.WaveletBestBasis[dwd, cspec] computes a best basis representation using the ...
int MLError (MLINK link) returns a value identifying the last error to occur on link. MLError() returns MLEOK if no error has occurred since the previous call to ...
BiorthogonalSplineWavelet[] represents a biorthogonal spline wavelet of order 4 and dual order 2.BiorthogonalSplineWavelet[n, m] represents a biorthogonal spline wavelet of ...
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, ...
GraphPlot[{v i 1 -> v j 1, v i 2 -> v j 2, ...}] generates a plot of the graph in which vertex v_ik is connected to vertex v_jk.GraphPlot[{{v i 1 -> v j 1, lbl_1}, ...}] ...
LQRegulatorGains[ss, {q, r}] gives the optimal state feedback gain matrix for the StateSpaceModel object ss and the quadratic cost function with state and control weighting ...
ReverseBiorthogonalSplineWavelet[] represents a reverse biorthogonal spline wavelet of order 4 and dual order 2.ReverseBiorthogonalSplineWavelet[n, m] represents a reverse ...
All the test problems presented in [MGH81] have been coded into Mathematica in the Optimization`UnconstrainedProblems` package. A data structure is used so that the problems ...
CylindricalDecomposition[ineqs, {x_1, x_2, ...}] finds a decomposition of the region represented by the inequalities ineqs into cylindrical parts whose directions correspond ...
AdjacencyGraph[amat] gives the graph with adjacency matrix amat.AdjacencyGraph[{v_1, v_2, ...}, amat] gives the graph with vertices v_i and adjacency matrix amat.