2019-01-04 08:45:22 +00:00
|
|
|
// Copyright (c) 2019, Vincent SAMY
|
|
|
|
// All rights reserved.
|
|
|
|
|
|
|
|
// Redistribution and use in source and binary forms, with or without
|
|
|
|
// modification, are permitted provided that the following conditions are met:
|
2019-10-10 02:31:00 +00:00
|
|
|
|
|
|
|
// 1. Redistributions of source code must retain the above copyright notice,
|
|
|
|
// this list of conditions and the following disclaimer.
|
|
|
|
// 2. Redistributions in binary form must reproduce the above copyright notice,
|
|
|
|
// this list of conditions and the following disclaimer in the documentation
|
|
|
|
// and/or other materials provided with the distribution.
|
2019-01-04 08:45:22 +00:00
|
|
|
|
|
|
|
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
|
|
|
|
// ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
|
|
|
|
// WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
|
2019-10-10 02:31:00 +00:00
|
|
|
// DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
|
|
|
|
// ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
|
2019-01-04 08:45:22 +00:00
|
|
|
// (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
|
|
|
|
// LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
|
|
|
|
// ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
|
|
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
|
|
|
|
// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
|
2019-10-10 02:31:00 +00:00
|
|
|
// The views and conclusions contained in the software and documentation are those
|
|
|
|
// of the authors and should not be interpreted as representing official policies,
|
|
|
|
// either expressed or implied, of the FreeBSD Project.
|
|
|
|
|
2018-10-25 09:43:21 +00:00
|
|
|
#pragma once
|
|
|
|
|
|
|
|
#include "type_checks.h"
|
2018-12-14 10:04:41 +00:00
|
|
|
#include "typedefs.h"
|
2018-10-25 09:43:21 +00:00
|
|
|
#include <complex>
|
|
|
|
|
2019-01-04 08:45:22 +00:00
|
|
|
namespace difi {
|
2018-10-25 09:43:21 +00:00
|
|
|
|
2019-01-04 08:15:03 +00:00
|
|
|
/*! \brief Compute polynome coefficients from roots.
|
|
|
|
*
|
|
|
|
* This is done through Vieta's algorithm: \see https://en.wikipedia.org/wiki/Vieta%27s_formulas
|
|
|
|
* \tparam T Floating type.
|
|
|
|
*/
|
2018-10-25 09:43:21 +00:00
|
|
|
template <typename T>
|
2018-10-26 07:18:08 +00:00
|
|
|
struct VietaAlgo {
|
|
|
|
static_assert(std::is_arithmetic<internal::complex_sub_type_t<T>>::value, "This struct can only accept arithmetic types or complex.");
|
|
|
|
|
2019-01-04 08:15:03 +00:00
|
|
|
/*! \brief Vieta's algorithm.
|
|
|
|
* \note The function return the coefficients in the decreasing order: \f$a_n X^n + a_{n-1}X^{n-1} + ... + a1X + a0\f$.
|
|
|
|
* \param roots Set of all roots of the polynome.
|
|
|
|
* \return Coefficients of the polynome.
|
|
|
|
*/
|
|
|
|
static vectX_t<T> polyCoeffFromRoot(const vectX_t<T>& roots);
|
2018-10-25 09:43:21 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
template <typename T>
|
2019-01-04 08:15:03 +00:00
|
|
|
vectX_t<T> VietaAlgo<T>::polyCoeffFromRoot(const vectX_t<T>& roots)
|
2018-10-25 09:43:21 +00:00
|
|
|
{
|
2019-01-04 08:15:03 +00:00
|
|
|
vectX_t<T> coeffs = vectX_t<T>::Zero(roots.size() + 1);
|
2018-12-14 10:04:41 +00:00
|
|
|
coeffs(0) = T(1);
|
2019-01-04 08:15:03 +00:00
|
|
|
for (Eigen::Index i = 0; i < roots.size(); ++i) {
|
2018-12-17 05:48:44 +00:00
|
|
|
for (Eigen::Index k = i + 1; k > 0; --k) {
|
2019-01-04 08:15:03 +00:00
|
|
|
coeffs(k) -= roots(i) * coeffs(k - 1);
|
2018-10-25 09:43:21 +00:00
|
|
|
}
|
|
|
|
}
|
2018-12-14 10:04:41 +00:00
|
|
|
|
|
|
|
return coeffs;
|
2018-10-25 09:43:21 +00:00
|
|
|
}
|
|
|
|
|
2019-01-04 08:45:22 +00:00
|
|
|
} // namespace difi
|