Calculations that can be proven not to magnify approximation errors are called numerically stable.

An algorithm is called numerically stable if an error, whatever its cause, does not grow to be much larger during the calculation.

They can be evaluated reasonably quickly by numerically stable and accurate algorithms.

This makes the computation of the basis functions numerically stable.

A more numerically stable expression of the rotation angle is the following:

At present, the Italian Australian community is numerically stable and well settled.

This explicit method is known to be numerically stable and convergent whenever .

Paige[1972] and other works show that the following procedure is the most numerically stable.

The recursive formula is not numerically stable, and should be avoided if is greater than approximately 20.

B-splines can be evaluated in a numerically stable way by the de Boor algorithm.