Interface MatrixDecomposition.RankRevealing<N extends java.lang.Comparable<N>>

    • Method Detail

      • countSignificant

        int countSignificant​(double threshold)
        Parameters:
        threshold - Significance limit
        Returns:
        The number of elements in the diagonal matrix that are greater than the threshold
      • getRank

        default int getRank()
        The best (and most expensive) way to get the effective numerical rank is by calculating a SingularValue decomposition and then find the number of nonnegligible singular values.
        Specified by:
        getRank in interface Provider2D.Rank
        Returns:
        The effective numerical rank (best estimate)
      • getRankThreshold

        double getRankThreshold()
      • isFullRank

        default boolean isFullRank()
        Returns:
        true if the rank is equal to the minimum of the row and column dimensions; false if not