Module polynomial 

Polynomial & complex algebra — the engine’s home for complex arithmetic, real quadratic solving, and dependency-free polynomial root finding.

This is not linear algebra (it was previously co-located with it in a specialized lib); it is the computer-algebra primitive that matrix-spectral routines (solvers::linear_algebra::spectral) build on. Allocating where outputs are inherently dynamic (root vectors); all scratch is local.

Structs

Complex

A complex number re + im·i. Minimal arithmetic for polynomial root finding.

Enums

QuadraticRoots

The roots of a real quadratic a·x² + b·x + c = 0.

Functions

polynomial_roots

Find all complex roots of a real polynomial (DESCENDING coefficients, coeffs[0]·x^n + … + coeffs[n]) via the Durand–Kerner iteration.

solve_quadratic

Solve a·x² + b·x + c = 0 over the reals, numerically stably.