diff --git a/MathLib/LinAlg/Eigen/EigenMatrix.h b/MathLib/LinAlg/Eigen/EigenMatrix.h index faa4e8af93ec9b2cf98f330a51c75b2b49cf039a..16478520e817851541943707bac9097c93cb4861 100644 --- a/MathLib/LinAlg/Eigen/EigenMatrix.h +++ b/MathLib/LinAlg/Eigen/EigenMatrix.h @@ -140,12 +140,6 @@ public: } */ - /// get a maximum value in diagonal entries - double getMaxDiagCoeff() const - { - return _mat.diagonal().maxCoeff(); - } - /// return always true, i.e. the matrix is always ready for use bool isAssembled() const { return true; } diff --git a/MathLib/LinAlg/Lis/LisMatrix.cpp b/MathLib/LinAlg/Lis/LisMatrix.cpp index 043ebf36e9cacdeb68baab67649e22c27b5d3350..b44d44d76a6c25a2806e351085f93bddecf58fb7 100644 --- a/MathLib/LinAlg/Lis/LisMatrix.cpp +++ b/MathLib/LinAlg/Lis/LisMatrix.cpp @@ -118,24 +118,6 @@ void LisMatrix::write(const std::string &filename) const lis_output_matrix(_AA, LIS_FMT_MM, const_cast<char*>(filename.c_str())); } -double LisMatrix::getMaxDiagCoeff() -{ - double abs_max_entry; - int ierr = lis_vector_get_value(_diag, 0, &abs_max_entry); - checkLisError(ierr); - abs_max_entry = std::abs(abs_max_entry); - for (std::size_t k(1); k<_n_rows; ++k) { - double tmp; - ierr = lis_vector_get_value(_diag, k, &tmp); - checkLisError(ierr); - if (abs_max_entry < std::abs(tmp)) { - abs_max_entry = std::abs(tmp); - } - } - - return abs_max_entry; -} - bool finalizeMatrixAssembly(LisMatrix &mat) { LIS_MATRIX &A = mat.getRawMatrix(); diff --git a/MathLib/LinAlg/Lis/LisMatrix.h b/MathLib/LinAlg/Lis/LisMatrix.h index a23a06404c7600bc358e74d2ebe334f7239e9a3f..163a9b714fd0bb1379852f932c341925b10a753b 100644 --- a/MathLib/LinAlg/Lis/LisMatrix.h +++ b/MathLib/LinAlg/Lis/LisMatrix.h @@ -111,9 +111,6 @@ public: /// printout this equation for debugging void write(const std::string &filename) const; - /// get a maximum value in diagonal entries - double getMaxDiagCoeff(); - /// return a raw Lis matrix object LIS_MATRIX& getRawMatrix() { return _AA; }