The function FindRoot has a Jacobian option; the functions FindMinimum, FindMaximum, and FindFit have a Gradient option; and the "Newton" method has a method option Hessian. ...

BellY[n, k, {x_1, ..., x n - k + 1}] gives the partial Bell polynomial Y n, k (x_1, ..., x n - k + 1). BellY[n, k, m] gives the generalized partial Bell polynomial of a ...

expr[[i]] or Part[expr, i] gives the i\[Null]^th part of expr. expr[[-i]] counts from the end. expr[[i, j, ...]] or Part[expr, i, j, ...] is equivalent to expr[[i]][[j]] .... ...

WaveletImagePlot[dwd] plots the basis tree of wavelet image coefficients in the DiscreteWaveletData dwd.WaveletImagePlot[dwd, r] plots coefficients up to refinement level ...

The basis for a nonlinear conjugate gradient method is to effectively apply the linear conjugate gradient method, where the residual is replaced by the gradient. A model ...

MaximalIndepndentEdgeSet[g] gives a maximal independent edge set of an undirected graph g.

InternallyBalancedDecomposition[ss] yields the internally balanced decomposition of the StateSpaceModel object ss. The result is a list {s, ib} where s is the similarity ...

Supporting a large number of numerical integration methods for differential equations is a lot of work. In order to cut down on maintenance and duplication of code, common ...

LinkRankMatrix[g] returns the link rank of the graph g, in the form of a sparse matrix. The link rank of an edge u -> v is defined as the PageRanks of u, divided by the ...

VertexList[g] gives a list of all vertices in the graph g.