Method SolveLinearSystem

src/LNLib/Mathematics/Utils/MathUtils.cpp:258–289

}

std::vector<std::vector<double>> LNLib::MathUtils::SolveLinearSystem(
    const std::vector<std::vector<double>>& matrix,
    const std::vector<std::vector<double>>& right)
{
    if (matrix.empty() || right.empty() || matrix[0].empty() || right[0].empty()) {
        return {};
    }

    int rows = static_cast<int>(matrix.size());
    int cols = static_cast<int>(matrix[0].size());
    int rhsCols = static_cast<int>(right[0].size());

    Eigen::MatrixXd A(rows, cols);
    for (int i = 0; i < rows; ++i) {
        A.row(i) = Eigen::VectorXd::Map(&matrix[i][0], matrix[i].size());
    }

    Eigen::MatrixXd B(right.size(), rhsCols);
    for (int i = 0; i < right.size(); ++i) {
        B.row(i) = Eigen::VectorXd::Map(&right[i][0], right[i].size());
    }

    Eigen::MatrixXd X = A.colPivHouseholderQr().solve(B);

    std::vector<std::vector<double>> result(cols, std::vector<double>(rhsCols));
    for (int j = 0; j < rhsCols; ++j) {
        for (int i = 0; i < cols; ++i) {
            result[i][j] = X(i, j);
        }
    }
    return result;
}
bool LNLib::MathUtils::SolveLinearSystemBanded(int matrixDimension, const std::vector<std::vector<double>>& matrix, int bandwidth, const std::vector<std::vector<double>>& right, std::vector<std::vector<double>>& result)
{
    int sbw = bandwidth / 2;