High-Order Predictor–Corrector Schemes for the Simultaneous Computation of Polynomial Roots with Known Multiplicities: Order Analysis and the Role of a Scalar-Derived Correction Factor
- 1Department of Mathematics, Faculty of Arts and Science, Balikesir University, 10145 Balıkesir, Turkey
- 2Department of Mathematics and Statistics, Riphah International University, Islamabad 44000, Pakistan
- 3Faculty of Engineering, Free University of Bozen-Bolzano, 39100 Bolzano, Italy
Abstract
We study high-order predictor–corrector schemes for the simultaneous computation of polynomial roots with known multiplicities. The proposed method, BKM*, combines a fourth-order two-step modified Newton approximation, a coupled Ehrlich-type predictor of order six for multiple roots, and a final Gargantini–Farmer–Loizou correction. A local convergence analysis establishes a vector Q-order of at least eighteen, together with explicit leading error terms. The analysis is extended to a multiplicative correction factor applied to the final corrector: if the factor differs from one by O(εk), the local order is at least min(18,6+k). For a correction factor derived from a fifth-order scalar method, k=2, so the resulting weighted variant has an order of at least eight, and the weight reduces rather than increases the order. To isolate the role of the predictor, we also examine the composition of one PKM* step with the same corrector, which also has a local order of at least eighteen and requires fewer function evaluations per iteration. Experiments in 6000-digit arithmetic on polynomials of degrees 12, 20 and 21 confirm observed orders close to 18 and 8, and show that neither order-eighteen composition is uniformly faster: the composition with fewer function evaluations per iteration requires less computing time when both need the same number of iterations, whereas BKM* benefits from a more favourable pre-asymptotic phase from the more distant starting configurations.
Related
- Affine Symmetries of Polynomial Roots with Multiplicities and Applications to Constacyclic Codes
- Improved computation of polynomial roots over number fields when using complex embeddings
- The Two-Variable Hypergraph Tutte Polynomial via Embedding Activities and Computation-Tree Activities
- Convergence of a Family of Accelerated Schröder-like Methods for the Simultaneous Extraction of Simple and Multiple Polynomial Zeros
- Simultaneous popular differences for polynomial and linear progressions in finite fields
BibTeX
@article{shams2026highorder,
title = {{High-Order Predictor–Corrector Schemes for the Simultaneous Computation of Polynomial Roots with Known Multiplicities: Order Analysis and the Role of a Scalar-Derived Correction Factor}},
author = {Mudassir Shams and Bruno Carpentieri},
journal = {Mathematics},
year = {2026},
month = oct,
doi = {10.3390/math14203809},
url = {https://www.mdpi.com/2227-7390/14/20/3809},
note = {CC BY 4.0},
}
RIS
TY - JOUR
TI - High-Order Predictor–Corrector Schemes for the Simultaneous Computation of Polynomial Roots with Known Multiplicities: Order Analysis and the Role of a Scalar-Derived Correction Factor
AU - Mudassir Shams
AU - Bruno Carpentieri
PY - 2026
DA - 2026/10/20
JO - Mathematics
DO - 10.3390/math14203809
UR - https://www.mdpi.com/2227-7390/14/20/3809
AB - We study high-order predictor–corrector schemes for the simultaneous computation of polynomial roots with known multiplicities. The proposed method, BKM*, combines a fourth-order two-step modified Newton approximation, a coupled Ehrlich-type predictor of order six for multiple roots, and a final Gargantini–Farmer–Loizou correction. A local convergence analysis establishes a vector Q-order of at least eighteen, together with explicit leading error terms. The analysis is extended to a multiplicative correction factor applied to the final corrector: if the factor differs from one by O(εk), the local order is at least min(18,6+k). For a correction factor derived from a fifth-order scalar method, k=2, so the resulting weighted variant has an order of at least eight, and the weight reduces rather than increases the order. To isolate the role of the predictor, we also examine the composition of one PKM* step with the same corrector, which also has a local order of at least eighteen and requires fewer function evaluations per iteration. Experiments in 6000-digit arithmetic on polynomials of degrees 12, 20 and 21 confirm observed orders close to 18 and 8, and show that neither order-eighteen composition is uniformly faster: the composition with fewer function evaluations per iteration requires less computing time when both need the same number of iterations, whereas BKM* benefits from a more favourable pre-asymptotic phase from the more distant starting configurations.
SN - 2227-7390
ER -