double function ( D1Matrix64F arg0 ) { double loc0 = 0 ; int loc1 = arg0 . getNumElements ( ) ; for ( int loc2 = 0 ; loc2 < loc1 ; loc2 ++ ) { double loc3 = arg0 . get ( loc2 ) ; loc0 += loc3 * loc3 ; } return Math . sqrt ( loc0 ) ; }
this implementation of the frobenius norm is a straight forward implementation and can be susceptible for overflow/underflow issues . a more resilient implementation is #normf . concode_field_sep PlaceHolder placeHolder concode_field_sep double inducedP2 concode_elem_sep double inducedP1 concode_elem_sep void normalizeF concode_elem_sep double normF concode_elem_sep double fastNormP concode_elem_sep double fastNormP2 concode_elem_sep double normPInf concode_elem_sep double conditionP concode_elem_sep double elementP concode_elem_sep double inducedPInf concode_elem_sep double normP concode_elem_sep double normP2 concode_elem_sep double fastElementP concode_elem_sep double normP1 concode_elem_sep double conditionP2