Skip to Main Content
Computer Arithmetic and Validity
book

Computer Arithmetic and Validity

by Ulrich Kulisch
April 2013
Intermediate to advanced content levelIntermediate to advanced
456 pages
16h 7m
English
De Gruyter
Content preview from Computer Arithmetic and Validity
352 Chapter 9 Sample applications
Definition 9.9. Let x and y be long intervals, then
x ı y :Df ı j 2 x ^ 2 yg,forı2fC, , , =g,
with 0 y for ıD=.
Of course, in general, this theoretical result is not representable on the computer.
Here the result must be a long interval again. We do not, however, require that it is the
least enclosing long interval of some prescribed length. But we must require that the
computed long interval z is a superset of the result defined in Definition 9.9: x ıy z.
Not to require optimality of the result gives room for a compromise between tightness
of the enclosure and the efficiency of the implementation.
Negation.
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

Arithmetic and Logic in Computer Systems

Arithmetic and Logic in Computer Systems

Mi Lu
Interval Analysis

Interval Analysis

Günter Mayer

Publisher Resources

ISBN: 9783110301731