Unfortunately, no.<p>BCD as &quot;binary coded decimal&quot; is, effectively, useless.  Even arbitrary precision libraries tend to be faster than BCD.<p>&quot;decimal floating point&quot;, which is what I think you meant, just changes what isn&#x27;t representable.  Instead of 1&#x2F;5 causing a problem, 1&#x2F;3 causes a problem.<p>The &quot;classic&quot; problem about this is matrix operations.  Specifically, matrix inversion.  You can use interval arithmetic on matrix inversion, and you find that the intervals blow up to almost infinity after just a couple of operations even though the center of the interval is actually pretty close to the solution.  Of course, the reverse also holds: while most matricies invert relatively cleanly, there are always pathological cases that really do need humungous precision to invert.<p>PS: Don&#x27;t know why you were getting downvoted as you asked a legitimate question.