Search Results for ""

A rule for polynomial computation which both reduces the number of necessary multiplications and results in less numerical instability due to potential subtraction of one ...

Let X={x_1>=x_2>=...>=x_n|x_i in R} (1) and Y={y_1>=y_2>=...>=y_n|y_i in R}. (2) Then there exists an n×n Hermitian matrix with eigenvalues X and diagonal elements Y iff ...

Given a short exact sequence of modules 0->A->B->C->0, (1) let ...->P_2->^(d_2)P_1->^(d_1)P_0->^(d_0)A->0 (2) ...->Q_2->^(f_2)Q_1->^(f_1)Q_0->^(f_0)C->0 (3) be projective ...

A univariate distribution proportional to the F-distribution. If the vector d is Gaussian multivariate-distributed with zero mean and unit covariance matrix N_p(0,I) and M is ...

There are three flavors of Hough transform. The first (original) was used to detect straight lines in bubble chamber images. The technique parameterizes pattern space, then ...

Householder (1953) first considered the matrix that now bears his name in the first couple of pages of his book. A Householder matrix for a real vector v can be implemented ...

A root-finding algorithm based on the iteration formula x_(n+1)=x_n-(f(x_n))/(f^'(x_n)){1+(f(x_n)f^('')(x_n))/(2[f^'(x_n)]^2)}. This method, like Newton's method, has poor ...

Let P be a primitive polytope with eight vertices. Then there is a unimodular map that maps P to the polyhedron whose vertices are (0, 0, 0), (1, 0, 0), (0, 1, 0), (0, 0, 1), ...

A (presumably autobiographical) character in one of astrophysicist Fred Hoyle's novels opined the following. "I figure that if to be totally known and totally loved is worth ...

Let a set of vertices A in a connected graph G be called convex if for every two vertices x,y in A, the vertex set of every (x,y) graph geodesic lies completely in A. Also ...