82 const Options& options) -> std::pair<unsigned int, bool>;
85 const Options& options) -> std::pair<unsigned int, bool>;
88 const Options& options) -> std::pair<unsigned int, bool> {
void extract_autocorr(Vec2 &vr)
Extract autocorrelation quadratic factor.
auto pbairstow_autocorr_st(const std::vector< double > &coeffs, std::vector< Vec2 > &vrs, const Options &options) -> std::pair< unsigned int, bool >
Multi-threading Bairstow's method (specific for auto-correlation function)
auto poly_from_autocorr_factors(const std::vector< Vec2 > &vrs) -> std::vector< double >
Reconstruct a monic polynomial from its autocorrelation quadratic factors.
auto pbairstow_autocorr_mt(const std::vector< double > &coeffs, std::vector< Vec2 > &vrs, const Options &options) -> std::pair< unsigned int, bool >
auto pbairstow_autocorr(const std::vector< double > &coeffs, std::vector< Vec2 > &vrs, const Options &options) -> std::pair< unsigned int, bool >
Definition autocorr.hpp:87
auto initial_autocorr(const std::vector< double > &coeffs) -> std::vector< Vec2 >
Initial guess for the parallel Bairstow method (specific for auto-correlation function)
Options for convergence-based algorithms.
Definition config.hpp:15
Vector2.
Definition vector2.hpp:19
2x2 matrix template for polynomial root-finding
Parallel Bairstow root-finding methods for real polynomials.