zero_dim_solve.hpp File Reference

Provides the algorithm for computing all zero-dimensional solutions for an algberaic system. More...

#include "bertini2/num_traits.hpp"
#include "bertini2/eigen_extensions.hpp"
#include "bertini2/detail/visitable.hpp"
#include "bertini2/tracking.hpp"
#include "bertini2/nag_algorithms/midpath_check.hpp"
#include "bertini2/io/generators.hpp"
#include "bertini2/detail/configured.hpp"
#include "bertini2/detail/observable.hpp"
#include "bertini2/nag_algorithms/common/algorithm_base.hpp"
#include "bertini2/nag_algorithms/common/config.hpp"
#include "bertini2/nag_algorithms/events.hpp"
#include "bertini2/system/start_base.hpp"
#include "bertini2/parallel.hpp"
#include "bertini2/records/output_directory.hpp"
#include "bertini2/records/producer.hpp"
#include "bertini2/records/solver_recording.hpp"
#include "bertini2/records/config_encoding.hpp"
#include "bertini2/io/classic_writer.hpp"
#include "bertini2/io/json_writer.hpp"
#include <algorithm>
#include <chrono>
#include "bertini2/common/stop_request.hpp"
#include <cstdlib>
#include <limits>
#include <mutex>
#include <iostream>
#include <map>
#include "bertini2/nag_algorithms/output.hpp"
#include "bertini2/io/parsing/settings_parsers.hpp"
#include "bertini2/endgames.hpp"
#include "bertini2/system/start_systems.hpp"

Include dependency graph for zero_dim_solve.hpp:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Classes
struct	bertini::algorithm::AlgoTraits< HomotopySolver< TrackerType, EndgameType, SystemType > >
	specify the traits for the algorithm. More...
struct	bertini::algorithm::AnyZeroDim
	Type-erased base for a zero-dimensional solve, exposing output and config entry points. More...
struct	bertini::algorithm::AlgorithmMetaData
	metadata structs More...
struct	bertini::algorithm::SolutionMetaData< ComplexT >
	Per-solution metadata gathered during and after a path track. More...
struct	bertini::algorithm::EGBoundaryMetaData< ComplexT >
	State captured at the endgame boundary, handed off to start the endgame. More...
struct	bertini::algorithm::MidpathCheckReport
	Summary of what the midpath (path-crossing) check found at the endgame boundary, and what the algorithm did about it. More...
struct	bertini::algorithm::SolveReport
	A concise, human-readable summary of a zero-dimensional solve: how every path ended up, and – crucially – whether any path was lost. More...
struct	bertini::algorithm::HomotopySolver< TrackerType, EndgameType, SystemType >
	The continuation primitive: given a homotopy + a source of start points, track each path through the tracker and endgame, resolve crossings, classify the endpoints, and report. More...
struct	bertini::algorithm::HomotopySolver< TrackerType, EndgameType, SystemType >::ScopedSessionState
	Restores the ambient session state a solve may perturb: "a solve leaves the session as it found it". More...
struct	bertini::algorithm::zero_dim_detail::OwnedHomotopy< SystemType >
	Owns and builds the target / start system / homotopy for a zero-dim solve. More...
struct	bertini::algorithm::ZeroDimSolver< TrackerType, EndgameType, SystemType >
	The zero-dimensional solve algorithm: given a polynomial system, form a start system and a homotopy, then run the continuation engine. More...

Namespaces
namespace	bertini
namespace	bertini::start_system
namespace	bertini::algorithm
namespace	bertini::algorithm::zero_dim_detail

Typedefs
using	bertini::algorithm::SolnIndT = typename SolnCont<complex_dbl>::size_type
	Index type for solutions/paths (over a double-precision solution container).

Functions
template<typename NumT>
std::ostream &	bertini::algorithm::operator<< (std::ostream &out, const SolutionMetaData< NumT > &meta)
	Stream insertion: write the metadata fields one per line (used by the Python bindings).
template<typename NumT>
std::ostream &	bertini::algorithm::operator<< (std::ostream &out, const EGBoundaryMetaData< NumT > &meta)
	Stream insertion: write the boundary metadata fields one per line (used by the Python bindings).
std::ostream &	bertini::algorithm::operator<< (std::ostream &out, const MidpathCheckReport &r)
	Stream insertion: write the midpath-check report fields one per line.
template<typename ComplexT>
SolveReport	bertini::algorithm::SummarizeSolve (std::vector< SolutionMetaData< ComplexT > > const &metadata, MidpathCheckReport const &midpath)
	Build a SolveReport from the per-endpoint final metadata and the midpath-crossing report.
std::ostream &	bertini::algorithm::operator<< (std::ostream &out, const SolveReport &r)
	Stream insertion: write a human-readable summary of the solve report.
template<typename Target, typename... Ts>
void	bertini::algorithm::InjectParsedTuple (Target &target, std::tuple< Ts... > const &t)
	Inject every element of a tuple of config structs into a Configured-derived target via Set<T>.

Detailed Description

Provides the algorithm for computing all zero-dimensional solutions for an algberaic system.