Search Results for ""

An algorithm used to recursively construct a set of objects from the smallest possible constituent parts. Given a set of k integers (a_1, a_2, ..., a_k) with a_1<a_2<...<a_k, ...

Green's theorem is a vector identity which is equivalent to the curl theorem in the plane. Over a region D in the plane with boundary partialD, Green's theorem states ...

Given two randomly chosen n×n integer matrices, what is the probability D(n) that the corresponding determinants are relatively prime? Hafner et al. (1993) showed that ...

A heart-shaped surface given by the sextic equation (x^2+9/4y^2+z^2-1)^3-x^2z^3-9/(80)y^2z^3=0 (Taubin 1993, 1994). The figures above show a ray-traced rendering (left) and ...

The regular tessellation {6,3} consisting of regular hexagons (i.e., a hexagonal grid). In general, the term honeycomb is used to refer to a tessellation in n dimensions for ...

An interior point method is a linear or nonlinear programming method (Forsgren et al. 2002) that achieves optimization by going through the middle of the solid defined by the ...

The Johnson circumconic, a term used here for the first time, is the circumconic that passes through the vertices of both the reference triangle and the Johnson triangle. It ...

The Lehmer cotangent expansion for which the convergence is slowest occurs when the inequality in the recurrence equation b_k>=b_(k-1)^2+b_(k-1)+1. (1) for ...

On a Riemannian manifold M, there is a canonical connection called the Levi-Civita connection (pronounced lē-vē shi-vit-e), sometimes also known as the Riemannian connection ...

Matrix diagonalization is the process of taking a square matrix and converting it into a special type of matrix--a so-called diagonal matrix--that shares the same fundamental ...