Bi-Parametric Parallel Weierstrass Scheme

• The paper introduces a bi-parametric approach that refines the classical Weierstrass method by integrating adaptive Newton corrections for solving nonlinear equations.
• It achieves genuine third-order convergence through step-log contraction profiling and ensemble-based, training-free parameter optimization.
• The scheme significantly reduces iterations and CPU time by leveraging parallel processing and systematic stability metrics in multicore environments.

The bi-parametric parallel Weierstrass-type scheme is a class of iterative algorithms designed for high-efficiency, robust solution of systems of nonlinear equations—particularly the simultaneous localization of all distinct roots of a complex polynomial. By combining advanced correction strategies (both Weierstrass and Newton-type) and principled, lightweight parameter tuning via direct finite-time contraction analysis, these schemes provide genuine third-order convergence and are highly suitable for multicore and parallel computing environments. Integration of two parameters, typically denoted $\alpha$ and $\beta$, enables fine control of algorithmic stability and rate, with systematic, training-free optimization of these parameters via step-log contraction profiling over randomized launch ensembles (Shams et al., 20 Jan 2026).

1. Algorithm Definition and Update Structure

Let $f:\mathbb{C}\to\mathbb{C}$ be a polynomial of degree $n$; the goal is to compute all simple roots $\zeta_1,\dots,\zeta_n$ in parallel. At each iteration $h$, the current root approximations are stored in

$$\mathbf x^{[h]} = (x_1^{[h]}, x_2^{[h]}, \dots, x_n^{[h]})^\top.$$

Two real parameters, $\alpha$ and $\beta$, govern the predictor-corrector steps. The precise iterative updates of the SAB[3] scheme are:

• Predictor (Weierstrass–Newton fractional correction):

$$z_i^{[h]} = x_i^{[h]} - \frac{f(x_i^{[h]})}{f'(x_i^{[h]})} \cdot \frac{1}{1 + \frac{\alpha f(x_i^{[h]})}{1 + \beta f(x_i^{[h]})}}, \quad i=1,\dots,n$$

• Corrector (Weierstrass parallel product):

$\beta$0

Equivalently, in operator form: $\beta$1 where $\beta$2 is the diagonal Weierstrass-denominator operator.

The parameters $\beta$3 and $\beta$4 determine the modification to the classical Newton step, tuning both the local stability and asymptotic convergence properties (Shams et al., 20 Jan 2026). No restrictions on their values are required except for smoothness and proximity of initial guesses to actual roots.

2. Convergence Theory

The SAB[3] algorithm achieves genuine third-order convergence under standard smoothness conditions. The main theorem states:

• If $\beta$5 and all $\beta$6 are simple roots, and the initial guesses $\beta$7 are sufficiently close to $\beta$8, then

$\beta$9

where $f:\mathbb{C}\to\mathbb{C}$0 and $f:\mathbb{C}\to\mathbb{C}$1. Thus, for a constant $f:\mathbb{C}\to\mathbb{C}$2,

$f:\mathbb{C}\to\mathbb{C}$3

Locally, the predictor error satisfies $f:\mathbb{C}\to\mathbb{C}$4, and the corrector denominator is well behaved due to distinctness of roots. Empirical tests confirm robust third-order convergence in practice for suitable $f:\mathbb{C}\to\mathbb{C}$5 (Shams et al., 20 Jan 2026).

3. Direct Finite-Time Contraction Profiling

The step-log contraction profiling methodology enables efficient, reproducible parameter tuning without reliance on analytical, problem-dependent diagnostics. For each iteration,

• Step vector and norm:

$f:\mathbb{C}\to\mathbb{C}$6

• Step-log ratio:

$f:\mathbb{C}\to\mathbb{C}$7

When $f:\mathbb{C}\to\mathbb{C}$8, the scheme is transiently contracting. Over a fixed window $f:\mathbb{C}\to\mathbb{C}$9, the contraction profile is

$n$0

Aggregating these profiles over $n$1 randomized micro-launch ensembles yields

$n$2

This approach enables scalable assessment of contraction/expansion behavior and is independent of specific root locations or system structure.

4. Profile-Based Stability Metrics and Tuning Framework

Two scalar profile metrics are extracted for ranking $n$3 candidates:

• Stability Minimum ($n$4):

$n$5

where $n$6 and $n$7 denote the minimum and its location in $n$8.

• Stability Moment ($n$9):

$\zeta_1,\dots,\zeta_n$0

Large $\zeta_1,\dots,\zeta_n$1 values correspond to strong, early contraction and are empirically predictive of global robustness.

The recommended training-free parameter selection workflow is:

1. Scan a uniform grid over $\zeta_1,\dots,\zeta_n$2.
2. Launch $\zeta_1,\dots,\zeta_n$3 randomized trials per grid-point.
3. Evaluate $\zeta_1,\dots,\zeta_n$4 and $\zeta_1,\dots,\zeta_n$5.
4. Select optimal $\zeta_1,\dots,\zeta_n$6 via maximization (Shams et al., 20 Jan 2026).

This framework is “embarrassingly parallel” and requires no analytic knowledge of the underlying nonlinear equation.

5. Comparative Numerical Performance

Extensive experiments confirm the practical gains of the SAB[3] scheme and step-log tuning. For three classes of nonlinear test problems (high-degree polynomials, enzyme kinetics, and transcendental polynomial-exponential equations), key observations include:

• Reduction in iteration counts to tight tolerances ($\zeta_1,\dots,\zeta_n$7) from $\zeta_1,\dots,\zeta_n$8 (classical) to $\zeta_1,\dots,\zeta_n$9 (optimized SAB[3]).
• Corresponding CPU time decreases by factors of $h$0–$h$1, even accounting for initial profiling overhead.
• Convergence success rates across all roots improve from partial/divergent to $h$2.
• Empirical convergence order stabilizes at $h$3, whereas suboptimal parameters display irregular or order $h$4 behavior (Shams et al., 20 Jan 2026).

Heatmaps of $h$5 and $h$6 reveal wide basins of high performance, aiding robust deployment across diverse nonlinear systems.

6. Parallelization and Multicore Deployment

Key practical guidelines for multicore implementation:

• Window $h$7 and stabilization $h$8 are typical choices.
• Ensemble sizes $h$9–$$\mathbf x^{[h]} = (x_1^{[h]}, x_2^{[h]}, \dots, x_n^{[h]})^\top.$$0 balance cost and statistical robustness.
• Grid scan resolution of $$\mathbf x^{[h]} = (x_1^{[h]}, x_2^{[h]}, \dots, x_n^{[h]})^\top.$$1 over $$\mathbf x^{[h]} = (x_1^{[h]}, x_2^{[h]}, \dots, x_n^{[h]})^\top.$$2 reliably identifies large stable regions.
• All outer loops (parameter grid and micro-launches) admit parallelization across CPUs or GPUs.
• After optimal parameter selection, the SAB[3] algorithm can be deployed for production runs without further tuning.

The method is training-free, reproducible and empirically insensitive to stochasticity in the problem data (Shams et al., 20 Jan 2026).

7. Context and Relationship to Parallel Weierstrass Samplers

Bi-parametric parallel Weierstrass-type schemes constitute a methodological generalization of parallel root-finding algorithms inspired by statistical Weierstrass samplers for merging independent posterior draws in subset-based parallel MCMC. In the Bayesian context, Weierstrass transforms provide bounded, kernel-smooth approximations to posterior densities, with error quantified in terms of smoothing parameters and the shape of subset posteriors (Wang et al., 2013). The SAB[3] scheme diverges in application—focusing on root-localization rather than distributional approximation—but retains the central principle of parallel correction using fractions and products derived from independently computed local information.

A plausible implication is the broader utility of bi-parametric and kernel-transformed updates in parallel scientific computing, facilitating scalable, stable problem solution in the presence of high-dimensional and heterogeneous constraints.