Hubbry Logo
search
logo

Guard digit

logo
Community Hub0 Subscribers
Write something...
Be the first to start a discussion here.
Be the first to start a discussion here.
See all
Guard digit

In numerical analysis, one or more guard digits can be used to reduce the amount of roundoff error.

Suppose that the final result of a long, multi-step calculation can be safely rounded off to N decimal places. That is to say, the roundoff error introduced by this final roundoff makes a negligible contribution to the overall uncertainty.

However, it is quite likely that it is not safe to round off the intermediate steps in the calculation to the same number of digits. Be aware that roundoff errors can accumulate. If M decimal places are used in the intermediate calculation, we say there are M−N guard digits.

Guard digits are also used in floating point operations in most computer systems.

As an example, consider the subtraction . Here, the product notation indicates a binary floating point representation with the exponent of the representation given as a power of two and with the significand given with three bits after the binary point. To compute the subtraction it is necessary to change the forms of these numbers so that they have the same exponent, and so that when the product notation is expanded the resulting numbers have their binary points lined up with each other. Shifting the second operand into position, as , gives it a fourth digit after the binary point. This creates the need to add an extra digit to the first operand—a guard digit—putting the subtraction into the form .

Performing this operation gives as the result or .

Without using a guard digit the subtraction would be performed only to three bits of precision, as , yielding or , twice as large as the correct result. Thus, in this example, the use of a guard digit led to a more accurate result.

An example of the error caused by floating point roundoff is illustrated in the following C code.

See all
User Avatar
No comments yet.