Struct EvenBairstowStep 

pub struct EvenBairstowStep<'a> {
    pub coeffs: &'a [f64],
    pub degree: usize,
    pub options: &'a Options,
}

One Bairstow Newton correction for a quadratic factor (even degree).

Reads the current factor via get(idx), suppresses all other factors via the neighbor iterable, and returns the corrected factor for the policy to write. Shared by the sequential, Jacobi-MT and atomic execution policies.

This mirrors ginger::detail::even_bairstow_step in ginger-cpp.

Fields

coeffs: &'a [f64]

Polynomial coefficients (highest degree first).

degree: usize

Degree of the polynomial.

options: &'a Options

Convergence options.

Trait Implementations

impl Step<Vector2<f64>> for EvenBairstowStep<'_>

type Cell = AtomicVec2

Atomic cell type used by the decoupled atomic policy for this step.

fn run<G, N>(&self, idx: usize, get: G, neighbors: N) -> (f64, Option<Vec2>)

where G: Fn(usize) -> Vec2, N: Iterator<Item = usize>,

Compute one Newton correction for root/factor idx.