Module rootfinding

Expand description

This module implements the Bairstow’s method for finding the roots of a polynomial.

Structs§

EvenBairstowStep: One Bairstow Newton correction for a quadratic factor (even degree).
Options: The below code defines a struct named Options with three fields: max_iters, tolerance, and tol_ind.

delta: The delta function calculates the adjustment vector for Bairstow’s method.
delta1: delta 1 for ri - rj
horner: The horner function implements synthetic division by a quadratic factor $$ x^2 - r x - q $$.
initial_guess: The initial_guess function generates initial quadratic factor estimates for Bairstow’s method.
make_adjoint: The function make_adjoint calculates the adjoint matrix between two vectors.
make_inverse: The function make_inverse calculates the inverse of a 2x2 matrix.
pbairstow_even: Parallel Bairstow’s method (even degree only)
pbairstow_even_atomic: Atomic multi-threading Bairstow’s method (even degree only, decoupled)
pbairstow_even_mt: Multi-threading Bairstow’s method (even degree only)
poly_from_quadratic_factors: Reconstruct a monic polynomial from its quadratic factors
suppress: The suppress function in Rust performs zero suppression on a set of vectors.
suppress_old: The suppress_old function performs zero suppression on a set of vectors.