When I read the book "Accuracy and Stability of Numerical Algorithms", I came to the concept "correct significant digits" which I really can't understand.
The definition in the book is
Here is a possible definition of correct significant digits: an approximation x' to x has p correct significant digits if x' and x round to the same number to p significant digits. Rounding is the act of replacing a given number by the nearest ...
I was confused with the description of x' and x round to the same number to p significant digits.
Does that mean the absolute value of x' minus x, and the significant digits of the absolute value is the correct significant digits? I googled it but there was nothing else helped. Could any one give me an example, or more precise description? Thanks, guys.
Editor's note: original picture of text.
You have a function
round(val,p)that roundsvalto the nearest number withpsignificant digits (with the convention that if there is a tie, you round upwards). So round(0.9954,3) is equal to 0.995 and round(0.9954,2)=1.0.Another way to state your definition is that
x_approxhaspcorrect significant digits toxifround(x,p)==round(x_approx,p).If
x=3.14159andx_approx=3.141585then you can say that x_approx has 6 correct digits, sinceround(x,6)==3.14159==round(x_approx,6).Note that this definition is problematic, as explained in the book, since if you have
x=.9949andx_approx=.9952thenx_approxis correct to 1 digit and three significant digits, but NOT correct to two significant digits, which is one of the reasons relative error is a preferred measurement of accuracy for approximations.