/**
 * Find all complex roots of a univariate polynomial via Aberth–Ehrlich.
 *
 * The polynomial is given in ascending-power coefficient form:
 *   p(x) = coeffs[0] + coeffs[1]·x + … + coeffs[degree]·x^degree
 * The leading coefficient `coeffs[degree]` must be nonzero.
 *
 * Exactly `degree` complex numbers are written into `roots_re`/`roots_im` at
 * index `offset`, `offset + 1`, …, `offset + degree - 1`. The order they
 * appear in is not specified.
 *
 * @param {Float64Array|number[]} coeffs ascending-power, length ≥ degree + 1
 * @param {number} degree polynomial degree, ≥ 1, ≤ 64
 * @param {Float64Array|number[]} roots_re real parts, length ≥ offset + degree
 * @param {Float64Array|number[]} roots_im imaginary parts, length ≥ offset + degree
 * @param {number} offset
 * @param {number} [max_iterations=80] outer iteration cap. Lower values
 *   trade worst-case convergence accuracy for speed; the per-iteration
 *   convergence check still fires early in the common case. A low cap
 *   (~24-32) is appropriate for well-conditioned low-degree polynomials
 *   where Aberth typically converges in 15-25 iterations.
 */
export function polynomial_complex_roots_aberth_ehrlich(coeffs: Float64Array | number[], degree: number, roots_re: Float64Array | number[], roots_im: Float64Array | number[], offset: number, max_iterations?: number): void;
//# sourceMappingURL=polynomial_complex_roots_aberth_ehrlich.d.ts.map