{"id":"https://openalex.org/W7118174101","doi":"https://doi.org/10.3390/a19010050","title":"A Constrained Optimization Approach to Bairstow\u2019s Method","display_name":"A Constrained Optimization Approach to Bairstow\u2019s Method","publication_year":2026,"publication_date":"2026-01-05","ids":{"openalex":"https://openalex.org/W7118174101","doi":"https://doi.org/10.3390/a19010050"},"language":"en","primary_location":{"id":"doi:10.3390/a19010050","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a19010050","pdf_url":"https://www.mdpi.com/1999-4893/19/1/50/pdf?version=1767625039","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/19/1/50/pdf?version=1767625039","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5014223403","display_name":"Gianmarco Manzini","orcid":"https://orcid.org/0000-0003-3626-3112"},"institutions":[{"id":"https://openalex.org/I4210137033","display_name":"Istituto di Matematica Applicata e Tecnologie Informatiche","ror":"https://ror.org/03m0n3c07","country_code":"IT","type":"education","lineage":["https://openalex.org/I4210137033","https://openalex.org/I4210155236"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Gianmarco Manzini","raw_affiliation_strings":["Istituto di Matematica Applicata e Tecnologie Informatiche\u2014Consiglio Nazionale delle Ricerche, Via Adolfo Ferrata, 5, 27100 Pavia, PV, Italy"],"affiliations":[{"raw_affiliation_string":"Istituto di Matematica Applicata e Tecnologie Informatiche\u2014Consiglio Nazionale delle Ricerche, Via Adolfo Ferrata, 5, 27100 Pavia, PV, Italy","institution_ids":["https://openalex.org/I4210137033"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5048388054","display_name":"Massimiliano Martinelli","orcid":"https://orcid.org/0000-0003-1481-1069"},"institutions":[{"id":"https://openalex.org/I4210137033","display_name":"Istituto di Matematica Applicata e Tecnologie Informatiche","ror":"https://ror.org/03m0n3c07","country_code":"IT","type":"education","lineage":["https://openalex.org/I4210137033","https://openalex.org/I4210155236"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Massimiliano Martinelli","raw_affiliation_strings":["Istituto di Matematica Applicata e Tecnologie Informatiche\u2014Consiglio Nazionale delle Ricerche, Via Adolfo Ferrata, 5, 27100 Pavia, PV, Italy"],"affiliations":[{"raw_affiliation_string":"Istituto di Matematica Applicata e Tecnologie Informatiche\u2014Consiglio Nazionale delle Ricerche, Via Adolfo Ferrata, 5, 27100 Pavia, PV, Italy","institution_ids":["https://openalex.org/I4210137033"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5014223403"],"corresponding_institution_ids":["https://openalex.org/I4210137033"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.06050605,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"19","issue":"1","first_page":"50","last_page":"50"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12661","display_name":"Iterative Methods for Nonlinear Equations","score":0.6657999753952026,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12661","display_name":"Iterative Methods for Nonlinear Equations","score":0.6657999753952026,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11435","display_name":"Polynomial and algebraic computation","score":0.22370000183582306,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11697","display_name":"Numerical Methods and Algorithms","score":0.013899999670684338,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/discriminant","display_name":"Discriminant","score":0.595300018787384},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.5618000030517578},{"id":"https://openalex.org/keywords/jacobian-matrix-and-determinant","display_name":"Jacobian matrix and determinant","score":0.5202000141143799},{"id":"https://openalex.org/keywords/root-finding-algorithm","display_name":"Root-finding algorithm","score":0.5026000142097473},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.4546000063419342},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.43619999289512634},{"id":"https://openalex.org/keywords/chebyshev-polynomials","display_name":"Chebyshev polynomials","score":0.4253000020980835},{"id":"https://openalex.org/keywords/quadratic-function","display_name":"Quadratic function","score":0.3955000042915344},{"id":"https://openalex.org/keywords/stability","display_name":"Stability (learning theory)","score":0.37130001187324524}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.621999979019165},{"id":"https://openalex.org/C78397625","wikidata":"https://www.wikidata.org/wiki/Q192487","display_name":"Discriminant","level":2,"score":0.595300018787384},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.5618000030517578},{"id":"https://openalex.org/C200331156","wikidata":"https://www.wikidata.org/wiki/Q506041","display_name":"Jacobian matrix and determinant","level":2,"score":0.5202000141143799},{"id":"https://openalex.org/C194777461","wikidata":"https://www.wikidata.org/wiki/Q1085860","display_name":"Root-finding algorithm","level":3,"score":0.5026000142097473},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4729999899864197},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.4546000063419342},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.43619999289512634},{"id":"https://openalex.org/C129785596","wikidata":"https://www.wikidata.org/wiki/Q619511","display_name":"Chebyshev polynomials","level":2,"score":0.4253000020980835},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39890000224113464},{"id":"https://openalex.org/C166437778","wikidata":"https://www.wikidata.org/wiki/Q50695","display_name":"Quadratic function","level":3,"score":0.3955000042915344},{"id":"https://openalex.org/C112972136","wikidata":"https://www.wikidata.org/wiki/Q7595718","display_name":"Stability (learning theory)","level":2,"score":0.37130001187324524},{"id":"https://openalex.org/C85522705","wikidata":"https://www.wikidata.org/wiki/Q3278015","display_name":"Line search","level":3,"score":0.37119999527931213},{"id":"https://openalex.org/C137800194","wikidata":"https://www.wikidata.org/wiki/Q11713455","display_name":"Interpolation (computer graphics)","level":3,"score":0.3646000027656555},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.3587000072002411},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.35569998621940613},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3456000089645386},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.33719998598098755},{"id":"https://openalex.org/C171326582","wikidata":"https://www.wikidata.org/wiki/Q1052508","display_name":"Chebyshev nodes","level":3,"score":0.3239000141620636},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3206999897956848},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.3176000118255615},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.3109000027179718},{"id":"https://openalex.org/C187834632","wikidata":"https://www.wikidata.org/wiki/Q188804","display_name":"Factorization","level":2,"score":0.3100999891757965},{"id":"https://openalex.org/C21424316","wikidata":"https://www.wikidata.org/wiki/Q718621","display_name":"Chebyshev filter","level":2,"score":0.3005000054836273},{"id":"https://openalex.org/C25878781","wikidata":"https://www.wikidata.org/wiki/Q1473607","display_name":"Degree of a polynomial","level":3,"score":0.2761000096797943},{"id":"https://openalex.org/C107775665","wikidata":"https://www.wikidata.org/wiki/Q12859399","display_name":"Properties of polynomial roots","level":4,"score":0.260699987411499},{"id":"https://openalex.org/C39613435","wikidata":"https://www.wikidata.org/wiki/Q846677","display_name":"Remainder","level":2,"score":0.2565999925136566},{"id":"https://openalex.org/C188060507","wikidata":"https://www.wikidata.org/wiki/Q653242","display_name":"QR decomposition","level":3,"score":0.25110000371932983}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.3390/a19010050","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a19010050","pdf_url":"https://www.mdpi.com/1999-4893/19/1/50/pdf?version=1767625039","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:83351b515c5a4a758d2df97ea401d62a","is_oa":true,"landing_page_url":"https://doaj.org/article/83351b515c5a4a758d2df97ea401d62a","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 19, Iss 1, p 50 (2026)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.3390/a19010050","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a19010050","pdf_url":"https://www.mdpi.com/1999-4893/19/1/50/pdf?version=1767625039","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities","score":0.6863051652908325}],"awards":[],"funders":[{"id":"https://openalex.org/F4320311030","display_name":"Istituto Nazionale di Alta Matematica \"Francesco Severi\"","ror":"https://ror.org/01vx64p53"}],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7118174101.pdf"},"referenced_works_count":13,"referenced_works":["https://openalex.org/W1832583097","https://openalex.org/W1918816242","https://openalex.org/W1977415556","https://openalex.org/W2025026078","https://openalex.org/W2046133214","https://openalex.org/W2123871098","https://openalex.org/W3003257820","https://openalex.org/W4255383393","https://openalex.org/W4293177929","https://openalex.org/W4299599836","https://openalex.org/W4301866048","https://openalex.org/W4366602292","https://openalex.org/W4385553012"],"related_works":[],"abstract_inverted_index":{"Bairstow\u2019s":[0,79],"method":[1,51,80],"employs":[2],"synthetic":[3],"division":[4],"to":[5,52,94],"express":[6],"a":[7,82],"polynomial":[8,22,115],"p(x)":[9],"of":[10,23,139,142,221],"degree":[11,24,194],"n":[12],"in":[13,105],"the":[14,20,30,37,90,95,133,137,173,177,189,222],"form":[15],"p(x)=q(x)(x2+Bx+C)+R(B,C)x+S(B,C),":[16],"where":[17],"q(x)":[18],"is":[19],"quotient":[21],"n\u22122,":[25],"and":[26,41,67,129,208,211],"R(B,C),":[27],"S(B,C)":[28],"are":[29],"remainder":[31],"coefficients":[32],"that":[33,86],"depend":[34],"nonlinearly":[35],"on":[36,191],"quadratic":[38,174],"parameters":[39],"B":[40],"C.":[42],"The":[43,168],"original":[44],"algorithm":[45],"proposed":[46],"by":[47],"Bairstow":[48,120],"uses":[49],"Newton\u2013Raphson":[50],"solve":[53],"R(B,C)=S(B,C)=0;":[54],"it":[55],"requires":[56],"initial":[57],"guesses":[58],"within":[59],"very":[60],"narrow":[61],"attraction":[62],"basins":[63],"for":[64,125,154,162],"ill-conditioned":[65],"polynomials":[66,192],"fails":[68],"at":[69],"singular":[70],"Jacobian":[71],"matrices.":[72],"To":[73],"address":[74],"these":[75],"issues,":[76],"we":[77],"reformulate":[78],"as":[81,89,159],"constrained":[83],"optimization":[84,134],"problem":[85],"maximizes":[87],"C2":[88,169],"objective":[91,170],"function":[92],"subject":[93],"constraints":[96,153],"R(B,C)=S(B,C)=0.":[97],"While":[98],"modern,":[99],"highly":[100],"optimized,":[101],"non-linear":[102],"solvers":[103],"(available":[104],"commercial":[106],"software":[107],"like":[108],"MATLAB)":[109],"have":[110],"largely":[111],"superseded":[112],"classical":[113],"iterative":[114],"rootfinding":[116],"techniques,":[117],"our":[118],"reformulated":[119],"approach":[121,190],"offers":[122],"distinct":[123],"advantages":[124],"selective":[126],"root":[127,166,179],"extraction":[128,138],"application-specific":[130,155],"constraints.":[131],"Specifically,":[132],"formulation":[135],"enables":[136],"specific":[140],"roots":[141,148],"interest":[143],"rather":[144],"than":[145,196],"computing":[146],"all":[147],"simultaneously,":[149],"naturally":[150],"accommodates":[151],"additional":[152],"factorization":[156],"x":[157],"(such":[158],"discriminant":[160,223],"conditions":[161],"real":[163,202,207],"versus":[164],"complex":[165,209],"extraction).":[167],"automatically":[171],"selects":[172],"factor":[175],"with":[176,193,200,218],"largest":[178],"magnitude,":[180],"enhancing":[181],"numerical":[182],"stability":[183],"during":[184],"deflation.":[185],"Numerical":[186],"experiments":[187],"validate":[188],"bigger":[195],"10":[197],"including":[198],"cases":[199],"simple":[201],"roots,":[203,205,210],"multiple":[204],"mixed":[206],"Chebyshev":[212],"polynomials,":[213],"achieving":[214],"machine":[215],"precision":[216],"accuracy":[217],"robust":[219],"handling":[220],"constraint.":[224]},"counts_by_year":[],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2026-01-05T00:00:00"}