Search Results for ""

The Fritsch graph is the 9-node planar graph illustrated above that tangles the Kempe chains in Kempe's algorithm and thus provides an example of how Kempe's supposed proof ...

The generalized Gell-Mann matrices are the n^2-1 matrices generating the Lie algebra associated to the special unitary group SU(n), n>=2. As their name suggests, these ...

Turing machines are defined by sets of rules that operate on four parameters: (state, tape cell color, operation, state). Let the states and tape cell colors be numbered and ...

A shortest path between two graph vertices (u,v) of a graph (Skiena 1990, p. 225). There may be more than one different shortest paths, all of the same length. Graph ...

A two-dimensional generalization of the Haar transform which is used for the compression of astronomical images. The algorithm consists of dividing the 2^N×2^N image into ...

A root-finding algorithm also known as the tangent hyperbolas method or Halley's rational formula. As in Halley's irrational formula, take the second-order Taylor series ...

A relation expressing a sum potentially involving binomial coefficients, factorials, rational functions, and power functions in terms of a simple result. Thanks to results by ...

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 Jacobi method is a method of solving a matrix equation on a matrix that has no zeros along its main diagonal (Bronshtein and Semendyayev 1997, p. 892). Each diagonal ...

Let G be a planar graph whose vertices have been properly colored and suppose v in V(G) is colored C_1. Define the C_1C_2-Kempe chain containing v to be the maximal connected ...