{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,7]],"date-time":"2026-01-07T13:03:18Z","timestamp":1767790998002,"version":"3.49.0"},"reference-count":38,"publisher":"MDPI AG","issue":"1","license":[{"start":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T00:00:00Z","timestamp":1767571200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>Bairstow\u2019s method employs synthetic division to express a polynomial p(x) of degree n in the form p(x)=q(x)(x2+Bx+C)+R(B,C)x+S(B,C), where q(x) is the quotient polynomial of degree n\u22122, and R(B,C), S(B,C) are the remainder coefficients that depend nonlinearly on the quadratic parameters B and C. The original algorithm proposed by Bairstow uses Newton\u2013Raphson method to solve R(B,C)=S(B,C)=0; it requires initial guesses within very narrow attraction basins for ill-conditioned polynomials and fails at singular Jacobian matrices. To address these issues, we reformulate Bairstow\u2019s method as a constrained optimization problem that maximizes C2 as the objective function subject to the constraints R(B,C)=S(B,C)=0. While modern, highly optimized, non-linear solvers (available in commercial software like MATLAB) have largely superseded classical iterative polynomial rootfinding techniques, our reformulated Bairstow approach offers distinct advantages for selective root extraction and application-specific constraints. Specifically, the optimization formulation enables the extraction of specific roots of interest rather than computing all roots simultaneously, naturally accommodates additional constraints for application-specific factorization x (such as discriminant conditions for real versus complex root extraction). The C2 objective automatically selects the quadratic factor with the largest root magnitude, enhancing numerical stability during deflation. Numerical experiments validate the approach on polynomials with degree bigger than 10 including cases with simple real roots, multiple roots, mixed real and complex roots, and Chebyshev polynomials, achieving machine precision accuracy with robust handling of the discriminant constraint.<\/jats:p>","DOI":"10.3390\/a19010050","type":"journal-article","created":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T15:28:57Z","timestamp":1767626937000},"page":"50","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Constrained Optimization Approach to Bairstow\u2019s Method"],"prefix":"10.3390","volume":"19","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3626-3112","authenticated-orcid":false,"given":"Gianmarco","family":"Manzini","sequence":"first","affiliation":[{"name":"Istituto di Matematica Applicata e Tecnologie Informatiche\u2014Consiglio Nazionale delle Ricerche, Via Adolfo Ferrata, 5, 27100 Pavia, PV, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1481-1069","authenticated-orcid":false,"given":"Massimiliano","family":"Martinelli","sequence":"additional","affiliation":[{"name":"Istituto di Matematica Applicata e Tecnologie Informatiche\u2014Consiglio Nazionale delle Ricerche, Via Adolfo Ferrata, 5, 27100 Pavia, PV, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2026,1,5]]},"reference":[{"key":"ref_1","unstructured":"Katz, V.J. (2009). A History of Mathematics: An Introduction, Addison-Wesley. [3rd ed.]."},{"key":"ref_2","first-page":"495","article-title":"Mathematics in Medieval Islam","volume":"127","author":"Berggren","year":"2007","journal-title":"J. Am. Orient. Soc."},{"key":"ref_3","unstructured":"The Great Art or the Rules of Algebra (1545). Artis Magnae Sive de Regulis Algebraicis, Johann Petreius."},{"key":"ref_4","first-page":"65","article-title":"D\u00e9monstration de l\u2019impossibilit\u00e9 de la r\u00e9solution alg\u00e9brique des \u00e9quations g\u00e9n\u00e9rales qui passent le quatri\u00e8me degr\u00e9","volume":"1","author":"Abel","year":"1826","journal-title":"J. Fur Die Reine Und Angew. Math."},{"key":"ref_5","first-page":"381","article-title":"M\u00e9moire sur les conditions de r\u00e9solubilit\u00e9 des \u00e9quations par radicaux","volume":"11","author":"Galois","year":"1846","journal-title":"J. Math. Pures Appl."},{"key":"ref_6","unstructured":"Newton, I. (2025, December 21). De Analysi per Aequationes Numero Terminorum Infinitas, 1669. Manuscript Circulated Privately, Published in 1711. Available online: https:\/\/grokipedia.com\/page\/De_analysi_per_aequationes_numero_terminorum_infinitas."},{"key":"ref_7","first-page":"308","article-title":"A new method of solving numerical equations of all orders, by continuous approximation","volume":"109","author":"Horner","year":"1819","journal-title":"Philos. Trans. R. Soc. Lond."},{"key":"ref_8","unstructured":"Wilkinson, J.H. (1965). The Algebraic Eigenvalue Problem, Oxford University Press."},{"key":"ref_9","unstructured":"Press, W.H., Teukolsky, S.A., Vetterling, W.T., and Flannery, B.P. (2007). Numerical Recipes: The Art of Scientific Computing, Cambridge University Press. [3rd ed.]."},{"key":"ref_10","unstructured":"Householder, A.S. (1970). The Numerical Treatment of a Single Nonlinear Equation, McGraw-Hill."},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Stoer, J., and Bulirsch, R. (2002). Introduction to Numerical Analysis, Springer. [3rd ed.].","DOI":"10.1007\/978-0-387-21738-3"},{"key":"ref_12","unstructured":"Ralston, A., and Rabinowitz, P. (1978). A First Course in Numerical Analysis, McGraw-Hill. [2nd ed.]."},{"key":"ref_13","unstructured":"Bairstow, L. (1914). Applied Aerodynamics, Longmans, Green and Company."},{"key":"ref_14","unstructured":"Acton, F.S. (1970). Numerical Methods That Work, Harper & Row."},{"key":"ref_15","unstructured":"Golub, G.H., and Van Loan, C.F. (2013). Matrix Computations, Johns Hopkins University Press. [4th ed.]."},{"key":"ref_16","first-page":"173","article-title":"A Three-Stage Variable-Shift Iteration for Polynomial Zeros","volume":"5","author":"Jenkins","year":"1968","journal-title":"SIAM J. Numer. Anal."},{"key":"ref_17","first-page":"717","article-title":"Algorithm 493: Zeros of a Real Polynomial","volume":"13","author":"Jenkins","year":"1970","journal-title":"Commun. ACM"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1145\/363067.363115","article-title":"A Modified Newton Method for Polynomials","volume":"10","author":"Ehrlich","year":"1967","journal-title":"Commun. ACM"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1090\/S0025-5718-1973-0329236-7","article-title":"Iteration methods for finding all zeros of a polynomial simultaneously","volume":"27","author":"Aberth","year":"1973","journal-title":"Math. Comput."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1023\/A:1019199917103","article-title":"Design, Analysis and Implementation of a Multiprecision Polynomial Rootfinder","volume":"23","author":"Bini","year":"2000","journal-title":"Numer. Algorithms"},{"key":"ref_21","first-page":"63","article-title":"Newton-Like Methods for Polynomial Rootfinding","volume":"66","author":"Tilli","year":"1998","journal-title":"Math. Comput."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"1715","DOI":"10.1007\/s11075-023-01625-7","article-title":"A new optimal root-finding iterative algorithm: Local and semilocal analysis with polynomiography","volume":"95","author":"Qureshi","year":"2024","journal-title":"Numer. Algorithms"},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Raghav, Y.S., Haq, A., and Ali, I. (2023). Multiobjective intuitionistic fuzzy programming under pessimistic and optimistic applications in multivariate stratified sample allocation problems. PLoS ONE, 18.","DOI":"10.1371\/journal.pone.0284784"},{"key":"ref_24","unstructured":"Milnor, J. (1963). Morse Theory, Princeton University Press."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1038\/s41592-019-0686-2","article-title":"SciPy 1.0: Fundamental algorithms for scientific computing in Python","volume":"17","author":"Virtanen","year":"2020","journal-title":"Nat. Methods"},{"key":"ref_26","unstructured":"Johnson, S.G. (2025, December 21). NLopt: Nonlinear Optimization Library, Version 2.7.1. Available online: https:\/\/ui.adsabs.harvard.edu\/abs\/2021ascl.soft11004J\/abstract."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/s10107-004-0559-y","article-title":"On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming","volume":"106","author":"Biegler","year":"2006","journal-title":"Math. Program."},{"key":"ref_28","unstructured":"The MathWorks, Inc. (2024). Optimization Toolbox User\u2019s Guide, The MathWorks, Inc.. [r2024a ed.]."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1137\/15M1020575","article-title":"JuMP: A modeling language for mathematical optimization","volume":"59","author":"Dunning","year":"2017","journal-title":"SIAM Rev."},{"key":"ref_30","doi-asserted-by":"crossref","unstructured":"Hart, W.E., Laird, C.D., Watson, J.P., Woodruff, D.L., Hackebeil, G.A., Nicholson, B.L., and Siirola, J.D. (2017). Pyomo\u2014Optimization Modeling in Python, Springer.","DOI":"10.1007\/978-3-319-58821-6"},{"key":"ref_31","unstructured":"Bronshtein, I.N., Semendyayev, K.A., Musiol, G., and M\u00fchlig, H. (2007). Handbook of Mathematics, Springer. [5th ed.]."},{"key":"ref_32","first-page":"1","article-title":"The perfidious polynomial","volume":"24","author":"Wilkinson","year":"1984","journal-title":"Stud. Numer. Anal."},{"key":"ref_33","unstructured":"Nocedal, J., and Wright, S.J. (2006). Numerical Optimization, Springer. [2nd ed.]."},{"key":"ref_34","doi-asserted-by":"crossref","unstructured":"Gelfand, I.M., Kapranov, M.M., and Zelevinsky, A.V. (1994). Discriminants, Resultants, and Multidimensional Determinants, Birkh\u00e4user.","DOI":"10.1007\/978-0-8176-4771-1"},{"key":"ref_35","unstructured":"Wilkinson, J.H. (1963). Rounding Errors in Algebraic Processes, Prentice-Hall."},{"key":"ref_36","doi-asserted-by":"crossref","unstructured":"Bochnak, J., Coste, M., and Roy, M.F. (1998). Real Algebraic Geometry, Springer.","DOI":"10.1007\/978-3-662-03718-8"},{"key":"ref_37","unstructured":"Fulton, W. (1974). Algebraic Curves, W.A. Benjamin."},{"key":"ref_38","doi-asserted-by":"crossref","unstructured":"Edelsbrunner, H., and Harer, J. (2010). Computational Topology: An Introduction, American Mathematical Society.","DOI":"10.1090\/mbk\/069"}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/19\/1\/50\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,7]],"date-time":"2026-01-07T08:28:59Z","timestamp":1767774539000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/19\/1\/50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,5]]},"references-count":38,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2026,1]]}},"alternative-id":["a19010050"],"URL":"https:\/\/doi.org\/10.3390\/a19010050","relation":{},"ISSN":["1999-4893"],"issn-type":[{"value":"1999-4893","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1,5]]}}}