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
340 Chapter 9 Sample applications
are performed in conventional floating-point arithmetic and thus are very fast. If the
exact scalar product is implemented in hardware it is faster than a conventional scalar
product in floating-point arithmetic.
Rump applied the method to the Hilbert matrix of dimension 20. Its condition num-
ber is of the magnitude 10
28
. To present the matrix on the computer with no rounding
errors the components are multiplied by a common factor to obtain integer entries.
Rump has shown in [562] that with an approximation of .RA/
1
R by a twofold sum
the inverse of the Hilbert matrix can be computed to least bit accuracy.
In a recen ...
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