TOPICS
Search

Search Results for ""


571 - 580 of 1073 for Cubic Hexagonal Close PackingSearch Results
An array is a "list of lists" with the length of each level of list the same. The size (sometimes called the "shape") of a d-dimensional array is then indicated as ...
In the biconjugate gradient method, the residual vector r^((i)) can be regarded as the product of r^((0)) and an ith degree polynomial in A, i.e., r^((i))=P_i(A)r^((0)). (1) ...
Applying the stellation process to the icosahedron gives 20+30+60+20+60+120+12+30+60+60 cells of 11 different shapes and sizes (including the icosahedron itself). The ...
A theorem outlined by Kolmogorov (1954) which was subsequently proved in the 1960s by Arnol'd (1963) and Moser (1962; Tabor 1989, p. 105). It gives conditions under which ...
The process of finding a reduced set of basis vectors for a given lattice having certain special properties. Lattice reduction algorithms are used in a number of modern ...
Given a function f(x) of a variable x tabulated at m values y_1=f(x_1), ..., y_m=f(x_m), assume the function is of known analytic form depending on n parameters ...
Given two circles with one interior to the other, if small tangent circles can be inscribed around the region between the two circles such that the final circle is tangent to ...
Zeno's paradoxes are a set of four paradoxes dealing with counterintuitive aspects of continuous space and time. 1. Dichotomy paradox: Before an object can travel a given ...
An equation of the form y=ax^3+bx^2+cx+d, (1) where the three roots of the equation coincide (and are therefore real), i.e., y=a(x-r)^3=a(x^3-3rx^2-3r^2x-r^3). (2) Loomis ...
The Georges graph, illustrated above, is 50-node graph which is the smallest currently known example of a 3-connected bicubic nonhamiltonian graph. It is implemented in the ...
1 ... 55|56|57|58|59|60|61 ... 108 Previous Next

...