<ID> <incX> <source file> <author name>
for (nrm2=0.0, i=0; i < N; i++, X += incX) nrm2 += *X * *X; return(sqrt(nrm2));will needlessly overflow for half of the exponent range. Thus, a good implementation must either use extended precision or a scaling algorithm (such as the sum of squares used in the reference BLAS) to prevent overflow in the squaring process.