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
14
namespace
Ikarus::utils
{
28
std::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
polyfit.hh
Polynomial fitting of data.
Ikarus::utils::findLineSegment
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.
Ikarus::utils
Definition:
algorithms.hh:17
ikarus
utils
findlinesegment.hh
© Copyright 2021-
Ikarus project contributors
(doc pages:
CC-BY 4.0
/ code examples:
LGPLv3 or later
)
0.4.1 Generated by
1.9.4