/** * Computes the inverse of this diagonal matrix. * <p> * Note: this method will use a singularity threshold of 0, * use {@link #inverse(double)} if a different threshold is needed. * * @return the inverse of {@code m} * @throws SingularMatrixException if the matrix is singular * @since 3.3 */ public DiagonalMatrix inverse() throws SingularMatrixException { return inverse(0); }
return ((DiagonalMatrix) matrix).inverse(threshold); } else { QRDecomposition decomposition = new QRDecomposition(matrix, threshold);
/** * Computes the inverse of this diagonal matrix. * <p> * Note: this method will use a singularity threshold of 0, * use {@link #inverse(double)} if a different threshold is needed. * * @return the inverse of {@code m} * @throws SingularMatrixException if the matrix is singular * @since 3.3 */ public DiagonalMatrix inverse() throws SingularMatrixException { return inverse(0); }
/** * Computes the inverse of this diagonal matrix. * <p> * Note: this method will use a singularity threshold of 0, * use {@link #inverse(double)} if a different threshold is needed. * * @return the inverse of {@code m} * @throws SingularMatrixException if the matrix is singular * @since 3.3 */ public DiagonalMatrix inverse() throws SingularMatrixException { return inverse(0); }
return ((DiagonalMatrix) matrix).inverse(threshold); } else { QRDecomposition decomposition = new QRDecomposition(matrix, threshold);
return ((DiagonalMatrix) matrix).inverse(threshold); } else { QRDecomposition decomposition = new QRDecomposition(matrix, threshold);