CholeskyDecomposition function ( ) { int loc0 = QR [ 0 ] . length ; double [ ] [ ] loc1 = new double [ loc0 ] [ ] ; for ( int loc2 = 0 ; loc2 < loc0 ; loc2 ++ ) { loc1 [ loc2 ] = new double [ loc2 + 1 ] ; loc1 [ loc2 ] [ loc2 ] = Rdiagonal [ loc2 ] ; for ( int loc3 = 0 ; loc3 < loc2 ; loc3 ++ ) { loc1 [ loc2 ] [ loc3 ] = QR [ loc3 ] [ loc2 ] ; } } return CholeskyDecomposition . newInstance ( loc1 ) ; }
returns the cholesky decomposition of a ` a. concode_field_sep double[][] QR concode_elem_sep double[] Rdiagonal concode_elem_sep boolean singular concode_field_sep boolean isFullColumnRank concode_elem_sep double[][] inverse concode_elem_sep void rotate concode_elem_sep double[][] getH concode_elem_sep boolean isSingular concode_elem_sep void solve concode_elem_sep void solve concode_elem_sep void solve concode_elem_sep void solve concode_elem_sep void update concode_elem_sep double[][] getQ concode_elem_sep double[][] getR