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
Sectio n 7.2 Arithmetic interval operations 237
precision arithmetic even if there is only one solution in the given interval. In con-
trast to this, the interval version of Newton’s method is globally convergent. It never
fails, not even in rounded arithmetic. Newton’s m ethod reaches its ultimate elegance
and power in the extended interval Newton method. It yields enclosures of all single
zeros in a given domain. It is quadratically convergent. The key operation to achieve
these fascinating properties is division by an interval which contains zero. It separates
different zeros from each other. A method which provides for computation of all the
ze ...
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