upper bound

A Dictionary of Computing | 2004 | 599 words | Copyright

upper bound
1. of a set S on which the partial ordering < is defined. An element u with the property that s < u for all s in S. Also u is a least upper bound if, for any other upper bound v, u < v.

Since numerical computing demands the truncation of infinite arithmetic to finite arithmetic, the computation of least upper bounds of real numbers, indeed of any limit, can only be achieved to a machine tolerance, usually defined to be machine precision: the smallest epsilon eps, such that 1.0 + eps > 1.0

in computer arithmetic. See also lower bound.

2. of a matrix or vector. See array.

Cite this article
Pick a style below, and copy the text for your bibliography.

MLA
Chicago
APA

JOHN DAINTITH. "upper bound." A Dictionary of Computing. 2004. Encyclopedia.com. 27 May. 2012 <http://www.encyclopedia.com>.

JOHN DAINTITH. "upper bound." A Dictionary of Computing. 2004. Encyclopedia.com. (May 27, 2012). http://www.encyclopedia.com/doc/1O11-upperbound.html

JOHN DAINTITH. "upper bound." A Dictionary of Computing. 2004. Retrieved May 27, 2012 from Encyclopedia.com: http://www.encyclopedia.com/doc/1O11-upperbound.html

Learn more about citation styles