TOPICS
Search

Search Results for ""


421 - 430 of 554 for Brents MethodSearch Results
Given a function f(x_1,...,x_n) defined on a domain U, the graph of f is defined as the set of points (which often form a curve or surface) showing the values taken by f over ...
The reciprocal of the arithmetic-geometric mean of 1 and sqrt(2), G = 2/piint_0^11/(sqrt(1-x^4))dx (1) = 2/piint_0^(pi/2)(dtheta)/(sqrt(1+sin^2theta)) (2) = L/pi (3) = ...
The Gegenbauer polynomials C_n^((lambda))(x) are solutions to the Gegenbauer differential equation for integer n. They are generalizations of the associated Legendre ...
A generalized continued fraction is an expression of the form b_0+(a_1)/(b_1+(a_2)/(b_2+(a_3)/(b_3+...))), (1) where the partial numerators a_1,a_2,... and partial ...
A geodesic dome is a triangulation of a Platonic solid or other polyhedron to produce a close approximation to a sphere (or hemisphere). The nth order geodesation operation ...
A path in a graph G is a subgraph of G that is a path graph (West 2000, p. 20). The length of a path is the number of edges it contains. In most contexts, a path must contain ...
Heule graphs are a set of unit-distance graphs with chromatic number five derived by Marijn Heule in April 2018 to July 2918 from the 1581-vertex de Grey Graph (Heule 2018). ...
A lossless data compression algorithm which uses a small number of bits to encode common characters. Huffman coding approximates the probability for each character as a power ...
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 ...
The Lagrange interpolating polynomial is the polynomial P(x) of degree <=(n-1) that passes through the n points (x_1,y_1=f(x_1)), (x_2,y_2=f(x_2)), ..., (x_n,y_n=f(x_n)), and ...
1 ... 40|41|42|43|44|45|46 ... 56 Previous Next

...