{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T01:25:42Z","timestamp":1774661142733,"version":"3.50.1"},"reference-count":60,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,2,18]],"date-time":"2023-02-18T00:00:00Z","timestamp":1676678400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,2,18]],"date-time":"2023-02-18T00:00:00Z","timestamp":1676678400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Syst Sci Complex"],"published-print":{"date-parts":[[2023,4]]},"DOI":"10.1007\/s11424-023-1406-7","type":"journal-article","created":{"date-parts":[[2023,2,19]],"date-time":"2023-02-19T07:58:04Z","timestamp":1676793484000},"page":"866-883","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["VerifyRealRoots: A Matlab Package for Computing Verified Real Solutions of Polynomials Systems of Equations and Inequalities"],"prefix":"10.1007","volume":"36","author":[{"given":"Zhengfeng","family":"Yang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hanrui","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lihong","family":"Zhi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,2,18]]},"reference":[{"key":"1406_CR1","volume-title":"The Complexity of Robot Motion Planning","author":"J Canny","year":"1988","unstructured":"Canny J, The Complexity of Robot Motion Planning, MIT Press, Cambridge, MA, USA, 1988."},{"key":"1406_CR2","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.jsc.2017.03.010","volume":"86","author":"G Fl\u00f8ystad","year":"2017","unstructured":"Fl\u00f8ystad G, Kileel J, and Ottaviani G, The Chow form of the essential variety in computer vision, Journal of Symbolic Computation, 2017, 86: 97\u2013119.","journal-title":"Journal of Symbolic Computation"},{"issue":"3","key":"1406_CR3","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1023\/A:1008348724781","volume":"10","author":"S Petitjean","year":"1999","unstructured":"Petitjean S, Algebraic geometry and computer vision: Polynomial systems, real and complex roots, J. Math. Imaging Vis., 1999, 10(3): 191\u2013220.","journal-title":"J. Math. Imaging Vis."},{"key":"1406_CR4","first-page":"1","volume":"I\u2013XXII","author":"A J Sommese","year":"2005","unstructured":"Sommese A J and Wampler C W, The Numerical Solution of Systems of Polynomials \u2014 Arising in Engineering and Science, World Scientific, 2005, I\u2013XXII: 1\u2013401.","journal-title":"World Scientific"},{"key":"1406_CR5","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/3-540-07407-4_17","volume":"33","author":"G E Collins","year":"1975","unstructured":"Collins G E, Quantifier elimination for real closed fields by cylindrical algebraic decomposition, Lecture Notes in Computer Science, 1975, 33: 134\u2013183.","journal-title":"Lecture Notes in Computer Science"},{"issue":"6","key":"1406_CR6","doi-asserted-by":"publisher","first-page":"1002","DOI":"10.1145\/235809.235813","volume":"43","author":"S Basu","year":"1996","unstructured":"Basu S, Pollack R, and Roy M F, On the combinatorial and algebraic complexity of quantifier elimination, Journal of ACM, 1996, 43(6): 1002\u20131045.","journal-title":"Journal of ACM"},{"key":"1406_CR7","doi-asserted-by":"crossref","unstructured":"Basu S, Pollack R, and Roy M F, Quantifier Elimination and Cylindrical Algebraic Decomposition, Springer Vienna, Vienna, Chapter A new algorithm to find a point in every cell defined by a family of polynomials, 1998, 341\u2013350.","DOI":"10.1007\/978-3-7091-9459-1_17"},{"issue":"5","key":"1406_CR8","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1093\/comjnl\/36.5.427","volume":"36","author":"J Heintz","year":"1993","unstructured":"Heintz J, Roy M F, and Solern\u00f3 P, On the theoretical and practical complexity of the existential theory of reals, The Computer Journal, 1993, 36(5): 427\u2013431.","journal-title":"The Computer Journal"},{"issue":"3","key":"1406_CR9","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/S0747-7171(10)80003-3","volume":"13","author":"J Renegar","year":"1992","unstructured":"Renegar J, On the computational complexity and geometry of the first-order theory of the reals. Part I: Introduction, Preliminaries, The geometry of semi-algebraic sets, The decision problem for the existential theory of the reals, Journal of Symbolic Computation, 1992, 13(3): 255\u2013299.","journal-title":"Journal of Symbolic Computation"},{"issue":"3","key":"1406_CR10","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/S0747-7171(08)80152-6","volume":"12","author":"G E Collins","year":"1991","unstructured":"Collins G E and Hong H, Partial cylindrical algebraic decomposition for quantifier elimination, Journal of Symbolic Computation, 1991, 12(3): 299\u2013328.","journal-title":"Journal of Symbolic Computation"},{"issue":"4","key":"1406_CR11","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1145\/968708.968710","volume":"37","author":"C W Brown","year":"2003","unstructured":"Brown C W, QEPCAD B: A program for computing with semi-algebraic sets using CADs, SIGSAM Bull., 2003, 37(4): 97\u2013108.","journal-title":"SIGSAM Bull."},{"key":"1406_CR12","doi-asserted-by":"crossref","unstructured":"Seidl A and Sturm T, A generic projection operator for partial cylindrical algebraic decomposition, Proceedings of the 28th International Symposium on Symbolic and Algebraic Computation, 2003, 240\u2013247.","DOI":"10.1145\/860854.860903"},{"issue":"5","key":"1406_CR13","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1016\/j.future.2006.10.009","volume":"23","author":"H Yanami","year":"2007","unstructured":"Yanami H and Anai H, The maple package SyNRAC and its application to robust control design, Future Generation Computer Systems, 2007, 23(5): 721\u2013726.","journal-title":"Future Generation Computer Systems"},{"issue":"3","key":"1406_CR14","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1145\/1358190.1358197","volume":"41","author":"B Xia","year":"2007","unstructured":"Xia B, DISCOVERER: A tool for solving semi-algebraic systems, ACM Commun. Comput. Algebra, 2007, 41(3): 102\u2013103.","journal-title":"ACM Commun. Comput. Algebra"},{"issue":"5","key":"1406_CR15","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1006\/jsco.2002.0572","volume":"34","author":"B Xia","year":"2002","unstructured":"Xia B and Yang L, An algorithm for isolating the real solutions of semi-algebraic systems, Journal of Symbolic Computation, 2002, 34(5): 461\u2013477.","journal-title":"Journal of Symbolic Computation"},{"key":"1406_CR16","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1016\/j.jsc.2015.11.008","volume":"75","author":"C Chen","year":"2016","unstructured":"Chen C and Maza M M, Quantifier elimination by cylindrical algebraic decomposition based on regular chains, Journal of Symbolic Computation, 2016, 75: 74\u201393.","journal-title":"Journal of Symbolic Computation"},{"issue":"6","key":"1406_CR17","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1006\/jsco.2002.0563","volume":"34","author":"P Aubry","year":"2002","unstructured":"Aubry P, Rouillier F, and Safey El Din M, Real solving for positive dimensional systems, Journal of Symbolic Computation, 2002, 34(6): 543\u2013560.","journal-title":"Journal of Symbolic Computation"},{"issue":"1","key":"1406_CR18","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/PL00004896","volume":"238","author":"B Bank","year":"2001","unstructured":"Bank B, Giusti M, Heintz J, et al., Polar varieties and efficient real elimination, Mathematische Zeitschrift, 2001, 238(1): 115\u2013144.","journal-title":"Mathematische Zeitschrift"},{"issue":"1","key":"1406_CR19","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s00200-009-0117-1","volume":"21","author":"B Bank","year":"2010","unstructured":"Bank B, Giusti M, Heintz J, et al., On the geometry of polar varieties, Applicable Algebra in Engineering, Communication and Computing, 2010, 21(1): 33\u201383.","journal-title":"Applicable Algebra in Engineering, Communication and Computing"},{"issue":"4","key":"1406_CR20","doi-asserted-by":"publisher","first-page":"716","DOI":"10.1006\/jcom.2000.0563","volume":"16","author":"F Rouillier","year":"2000","unstructured":"Rouillier F, Roy M F, and Safey El Din M, Finding at least one point in each connected component of a real algebraic set defined by a single equation, Journal of Complexity, 2000, 16(4): 716\u2013750.","journal-title":"Journal of Complexity"},{"key":"1406_CR21","doi-asserted-by":"crossref","unstructured":"Safey El Din M and Schost E, Polar varieties and computation of one point in each connected component of a smooth real algebraic set, Proceedings of the 28th International Symposium on Symbolic and Algebraic Computation, 2003, 224\u2013231.","DOI":"10.1145\/860854.860901"},{"key":"1406_CR22","unstructured":"Safey El Din M, Raglib (Real Algebraic Geometry Library), Maple Package, 2007."},{"key":"1406_CR23","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1080\/10586458.2011.606184","volume":"21","author":"C Beltr\u00e1n","year":"2012","unstructured":"Beltr\u00e1n C and Leykin A, Certified numerical homotopy tracking, Experimental Mathematics, 2012, 21: 69\u201383.","journal-title":"Experimental Mathematics"},{"issue":"2","key":"1406_CR24","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/s10208-013-9143-2","volume":"13","author":"C Beltr\u00e1n","year":"2013","unstructured":"Beltr\u00e1n C and Leykin A, Robust certified numerical homotopy tracking, Foundations of Computational Mathematics, 2013, 13(2): 253\u2013295.","journal-title":"Foundations of Computational Mathematics"},{"issue":"4","key":"1406_CR25","doi-asserted-by":"publisher","first-page":"28:1","DOI":"10.1145\/2331130.2331136","volume":"38","author":"J D Hauenstein","year":"2012","unstructured":"Hauenstein J D and Sottile F, Algorithm 921: AlphaCertified: Certifying solutions to polynomial systems, ACM Trans. Math. Softw., 2012, 38(4): 28:1\u201328:20.","journal-title":"ACM Trans. Math. Softw."},{"key":"1406_CR26","doi-asserted-by":"crossref","unstructured":"Shen F, Wu W, and Xia B, Real root isolation of polynomial equations based on hybrid computation, Computer Mathematics: 9th Asian Symposium (ASCM 2009), 2014, 375\u2013396.","DOI":"10.1007\/978-3-662-43799-5_26"},{"issue":"1","key":"1406_CR27","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/s11424-019-8349-z","volume":"32","author":"Y Wang","year":"2019","unstructured":"Wang Y and Xia B, A Hybrid procedure for finding real points on a real algebraic set, Journal of Systems Science and Complexity, 2019, 32(1): 185\u2013204.","journal-title":"Journal of Systems Science and Complexity"},{"issue":"3","key":"1406_CR28","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/BF02234767","volume":"4","author":"R Krawczyk","year":"1969","unstructured":"Krawczyk R, Newton-algorithmen zur bestimmung von nullstellen mit fehlerschranken, Computing, 1969, 4(3): 187\u2013201.","journal-title":"Computing"},{"issue":"4","key":"1406_CR29","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1137\/0714040","volume":"14","author":"R E Moore","year":"1977","unstructured":"Moore R E, A test for existence of solutions to nonlinear systems, SIAM Journal on Numerical Analysis, 1977, 14(4): 611\u2013615.","journal-title":"SIAM Journal on Numerical Analysis"},{"key":"1406_CR30","doi-asserted-by":"crossref","unstructured":"Rump S M, Solving algebraic problems with high accuracy, Proc. of the Symposium on a New Approach to Scientific Computation, 1983, 51\u2013120.","DOI":"10.1016\/B978-0-12-428660-3.50010-0"},{"key":"1406_CR31","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/j.tcs.2012.10.028","volume":"479","author":"N Li","year":"2013","unstructured":"Li N and Zhi L, Verified error bounds for isolated singular solutions of polynomial systems: Case of breadth one, Theoretical Computer Science, 2013, 479: 163\u2013173.","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"1406_CR32","doi-asserted-by":"publisher","first-page":"1623","DOI":"10.1137\/120902914","volume":"52","author":"N Li","year":"2014","unstructured":"Li N and Zhi L, Verified error bounds for isolated singular solutions of polynomial systems, SIAM Journal on Numerical Analysis, 2014, 52(4): 1623\u20131640.","journal-title":"SIAM Journal on Numerical Analysis"},{"issue":"3","key":"1406_CR33","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/s11075-009-9339-3","volume":"54","author":"S M Rump","year":"2010","unstructured":"Rump S M and Graillat S, Verified error bounds for multiple roots of systems of nonlinear equations, Numerical Algorithms, 2010, 54(3): 359\u2013377.","journal-title":"Numerical Algorithms"},{"key":"1406_CR34","doi-asserted-by":"crossref","unstructured":"Hauenstein J D, Mourrain B, and Szanto A, Certifying isolated singular points and their multiplicity structure, Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation, 2015, 213\u2013220.","DOI":"10.1145\/2755996.2756645"},{"key":"1406_CR35","doi-asserted-by":"crossref","unstructured":"Mantzaflaris A and Mourrain B, Deflation and certified isolation of singular zeros of polynomial systems, Proceedings of the 36th International Symposium on Symbolic and Algebraic Computation, 2011, 249\u2013256.","DOI":"10.1145\/1993886.1993925"},{"key":"1406_CR36","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-94-017-1247-7_7","volume-title":"Developments in Reliable Computing","author":"S M Rump","year":"1999","unstructured":"Rump S M, INTLAB \u2014 INTerval LABoratory, Developments in Reliable Computing, Springer, Dordrecht, 1999, 77\u2013104."},{"key":"1406_CR37","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/j.jsc.2017.03.004","volume":"84","author":"T A Akoglu","year":"2018","unstructured":"Akoglu T A, Hauenstein J D, and Szanto A, Certifying solutions to overdetermined and singular polynomial systems over Q, Journal of Symbolic Computation, 2018, 84: 147\u2013171.","journal-title":"Journal of Symbolic Computation"},{"issue":"2","key":"1406_CR38","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/s00211-010-0332-5","volume":"117","author":"X Chen","year":"2011","unstructured":"Chen X, Frommer A, and Lang B, computational existence proofs for spherical T-designs, Nummer. Math., 2011, 117(2): 289\u2013305.","journal-title":"Nummer. Math."},{"issue":"6","key":"1406_CR39","doi-asserted-by":"publisher","first-page":"2326","DOI":"10.1137\/050626636","volume":"44","author":"X Chen","year":"2006","unstructured":"Chen X and Womersley R S, Existence of solutions to systems of underdetermined equations and spherical designs, SIAM J. NUMER. ANAL., 2006, 44(6): 2326\u20132341.","journal-title":"SIAM J. NUMER. ANAL."},{"issue":"3","key":"1406_CR40","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1006\/jcom.2000.0554","volume":"16","author":"A J Sommese","year":"2000","unstructured":"Sommese A J and Verschelde J, Numerical homotopies to compute generic points on positive dimensional algebraic sets, Journal of Complexity, 2000, 16(3): 572\u2013602.","journal-title":"Journal of Complexity"},{"key":"1406_CR41","unstructured":"Sommese A J, Verschelde J, and Wampler C W, Numerical algebraic geometry, The Mathematics of Numerical Analysis (Park City, UT, 1995), 1996, 749\u2013763."},{"key":"1406_CR42","doi-asserted-by":"crossref","unstructured":"Everett H, Lazard D, Lazard S, et al., The voronoi diagram of three lines, Proceedings of the Twenty-Third Annual Symposium on Computational Geometry, 2007, 255\u2013264.","DOI":"10.1145\/1247069.1247116"},{"key":"1406_CR43","doi-asserted-by":"crossref","unstructured":"Yang Z, Zhi Li, and Zhu Y, Verified error bounds for real solutions of positive-dimensional polynomial systems, Proceedings of the 38th International Symposium on Symbolic and Algebraic Computation, 2013, 371\u2013378.","DOI":"10.1145\/2465506.2465951"},{"issue":"13","key":"1406_CR44","doi-asserted-by":"publisher","first-page":"1239","DOI":"10.1002\/rnc.839","volume":"13","author":"C Graziano","year":"2003","unstructured":"Graziano C, Garulli A, Tesi A, et al., Characterizing the solution set of polynomial systems in terms of homogeneous forms: An LMI approach, International Journal of Robust and Nonlinear Control, 2003, 13(13): 1239\u20131257.","journal-title":"International Journal of Robust and Nonlinear Control"},{"key":"1406_CR45","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/10997703_15","volume":"312","author":"D Henrion","year":"2005","unstructured":"Henrion D and Lasserre J B, Detecting global optimality and extracting solutions in GloptiPoly, Positive Polynomials in Control, 2005, 312: 293\u2013310.","journal-title":"Positive Polynomials in Control"},{"key":"1406_CR46","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1007\/s10208-007-9004-y","volume":"8","author":"J B Lasserre","year":"2008","unstructured":"Lasserre J B, Laurent M, and Rostalski P, Semidefinite characterization and computation of zero-dimensional real radical ideals, Foundations of Computational Mathematics, 2008, 8: 607\u2013647.","journal-title":"Foundations of Computational Mathematics"},{"key":"1406_CR47","doi-asserted-by":"publisher","DOI":"10.1142\/p665","volume-title":"Moments, Positive Polynomials and Their Applications","author":"J B Lasserre","year":"2009","unstructured":"Lasserre J B, Moments, Positive Polynomials and Their Applications, Imperial College Press, London, 2009."},{"key":"1406_CR48","doi-asserted-by":"crossref","unstructured":"Ma Y and Zhi L, Computing real solutions of polynomial systems via low-rank moment matrix completion, Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation, 2012, 249\u2013256.","DOI":"10.1145\/2442829.2442866"},{"issue":"1","key":"1406_CR49","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/j.tcs.2006.02.018","volume":"359","author":"A Leykin","year":"2006","unstructured":"Leykin A, Verschelde J, and Zhao A, Newton\u2019s method with deflation for isolated singularities of polynomial systems, Theoretical Computer Science, 2006, 359(1): 111\u2013122.","journal-title":"Theoretical Computer Science"},{"key":"1406_CR50","doi-asserted-by":"crossref","unstructured":"Greuet A and Safey El Din M, Deciding reachability of the infimum of a multivariate polynomial, Proceedings of the 36th International Symposium on Symbolic and Algebraic Computation, 2011, 131\u2013138.","DOI":"10.1145\/1993886.1993910"},{"key":"1406_CR51","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1090\/dimacs\/060\/10","volume-title":"Algorithmic and Quantitative Real Algebraic Geometry","author":"F Rouillier","year":"2003","unstructured":"Rouillier F, Efficient algorithms based on critical points method, Algorithmic and Quantitative Real Algebraic Geometry, American Mathematical Society, Providence, 2003, 123\u2013138."},{"key":"1406_CR52","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/s10208-011-9112-6","volume":"12","author":"B Bank","year":"2012","unstructured":"Bank B, Giusti M, Heintz J, et al., Algorithms of intrinsic complexity for point searching in compact real singular hypersurfaces, Foundations of Computational Mathematics, 2012, 12: 75\u2013122.","journal-title":"Foundations of Computational Mathematics"},{"key":"1406_CR53","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/978-0-387-75155-9_6","volume-title":"Algorithm in Algebraic Geometry","author":"H C Mork","year":"2008","unstructured":"Mork H C and Piene R, Polars of real singular plane curves, Algorithm in Algebraic Geometry, Springer, New York, 2008, 99\u2013115."},{"issue":"1","key":"1406_CR54","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/s10440-012-9782-3","volume":"125","author":"J D Hauenstein","year":"2013","unstructured":"Hauenstein J D, Numerically computing real points on algebraic sets, Acta Applicandae Mathematicae, 2013, 125(1): 105\u2013119.","journal-title":"Acta Applicandae Mathematicae"},{"key":"1406_CR55","doi-asserted-by":"crossref","unstructured":"Bates D J, Hauenstein J D, Sommese A J, et al., Bertini: Software for Numerical Algebraic Geometry, http:\/\/www.nd.edu\/\u223csommese\/bertini, 2018.","DOI":"10.1016\/j.jsc.2016.07.015"},{"issue":"1","key":"1406_CR56","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1137\/110827247","volume":"50","author":"N Li","year":"2012","unstructured":"Li N and Zhi L, Computing isolated singular solutions of polynomial systems: Case of breadth one, SIAM Journal on Numerical Analysis, 2012, 50(1): 354\u2013372.","journal-title":"SIAM Journal on Numerical Analysis"},{"issue":"3","key":"1406_CR57","doi-asserted-by":"publisher","first-page":"909","DOI":"10.1090\/S0894-0347-07-00589-9","volume":"21","author":"C Bachoc","year":"2008","unstructured":"Bachoc C and Vallentin F, New upper bounds for kissing numbers from semidefinite programming, Journal of the American Mathematical Society, 2008, 21(3): 909\u2013924.","journal-title":"Journal of the American Mathematical Society"},{"key":"1406_CR58","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.jsc.2012.05.007","volume":"50","author":"B Palancz","year":"2013","unstructured":"Palancz B, Application of Dixon resultant to satellite trajectory control by pole placement, Journal of Symbolic Computation, 2013, 50: 79\u201399.","journal-title":"Journal of Symbolic Computation"},{"issue":"8","key":"1406_CR59","doi-asserted-by":"publisher","first-page":"1393","DOI":"10.1109\/TAC.2004.832680","volume":"49","author":"J Verschelde","year":"2004","unstructured":"Verschelde J and Wang Y, Computing dynamic output feedback laws, IEEE Trans. Automatic Control, 2004, 49(8): 1393\u20131397.","journal-title":"IEEE Trans. Automatic Control"},{"key":"1406_CR60","doi-asserted-by":"crossref","unstructured":"Dietmater P, The Stewart-Gough platform of general geometry can have 40 real postures, Advances in Robot Kinematics: Analysis and Control, 1998, 1\u201310.","DOI":"10.1007\/978-94-015-9064-8_1"}],"container-title":["Journal of Systems Science and Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-023-1406-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11424-023-1406-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-023-1406-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,19]],"date-time":"2023-04-19T22:03:30Z","timestamp":1681941810000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11424-023-1406-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2,18]]},"references-count":60,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,4]]}},"alternative-id":["1406"],"URL":"https:\/\/doi.org\/10.1007\/s11424-023-1406-7","relation":{},"ISSN":["1009-6124","1559-7067"],"issn-type":[{"value":"1009-6124","type":"print"},{"value":"1559-7067","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,2,18]]},"assertion":[{"value":"21 October 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 December 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 February 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}