Search Results for ""
1781 - 1790 of 1990 for Finite Element MethodSearch Results
As originally stated by Gould (1972), GCD{(n-1; k),(n; k-1),(n+1; k+1)} =GCD{(n-1; k-1),(n; k+1),(n+1; k)}, (1) where GCD is the greatest common divisor and (n; k) is a ...
A surface of revolution is a surface generated by rotating a two-dimensional curve about an axis. The resulting surface therefore always has azimuthal symmetry. Examples of ...
The binomial coefficient (n; k) is the number of ways of picking k unordered outcomes from n possibilities, also known as a combination or combinatorial number. The symbols ...
The golden ratio, also known as the divine proportion, golden mean, or golden section, is a number often encountered when taking the ratios of distances in simple geometric ...
An Abelian category is a category for which the constructions and techniques of homological algebra are available. The basic examples of such categories are the category of ...
The Ackermann function is the simplest example of a well-defined total function which is computable but not primitive recursive, providing a counterexample to the belief in ...
The n-Andrásfai graph is a circulant graph on 3n-1 nodes whose indices are given by the integers 1, ..., 3n-1 that are congruent to 1 (mod 3). The Andrásfai graphs have graph ...
An apodization function (also called a tapering function or window function) is a function used to smoothly bring a sampled signal down to zero at the edges of the sampled ...
The Borromean rings, also called the Borromean links (Livingston 1993, p. 10) are three mutually interlocked rings (left figure), named after the Italian Renaissance family ...
Place two solid spheres of radius 1/2 inside a hollow sphere of radius 1 so that the two smaller spheres touch each other at the center of the large sphere and are tangent to ...
...
View search results from all Wolfram sites (67569 matches)

