Search Results for ""
891 - 900 of 1788 for Finite_difference_methodSearch Results
In 1979, Conway and Norton discovered an unexpected intimate connection between the monster group M and the j-function. The Fourier expansion of j(tau) is given by (1) (OEIS ...
Simplemindedly, a number theoretic transform is a generalization of a fast Fourier transform obtained by replacing e^(-2piik/N) with an nth primitive root of unity. This ...
Numerical differentiation is the process of finding the numerical value of a derivative of a given function at a given point. In general, numerical differentiation is more ...
Let S be a subset of a metric space. Then the set S is open if every point in S has a neighborhood lying in the set. An open set of radius r and center x_0 is the set of all ...
The pair group of a group G is the group that acts on the 2-subsets of {1,...,p} whose permutations are induced by G. Pair groups can be calculated using PairGroup[g] in the ...
Given a smooth manifold M with an open cover U_i, a partition of unity subject to the cover U_i is a collection of smooth, nonnegative functions psi_i, such that the support ...
A point group is a group of symmetry operations which all leave at least one point unmoved. Although an isolated object may have an arbitrary Schönflies symbol, the ...
The highest order power in a univariate polynomial is known as its order (or, more properly, its polynomial degree). For example, the polynomial ...
A set S of integers is said to be recursive if there is a total recursive function f(x) such that f(x)=1 for x in S and f(x)=0 for x not in S. Any recursive set is also ...
A regular number, also called a finite decimal (Havil 2003, p. 25), is a positive number that has a finite decimal expansion. A number such as 1/3=0.33333... which is not ...
...
View search results from all Wolfram sites (32028 matches)

