bertini::algorithm::MidpathCheckReport Struct Reference

Summary of what the midpath (path-crossing) check found at the endgame boundary, and what the algorithm did about it. More...

#include <zero_dim_solve.hpp>

Public Attributes
bool	passed = true
	Did the final midpath check pass (no crossings remained)?
unsigned	num_crossings_detected = 0
	Number of crossed paths found on the first check, before any re-tracking.
unsigned	num_resolve_attempts = 0
	How many re-track attempts were actually performed.
std::vector< unsigned long long >	crossed_path_indices
	Indices of the paths flagged as crossed on the first check.

Detailed Description

Summary of what the midpath (path-crossing) check found at the endgame boundary, and what the algorithm did about it.

Two distinct paths landing on the same point at the endgame boundary is a probability-0 event: it signals a path crossing (under-resolved tracking), not a benign coincidence. The zero-dim algorithm detects these at the boundary using a relaxed same-point tolerance and re-tracks the offending paths with tightened settings (see ZeroDim::EGBoundaryAction). This struct records the outcome so a caller can tell whether a solve hit crossings and whether they were resolved.

See also

ZeroDim::EndgameBoundaryMetadata

Member Data Documentation

crossed_path_indices

std::vector<unsigned long long> bertini::algorithm::MidpathCheckReport::crossed_path_indices

Indices of the paths flagged as crossed on the first check.

num_crossings_detected

unsigned bertini::algorithm::MidpathCheckReport::num_crossings_detected = 0

Number of crossed paths found on the first check, before any re-tracking.

num_resolve_attempts

unsigned bertini::algorithm::MidpathCheckReport::num_resolve_attempts = 0

How many re-track attempts were actually performed.

passed

bool bertini::algorithm::MidpathCheckReport::passed = true

Did the final midpath check pass (no crossings remained)?