{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T00:34:31Z","timestamp":1760229271872,"version":"build-2065373602"},"reference-count":36,"publisher":"MDPI AG","issue":"6","license":[{"start":{"date-parts":[[2022,6,7]],"date-time":"2022-06-07T00:00:00Z","timestamp":1654560000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Guangxi Science and Technology project","award":["AD18281024","GCIS201821","2020YJSPYB02","2022YCXS144"],"award-info":[{"award-number":["AD18281024","GCIS201821","2020YJSPYB02","2022YCXS144"]}]},{"name":"Guangxi Key Laboratory of Cryptography and Information Security","award":["AD18281024","GCIS201821","2020YJSPYB02","2022YCXS144"],"award-info":[{"award-number":["AD18281024","GCIS201821","2020YJSPYB02","2022YCXS144"]}]},{"name":"Guilin University of Electronic Technology Graduate Student Excellent Degree Thesis Cultivation Project","award":["AD18281024","GCIS201821","2020YJSPYB02","2022YCXS144"],"award-info":[{"award-number":["AD18281024","GCIS201821","2020YJSPYB02","2022YCXS144"]}]},{"name":"Innovation Project of GUET Graduate Education","award":["AD18281024","GCIS201821","2020YJSPYB02","2022YCXS144"],"award-info":[{"award-number":["AD18281024","GCIS201821","2020YJSPYB02","2022YCXS144"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Symmetry"],"abstract":"<jats:p>Solving polynomial equations inevitably faces many severe challenges, such as easily occupying storage space and demanding prohibitively expensive computation resources. There has been considerable interest in exploiting the sparsity to improve computation efficiency, since asymmetry phenomena are prevalent in scientific and engineering fields, especially as most of the systems in real applications have sparse representations. In this paper, we propose an efficient parallel hybrid algorithm for constructing a Dixon matrix. This approach takes advantage of the asymmetry (i.e., sparsity) in variables of the system and introduces a heuristics strategy. Our method supports parallel computation and has been implemented on a multi-core system. Through time-complexity analysis and extensive benchmarks, we show our new algorithm has significantly reduced computation and memory overhead. In addition, performance evaluation via the Fermat\u2013Torricelli point problem demonstrates its effectiveness in combinatorial geometry optimizations.<\/jats:p>","DOI":"10.3390\/sym14061174","type":"journal-article","created":{"date-parts":[[2022,6,13]],"date-time":"2022-06-13T02:01:44Z","timestamp":1655085704000},"page":"1174","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Constructing Dixon Matrix for Sparse Polynomial Equations Based on Hybrid and Heuristics Scheme"],"prefix":"10.3390","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4973-932X","authenticated-orcid":false,"given":"Guoqiang","family":"Deng","sequence":"first","affiliation":[{"name":"School of Computer Science and Information Security, Guilin University of Electronic Technology, Guilin 541004, China"},{"name":"School of Mathematics and Computing Science, Guangxi Colleges and Universities Key Laboratory of Data Analysis and Computation, Guilin University of Electronic Technology, Guilin 541004, China"}]},{"given":"Niuniu","family":"Qi","sequence":"additional","affiliation":[{"name":"School of Mathematics and Computing Science, Guangxi Colleges and Universities Key Laboratory of Data Analysis and Computation, Guilin University of Electronic Technology, Guilin 541004, China"}]},{"given":"Min","family":"Tang","sequence":"additional","affiliation":[{"name":"School of Mathematics and Computing Science, Guangxi Colleges and Universities Key Laboratory of Data Analysis and Computation, Guilin University of Electronic Technology, Guilin 541004, China"}]},{"given":"Xuefeng","family":"Duan","sequence":"additional","affiliation":[{"name":"School of Mathematics and Computing Science, Guangxi Colleges and Universities Key Laboratory of Data Analysis and Computation, Guilin University of Electronic Technology, Guilin 541004, China"}]}],"member":"1968","published-online":{"date-parts":[[2022,6,7]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Mohammadi, A., Horn, J., and Gregg, R.D. (2017, January 27\u201330). Removing phase variables from biped robot parametric gaits. Proceedings of the IEEE Conference on Control Technology and Applications\u2014CCTA 2017, Waimea, HI, USA.","DOI":"10.1109\/CCTA.2017.8062563"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"2107","DOI":"10.1002\/mrm.28070","article-title":"Water-fat Dixon cardiac magnetic resonance fingerprinting","volume":"83","author":"Jaubert","year":"2020","journal-title":"Magn. Reson. Med."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"1284","DOI":"10.1007\/s10851-018-0812-2","article-title":"The Sylvester and B\u00e9zout Resultant Matrices for Blind Image Deconvolution","volume":"60","author":"Winkler","year":"2018","journal-title":"J. Math. Imaging Vis."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/s12145-018-0366-2","article-title":"Solving geoinformatics parametric polynomial systems using the improved Dixon resultant","volume":"12","author":"Lewis","year":"2019","journal-title":"Earth Sci. Inform."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/j.jsc.2012.05.007","article-title":"Application of Dixon resultant to satellite trajectory control by pole placement","volume":"50","year":"2013","journal-title":"J. Symb. Comput."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"1738","DOI":"10.1360\/jos181738","article-title":"Applying Dixon Resultants in Cryptography","volume":"18","author":"Tang","year":"2007","journal-title":"J. Softw."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/j.ifacol.2015.09.347","article-title":"Dixon Resultant for Cluster Treatment of LTI Systems with Multiple Delays","volume":"48","author":"Gao","year":"2015","journal-title":"IFAC-PapersOnLine"},{"key":"ref_8","first-page":"3064","article-title":"MR-Based PET Attenuation Correction using a Combined Ultrashort Echo Time\/Multi-Echo Dixon Acquisition","volume":"47","author":"Han","year":"2020","journal-title":"Math. Phys."},{"key":"ref_9","unstructured":"Yang, L., Zhang, J., and Hou, X. (1996). Nonlinear Algebric Equation System and Automated Theorem Proving, Shanghai Scientific and Technological Education Publishing House."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"1411","DOI":"10.1007\/s11424-016-4159-8","article-title":"Resultant elimination via implicit equation interpolation","volume":"29","author":"Tang","year":"2016","journal-title":"J. Syst. Sci. Complex."},{"key":"ref_11","first-page":"1","article-title":"Fast algorithm for constructing general Dixon resultant matrix","volume":"35","author":"Fu","year":"2005","journal-title":"Sci. China Math."},{"key":"ref_12","unstructured":"Zhao, S. (2006). Dixon Resultant Research and New Algorithms. [Ph.D. Thesis, Graduate School of Chinese Academy of Sciences, Chengdu Institute of Computer Applications]."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1360\/04YS0166","article-title":"An extended fast algorithm for constructing the Dixon resultant matrix","volume":"48","author":"Zhao","year":"2005","journal-title":"Sci. China Math."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1007\/s11425-008-0094-z","article-title":"Three kinds of extraneous factors in Dixon resultants","volume":"52","author":"Zhao","year":"2009","journal-title":"Sci. China Math."},{"key":"ref_15","first-page":"2595","article-title":"A recursive algorithm for constructing complicated Dixon matrices","volume":"217","author":"Fu","year":"2010","journal-title":"Appl. Math. Comput."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"2074","DOI":"10.1080\/00207160.2016.1276572","article-title":"Complexity of constructing Dixon resultant matrix","volume":"94","author":"Qin","year":"2017","journal-title":"Int. J. Comput. Math."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1016\/j.matcom.2007.04.007","article-title":"Heuristics to accelerate the Dixon resultant","volume":"77","author":"Lewis","year":"2008","journal-title":"Math. Comput. Simul."},{"key":"ref_18","first-page":"1376","article-title":"The Fermat-Torricelli problem on sphere with euclidean metric","volume":"38","author":"Guo","year":"2018","journal-title":"J. Syst. Sci. Math. Sci."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"2417","DOI":"10.1142\/S0218127404010709","article-title":"Exact Computation of the bifurcation Point B4 of the logistic Map and the Bailey-broadhurst Conjectures","volume":"14","author":"Kotsireas","year":"2004","journal-title":"Int. J. Bifurc. Chaos"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"1146","DOI":"10.1016\/j.matcom.2008.04.020","article-title":"Comparing acceleration techniques for the Dixon and Macaulay resultants","volume":"80","author":"Lewis","year":"2010","journal-title":"Math. Comput. Simul."},{"key":"ref_21","unstructured":"Candes, E.J. (2014, January 13\u201321). Mathematics of sparsity (and a few other things). Proceedings of the International Congress of Mathematicians 2017, Seoul, Korea."},{"key":"ref_22","unstructured":"Abramov, S.A., Zima, E.V., and Gao, X. (2016, January 19\u201322). A Fast Parallel Sparse Polynomial GCD Algorithm. Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation\u2014ISSAC 2016, Waterloo, ON, Canada."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"972","DOI":"10.1016\/j.sigpro.2009.09.024","article-title":"Robust estimation of GCD with sparse coefficients","volume":"90","author":"Qiu","year":"2010","journal-title":"Signal Process."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"1445","DOI":"10.1016\/j.tcs.2010.11.050","article-title":"Sparse interpolation of multivariate rational functions","volume":"412","author":"Cuyt","year":"2011","journal-title":"Theor. Comput. Sci."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1112\/plms\/s2-7.1.49","article-title":"The eliminant of three quantics in two independent variables","volume":"s2-7","author":"Dixon","year":"1909","journal-title":"Proc. Lond. Math. Soc."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1016\/j.cam.2007.01.032","article-title":"A structured rank-revealing method for Sylvester matrix","volume":"213","author":"Li","year":"2008","journal-title":"J. Comput. Appl. Math."},{"key":"ref_27","first-page":"649","article-title":"Multivariate Sylvester resultant and extraneous factors","volume":"40","author":"Zhao","year":"2010","journal-title":"Sci. China Math."},{"key":"ref_28","unstructured":"Kotsireas, I., and MartinezMoro, E. (2015, January 20\u201323). Computing the Dixon Resultant with the Maple Package DR. Proceedings of the Applications of Computer Algebra (ACA), Kalamata, Greece."},{"key":"ref_29","unstructured":"MacCallum, M.A.H. (1994, January 20\u201322). Algebraic and Geometric Reasoning Using Dixon Resultants. Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC \u201994, Oxford, UK."},{"key":"ref_30","unstructured":"Lu, Z. (2003). The Software of Gather2and2sift Based on Dixon Resultant. [Ph.D. Thesis, Graduate School of Chinese Academy of Sciences]."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1006\/jsco.2001.0462","article-title":"Fast Computation of the B\u00e9zout and Dixon Resultant Matrices","volume":"33","author":"Chionh","year":"2002","journal-title":"J. Symb. Comput."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/j.jsc.2003.06.001","article-title":"Corner edge cutting and Dixon A-resultant quotients","volume":"37","author":"Foo","year":"2004","journal-title":"J. Symb. Comput."},{"key":"ref_33","first-page":"7533","article-title":"Parallel computation of real solving bivariate polynomial systems by zero-matching method","volume":"219","author":"Qin","year":"2013","journal-title":"Appl. Math. Comput."},{"key":"ref_34","first-page":"189","article-title":"Index reduction of differential algebraic equations by differential Dixon resultant","volume":"328","author":"Qin","year":"2018","journal-title":"Appl. Math. Comput."},{"key":"ref_35","unstructured":"Lay, D.C. (2013). Linear Algebric and Its Applications, Addison-Wesley."},{"key":"ref_36","unstructured":"Blumenthal, L.M. (1970). Theory and Applications of Distance Geometry, Chelsea House Pub. [2nd ed.]."}],"container-title":["Symmetry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-8994\/14\/6\/1174\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T23:25:25Z","timestamp":1760138725000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-8994\/14\/6\/1174"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,7]]},"references-count":36,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2022,6]]}},"alternative-id":["sym14061174"],"URL":"https:\/\/doi.org\/10.3390\/sym14061174","relation":{},"ISSN":["2073-8994"],"issn-type":[{"type":"electronic","value":"2073-8994"}],"subject":[],"published":{"date-parts":[[2022,6,7]]}}}