version 0.4.1
findlinesegment.hh
Go to the documentation of this file.
1// SPDX-FileCopyrightText: 2021-2024 The Ikarus Developers mueller@ibb.uni-stuttgart.de
2// SPDX-License-Identifier: LGPL-3.0-or-later
3
9#pragma once
10#include "polyfit.hh"
11
12#include <Eigen/Core>
13
14namespace Ikarus::utils {
28std::tuple<Dune::Functions::Polynomial<double>, decltype(Eigen::seq(0, 0))> findLineSegment(const Eigen::VectorXd& x,
29 const Eigen::VectorXd& y,
30 int segmentSize);
31} // namespace Ikarus::utils
Polynomial fitting of data.
std::tuple< Dune::Functions::Polynomial< double >, decltype(Eigen::seq(0, 0))> findLineSegment(const Eigen::VectorXd &x, const Eigen::VectorXd &y, int segmentSize)
Find a linear segment in a set of data points.
Definition: algorithms.hh:17