/*
* This file is part of the GreasePad distribution (https://github.com/FraunhoferIOSB/GreasePad).
* Copyright (c) 2022-2026 Jochen Meidow, Fraunhofer IOSB
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see .
*/
#ifndef MATFUN_H
#define MATFUN_H
#include
#include
#include
#include
#include
#include
namespace Matfun {
using Eigen::Matrix3d;
using Eigen::SparseMatrix;
//! check if the matrix AA is rank-deficient
[[maybe_unused]] static bool is_rank_deficient( SparseMatrix & AA, const double threshold )
{
// Eigen::ColPivHouseholderQR qr(AA);
// qr.setThreshold( T );
Eigen::SparseQR,Eigen::COLAMDOrdering> qr;
AA.makeCompressed();
qr.compute(AA);
qr.setPivotThreshold( threshold );
return ( qr.rank() < std::min( AA.rows(), AA.cols()) );
}
//! 3x3 cofactor matrix, i.e., transposed adjugate
[[nodiscard,maybe_unused]] static Matrix3d cof3(const Matrix3d &MM)
{
const Matrix3d Cof{
{ +MM(1,1)*MM(2,2) -MM(2,1)*MM(1,2),
-MM(1,0)*MM(2,2) +MM(2,0)*MM(1,2),
+MM(1,0)*MM(2,1) -MM(2,0)*MM(1,1) },
{ -MM(0,1)*MM(2,2) +MM(2,1)*MM(0,2),
+MM(0,0)*MM(2,2) -MM(2,0)*MM(0,2),
-MM(0,0)*MM(2,1) +MM(2,0)*MM(0,1) },
{ +MM(0,1)*MM(1,2) -MM(1,1)*MM(0,2),
-MM(0,0)*MM(1,2) +MM(1,0)*MM(0,2),
+MM(0,0)*MM(1,1) -MM(1,0)*MM(0,1) }};
return Cof;
}
//! signum function with sign(0):=+1
template
constexpr int sign(T val) noexcept {
return (T(0) <= val) - (val < T(0));
}
} // namespace Matfun
#endif // MATFUN_H