TOPICS
Search

Search Results for ""


1211 - 1220 of 1340 for Root Finding AlgorithmSearch Results
Square line picking is the selection of pairs of points (corresponding to endpoints of a line segment) randomly placed inside a square. n random line segments can be picked ...
The number of cells in a generalized Chinese checkers board (or "centered" hexagram). Unlike the polygonal numbers, there is ambiguity in the case of the star numbers as to ...
Any four mutually tangent spheres determine six points of tangency. A pair of tangencies (t_i,t_j) is said to be opposite if the two spheres determining t_i are distinct from ...
The universal cover of a connected topological space X is a simply connected space Y with a map f:Y->X that is a covering map. If X is simply connected, i.e., has a trivial ...
A weakly binary tree is a planted tree in which all nonroot graph vertices are adjacent to at most three graph vertices. Let g(z)=sum_(i=0)^inftyg_iz^i, (1) be the generating ...
Although Bessel functions of the second kind are sometimes called Weber functions, Abramowitz and Stegun (1972) define a separate Weber function as ...
Informally, an elliptic curve is a type of cubic curve whose solutions are confined to a region of space that is topologically equivalent to a torus. The Weierstrass elliptic ...
There are many mathematical and recreational problems related to folding. Origami, the Japanese art of paper folding, is one well-known example. It is possible to make a ...
The generalized minimal residual (GMRES) method (Saad and Schultz 1986) is an extension of the minimal residual method (MINRES), which is only applicable to symmetric ...
Given a "good" graph G (i.e., one for which all intersecting graph edges intersect in a single point and arise from four distinct graph vertices), the crossing number is the ...
1 ... 119|120|121|122|123|124|125 ... 134 Previous Next

...