Search Results for ""

Consider an n×n (0, 1)-matrix such as [a_(11) a_(23) ; a_(22) a_(34); a_(21) a_(33) ; a_(32) a_(44); a_(31) a_(43) ; a_(42) a_(54); a_(41) a_(53) ; a_(52) a_(64)] (1) for ...

The harmonic parameter of a polyhedron is the weighted mean of the distances d_i from a fixed interior point to the faces, where the weights are the areas A_i of the faces, ...

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 ...

Also called Radau quadrature (Chandrasekhar 1960). A Gaussian quadrature with weighting function W(x)=1 in which the endpoints of the interval [-1,1] are included in a total ...

Newton's method for finding roots of a complex polynomial f entails iterating the function z-[f(z)/f^'(z)], which can be viewed as applying the Euler backward method with ...

If r is an algebraic number of degree n, then the totality of all expressions that can be constructed from r by repeated additions, subtractions, multiplications, and ...

The pentagonal hexecontahedron is the 60-faced dual polyhedron of the snub dodecahedron A_8 (Holden 1971, p. 55). It is Wenninger dual W_(18). A tetrahedron 10-compound, cube ...

Simpson's rule is a Newton-Cotes formula for approximating the integral of a function f using quadratic polynomials (i.e., parabolic arcs instead of the straight line ...

The first strong law of small numbers (Gardner 1980, Guy 1988, 1990) states "There aren't enough small numbers to meet the many demands made of them." The second strong law ...

A unimodular matrix is a real square matrix A with determinant det(A)=+/-1 (Born and Wolf 1980, p. 55; Goldstein 1980, p. 149). More generally, a matrix A with elements in ...