When numerically solving Hamiltonian dynamical systems it is advantageous if the numerical method yields a symplectic map. If the Hamiltonian can be written in separable ...

FullSimplify[expr] tries a wide range of transformations on expr involving elementary and special functions, and returns the simplest form it finds. FullSimplify[expr, assum] ...

Extrapolation methods are a class of arbitrary-order methods with automatic order and step-size control. The error estimate comes from computing a solution over an interval ...

This package implements primality proving. If ProvablePrimeQ[n] returns True, then the number n can be mathematically proven to be prime. In addition, PrimeQCertificate[n] ...

This example demonstrates various techniques for designing a progress bar dialog and a number of options available to wrap the reusable widget involved. Here is one technique ...

CommunityStructurePartition[g] gives the partition of a graph g into communities.

The Wolfram Lightweight Grid is a system for launching and managing remote Mathematica kernels, a key element of a Mathematica^® grid computing environment.

TransitiveClosure[g] finds the transitive closure of graph g, the supergraph of g that contains edge {x, y} if and only if there is a path from x to y.

An integration strategy is an algorithm that attempts to compute integral estimates that satisfy user-specified precision or accuracy goals. An integration strategy normally ...

Mathematical Data >, Scientific & Technical Data  >, Geographic Data >, Computational Finance >, Linguistic Data >, New in 6.0  >, New in 7.0 >, New in 8.0  >