TOPICS
Search

Search Results for ""


451 - 460 of 923 for Euclidean AlgorithmSearch Results
Topology
A sequence {a_n}_(n=1)^N forms a (binary) heap if it satisfies a_(|_j/2_|)<=a_j for 2<=j<=N, where |_x_| is the floor function, which is equivalent to a_i<a_(2i) and ...
The orthogonal decomposition of a matrix into lower trapezoidal matrices.
A minimization of the maximum error for a fixed number of terms.
A sum in which subsequent terms cancel each other, leaving only initial and final terms. For example, S = sum_(i=1)^(n-1)(a_i-a_(i+1)) (1) = ...
A transpose of a doubly indexed object is the object obtained by replacing all elements a_(ij) with a_(ji). For a second-tensor rank tensor a_(ij), the tensor transpose is ...
A vertex coloring is an assignment of labels or colors to each vertex of a graph such that no edge connects two identically colored vertices. The most common type of vertex ...
The point of concurrence of the four maltitudes of a cyclic quadrilateral. Let M_(AC) and M_(BD) be the midpoints of the diagonals of a cyclic quadrilateral ABCD, and let P ...
Let M be the midpoint of the arc AMB. Pick C at random and pick D such that MD_|_AC (where _|_ denotes perpendicular). Then AD=DC+BC.
In a cyclic quadrilateral ABCD having perpendicular diagonals AC_|_BD, the perpendiculars to the sides through point T of intersection of the diagonals (the anticenter) ...
1 ... 43|44|45|46|47|48|49 ... 93 Previous Next

...