{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:16:49Z","timestamp":1750306609746,"version":"3.41.0"},"reference-count":0,"publisher":"Association for Computing Machinery (ACM)","issue":"3\/4","license":[{"start":{"date-parts":[[2015,2,5]],"date-time":"2015-02-05T00:00:00Z","timestamp":1423094400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Commun. Comput. Algebra"],"published-print":{"date-parts":[[2015,2,5]]},"abstract":"<jats:p>An efficient technique for solving polynomial systems with a particular structure is presented. This structure is very specific but arises naturally when computing the critical points of a symmetric polynomial energy function. This novel numerical solution method is based on homotopy continuation and is a particular application of results due to Canny and Rojas. An illustrative example from magnetism is presented.<\/jats:p>","DOI":"10.1145\/2733693.2733710","type":"journal-article","created":{"date-parts":[[2015,2,10]],"date-time":"2015-02-10T13:19:47Z","timestamp":1423574387000},"page":"133-133","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Decoupling Highly Structured Polynomial Systems"],"prefix":"10.1145","volume":"48","author":[{"given":"Daniel J.","family":"Bates","sequence":"first","affiliation":[{"name":"Colorado State University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew J.","family":"Newell","sequence":"additional","affiliation":[{"name":"North Carolina State University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthew E.","family":"Niemerg","sequence":"additional","affiliation":[{"name":"Colorado State University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2015,2,5]]},"container-title":["ACM Communications in Computer Algebra"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2733693.2733710","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2733693.2733710","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:17:02Z","timestamp":1750227422000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2733693.2733710"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,2,5]]},"references-count":0,"journal-issue":{"issue":"3\/4","published-print":{"date-parts":[[2015,2,5]]}},"alternative-id":["10.1145\/2733693.2733710"],"URL":"https:\/\/doi.org\/10.1145\/2733693.2733710","relation":{},"ISSN":["1932-2240"],"issn-type":[{"type":"print","value":"1932-2240"}],"subject":[],"published":{"date-parts":[[2015,2,5]]},"assertion":[{"value":"2015-02-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}