diff --git a/src/storm/storage/SparseMatrix.cpp b/src/storm/storage/SparseMatrix.cpp
index 324bc0477..cdeaaf9a2 100644
--- a/src/storm/storage/SparseMatrix.cpp
+++ b/src/storm/storage/SparseMatrix.cpp
@@ -1306,19 +1306,6 @@ namespace storm {
                 }
             }
         }
-
-        template<typename ValueType>
-        void SparseMatrix<ValueType>::deleteDiagonalEntries(storm::storage::BitVector const& states) {
-            // Iterate over all rows and negate all the elements that are not on the diagonal.
-            for (index_type group = 0; group < this->getRowGroupCount(); ++group) {
-                for (auto& entry : this->getRowGroup(group)) {
-                    if (entry.getColumn() == group && states[group]) {
-                        --this->nonzeroEntryCount;
-                        entry.setValue(storm::utility::zero<ValueType>());
-                    }
-                }
-            }
-        }
         
         template<typename ValueType>
         typename std::pair<storm::storage::SparseMatrix<ValueType>, std::vector<ValueType>> SparseMatrix<ValueType>::getJacobiDecomposition() const {
diff --git a/src/storm/storage/SparseMatrix.h b/src/storm/storage/SparseMatrix.h
index d4c5d6c4c..dbdd4086d 100644
--- a/src/storm/storage/SparseMatrix.h
+++ b/src/storm/storage/SparseMatrix.h
@@ -806,11 +806,6 @@ namespace storm {
              * Sets all diagonal elements to zero.
              */
             void deleteDiagonalEntries();
-
-            /*!
-             * Sets all diagonal elements to zero.
-             */
-            void deleteDiagonalEntries(storm::storage::BitVector const& states);
             
             /*!
              * Calculates the Jacobi decomposition of this sparse matrix. For this operation, the matrix must be square.