Search Results for ""
10421 - 10430 of 13134 for complexity theorySearch Results
Divide a set of data into two groups (high and low) of equal size at the statistical median if there is an even number of data points, or two groups consisting of points on ...
An array A=a_(ij), i,j>=1 of positive integers is called an interspersion if 1. The rows of A comprise a partition of the positive integers, 2. Every row of A is an ...
The tangent space at a point p in an abstract manifold M can be described without the use of embeddings or coordinate charts. The elements of the tangent space are called ...
An invariant set S subset R^n is said to be a C^r (r>=1) invariant manifold if S has the structure of a C^r differentiable manifold (Wiggins 1990, p. 14). When stable and ...
The inverse erf function is the inverse function erfc^(-1)(z) of erfc(x) such that erfc(erfc^(-1)(x))=erfc^(-1)(erfc(x)), (1) with the first identity holding for 0<x<2 and ...
Inverse function integration is an indefinite integration technique. While simple, it is an interesting application of integration by parts. If f and f^(-1) are inverses of ...
The inverse Gaussian distribution, also known as the Wald distribution, is the distribution over [0,infty) with probability density function and distribution function given ...
The inverse function of the Gudermannian y=gd^(-1)phi gives the vertical position y in the Mercator projection in terms of the latitude phi and may be defined for 0<=x<pi/2 ...
The inverse haversine function hav^(-1)(z) is defined by hav^(-1)(z)=2sin^(-1)(sqrt(z)). (1) The inverse haversine is implemented in the Wolfram Language as ...
The Radon inverse transform is an integral transform that has found widespread application in the reconstruction of images from medical CT scans. The Radon and inverse Radon ...
...
View search results from all Wolfram sites (28442 matches)

