Search Results for ""

The process of approximating a quantity, be it for convenience or, as in the case of numerical computations, of necessity. If rounding is performed on each of a series of ...

Hoffman (1998, p. 90) calls the sum of the exponents in the prime factorization of a number its roundness. The first few values for n=1, 2, ... are 0, 1, 1, 2, 1, 2, 1, 3, 2, ...

Roundoff error is the difference between an approximation of a number used in computation and its exact (correct) value. In certain types of computation, roundoff error can ...

An n-route is defined as a walk of length n with specified initial point in which no line succeeds itself.

Consider the characteristic equation |lambdaI-A|=lambda^n+b_1lambda^(n-1)+...+b_(n-1)lambda+b_n=0 (1) determining the n eigenvalues lambda of a real n×n square matrix A, ...

If the sides of a triangle are divided in the ratios lambda:1, mu:1, and nu:1, the cevians form a central triangle whose area is ...

A row-convex polyomino is a self-avoiding convex polyomino such that the intersection of any horizontal line with the polyomino has at most two connected components. A ...

The vector space generated by the rows of a matrix viewed as vectors. The row space of a n×m matrix A with real entries is a subspace generated by n elements of R^m, hence ...

A 1×n matrix [a_(11) a_(12) ... a_(1n)].

The Royle graphs are the two unique simple graphs on eight nodes whose sigma polynomials have nonreal roots (Read and Wilson 1998, p. 265). The sigma polynomials of these ...