|
Ginger 1.1.9
|
Facade entry points that auto-select the execution policy. More...
#include <complex>#include <utility>#include <vector>#include "aberth.hpp"#include "aberth_atomic.hpp"#include "aberth_mt.hpp"#include "autocorr.hpp"#include "autocorr_atomic.hpp"#include "autocorr_mt.hpp"#include "config.hpp"#include "rootfinding.hpp"#include "rootfinding_atomic.hpp"#include "rootfinding_mt.hpp"Go to the source code of this file.
Namespaces | |
| namespace | ginger |
| Options for convergence-based algorithms. | |
Enumerations | |
| enum class | ginger::solve_mode { ginger::automatic , ginger::sequential , ginger::multi_threaded , ginger::atomic } |
| Execution policy selection for the solver facades. More... | |
Functions | |
| auto | ginger::solve_pbairstow_even (const std::vector< double > &coeffs, std::vector< Vec2 > &vrs, const Options &options, solve_mode mode=solve_mode::automatic) -> std::pair< unsigned int, bool > |
| Facade for the parallel Bairstow method (even degree). | |
| auto | ginger::solve_pbairstow_autocorr (const std::vector< double > &coeffs, std::vector< Vec2 > &vrs, const Options &options, solve_mode mode=solve_mode::automatic) -> std::pair< unsigned int, bool > |
| Facade for the parallel Bairstow method (auto-correlation). | |
| auto | ginger::solve_aberth (const std::vector< double > &coeffs, std::vector< std::complex< double > > &zs, const Options &options, solve_mode mode=solve_mode::automatic) -> std::pair< unsigned int, bool > |
| Facade for the Aberth-Ehrlich method. | |
| auto | ginger::solve_aberth_autocorr (const std::vector< double > &coeffs, std::vector< std::complex< double > > &zs, const Options &options, solve_mode mode=solve_mode::automatic) -> std::pair< unsigned int, bool > |
| Facade for the Aberth-Ehrlich method (auto-correlation). | |
Facade entry points that auto-select the execution policy.