Search Results for ""

Let a graph G have exactly 2n-3 graph edges, where n is the number of graph vertices in G. Then G is "generically" rigid in R^2 iff e^'<=2n^'-3 for every subgraph of G having ...

A root-finding algorithm also called Bailey's method and Hutton's method. For a function of the form g(x)=x^d-r, Lambert's method gives an iteration function ...

An algorithm for computing the eigenvalues and eigenvectors for large symmetric sparse matrices.

The conjecture that the Artin L-function of any n-dimensional complex representation of the Galois group of a finite extension of the rational numbers Q is an Artin ...

An algorithm which isolates roots in the complex plane by generalizing one-dimensional bracketing.

A generalization of the product rule for expressing arbitrary-order derivatives of products of functions, where (n; k) is a binomial coefficient. This can also be written ...

A wavelet used in multiresolution representation to analyze the information content of images. The wavelet is defined by ...

Pick a point O in the interior of a quadrilateral which is not a parallelogram. Join this point to each of the four vertices, then the locus of points O for which the sum of ...

A type of diagram invented by Lewis Carroll (the name is an abbreviation of "Lewis") that can be used to determine the number of minimal covers of n numbers with k members.

D^*Dpsi=del ^*del psi+1/4Rpsi, where D is the Dirac operator D:Gamma(S^+)->Gamma(S^-), del is the covariant derivative on spinors, and R is the scalar curvature.