Answered step by step
Verified Expert Solution
Question
1 Approved Answer
Consider a (binary) floating point system of the form (Ls182)2 x 2n where m I-31, 321. calculate the relative error, with respect to 2-norm if
Consider a (binary) floating point system of the form (Ls182)2 x 2n where m I-31, 321. calculate the relative error, with respect to 2-norm if we convert the vector x R3 to the given floating point system, when converting to floating point, first convert to a binary number then truncate any additional bits 5.75000001 x-1.0625000 1.0000000 Note: We are interested in the representation accuracy of floating point. So assume that all operations performed (addition, subtraction, etc.) do not increase the error relative error(x)umber (rtol-0.01, atol-0.001) What is the tightest bound on this relative error for all x in the normalized floating point range? Try using the bound for the reals and extend this to IRd and hence R3 O (a) 2 O (b) 0.75 O (c) 1.299038105676658 O (d) 0.25 Consider a (binary) floating point system of the form (Ls182)2 x 2n where m I-31, 321. calculate the relative error, with respect to 2-norm if we convert the vector x R3 to the given floating point system, when converting to floating point, first convert to a binary number then truncate any additional bits 5.75000001 x-1.0625000 1.0000000 Note: We are interested in the representation accuracy of floating point. So assume that all operations performed (addition, subtraction, etc.) do not increase the error relative error(x)umber (rtol-0.01, atol-0.001) What is the tightest bound on this relative error for all x in the normalized floating point range? Try using the bound for the reals and extend this to IRd and hence R3 O (a) 2 O (b) 0.75 O (c) 1.299038105676658 O (d) 0.25
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started