"Gauss–Newton" and "conjugate gradient" methods use derivatives. When Mathematica cannot compute symbolic derivatives, finite differences will be used. Computing derivatives ...
When derivatives cannot be computed symbolically, "Newton's" method will be used, but with a finite difference approximation to the Jacobian. This can have costs in terms of ...
The GUIKit framework makes it relatively easy to reuse interface definitions because of its automatic use of private symbol contexts for each instance of a definition. There ...
This example displays a dialog for finding prime numbers and alerting the user when any entered expression evaluates to a prime number. The modal version also shows how ...
PoincareSection is a setting for the option TrekGenerator that specifies that the Poincaré section for differential equations is used to generate treks.
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 ...
NeighborhoodVertices[g, i, r] gives vertices that can be reached from vertex i within r hops.NeighborhoodVertices[g, i] gives vertices that can be reached from vertex i.
PageRankVector[g] returns the page rank of the graph g.
VertexList[g] gives a list of all vertices in the graph g.
WeakComponents[g] gives a list of all weakly connected components in the undirected graph g.