a binary machine that carries 30 bits in the fractional part of each floating point number is designed to round a number up or down correctly to get the closest floating point number. what simple upper bound can be given for the relative error in this rounding process?
Added by Hayat B.
Step 1
Relative error is a measure of the difference between the actual number and the rounded number, relative to the magnitude of the actual number. It is often expressed as a fraction or a percentage. Show more…
Show all steps
Your feedback will help us improve your experience
Breanna Ollech and 58 other Linear Algebra educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Recommended Videos
Consider a decimal machine in which floating point numbers are represented with a precision of 12 decimal places. Compute the relative error for the following numbers (assume numbers are rounded correctly): a. 1 - 2^-7
Abdul W.
What is the best approximation to the square root of 2 that can be expressed in the 8 -bit floating-point format described in Figure $1.24 ?$ What value is actually obtained if this approximation is squared by a machine using this floating-point format?
What is the best approximation to the value one-tenth that can be represented using the 8 -bit floating-point format described in Figure $1.24 ?$
Recommended Textbooks
Linear Algebra and Its Applications
Differential Equations and Linear Algebra
Elementary Linear Algebra: Applications Version
Transcript
Watch the video solution with this free unlock.
EMAIL
PASSWORD