/** * Returns pivot permutation vector as a one-dimensional double array * * @return (double) piv */ protected double[] getDoublePivot() { int m = m(); double[] vals = new double[m]; for (int i = 0; i < m; i++) { vals[i] = piv[i]; } return vals; }
/** * Returns pivot permutation vector as a one-dimensional double array * * @return (double) piv */ protected double[] getDoublePivot() { int m = m(); double[] vals = new double[m]; for (int i = 0; i < m; i++) { vals[i] = piv[i]; } return vals; }
/** * Returns pivot permutation vector as a one-dimensional double array * * @return (double) piv */ private double[] xgetDoublePivot() { int m = m(); double[] vals = new double[m]; for (int i = 0; i < m; i++) { vals[i] = piv[i]; } return vals; } }
/** * Returns pivot permutation vector as a one-dimensional double array * * @return (double) piv */ private double[] xgetDoublePivot() { int m = m(); double[] vals = new double[m]; for (int i = 0; i < m; i++) { vals[i] = piv[i]; } return vals; } }
/** * Returns the determinant, <tt>det(A)</tt>. * * @exception IllegalArgumentException * if <tt>A.rows() != A.columns()</tt> (Matrix must be * square). */ public double det() { int m = m(); int n = n(); if (m != n) throw new IllegalArgumentException("Matrix must be square."); if (!isNonsingular()) return 0; // avoid rounding errors double det = pivsign; for (int j = 0; j < n; j++) { det *= LU.getQuick(j, j); } return det; }
/** * Returns the determinant, <tt>det(A)</tt>. * * @exception IllegalArgumentException * if <tt>A.rows() != A.columns()</tt> (Matrix must be * square). */ public double det() { int m = m(); int n = n(); if (m != n) throw new IllegalArgumentException("Matrix must be square."); if (!isNonsingular()) return 0; // avoid rounding errors double det = pivsign; for (int j = 0; j < n; j++) { det *= LU.getQuick(j, j); } return det; }
int m = m(); int n = n(); if (B.size() != m)
int m = m(); int n = n(); if (B.size() != m)
int m = m(); int n = n(); if (B.rows() != m)
int m = m(); int n = n(); if (B.rows() != m)
final int CUT_OFF = 10; algebra.property().checkRectangular(LU); int m = m(); int n = n(); if (B.rows() != m)
final int CUT_OFF = 10; algebra.property().checkRectangular(LU); int m = m(); int n = n(); if (B.rows() != m)