乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,14]],"date-time":"2024-09-14T14:21:34Z","timestamp":1726323694762},"reference-count":39,"publisher":"Association for Computing Machinery (ACM)","issue":"4","funder":[{"DOI":"10.13039\/100000121","name":"Division of Mathematical Sciences","doi-asserted-by":"publisher","award":["DMS-0915211DMS-0922866DMS-1114336"],"id":[{"id":"10.13039\/100000121","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Math. Softw."],"published-print":{"date-parts":[[2012,8]]},"abstract":"\n Smale\u2019s\n \u03b1<\/jats:italic>\n -theory uses estimates related to the convergence of Newton\u2019s method to certify that Newton iterations will converge quadratically to solutions to a square polynomial system. The program\n alphaCertified<\/jats:bold>\n implements algorithms based on\n \u03b1<\/jats:italic>\n -theory to certify solutions of polynomial systems using both exact rational arithmetic and arbitrary precision floating point arithmetic. It also implements algorithms that certify whether a given point corresponds to a real solution, and algorithms to heuristically validate solutions to overdetermined systems. Examples are presented to demonstrate the algorithms.\n <\/jats:p>","DOI":"10.1145\/2331130.2331136","type":"journal-article","created":{"date-parts":[[2012,9,4]],"date-time":"2012-09-04T12:50:47Z","timestamp":1346763047000},"page":"1-20","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":79,"title":["Algorithm 921"],"prefix":"10.1145","volume":"38","author":[{"given":"Jonathan D.","family":"Hauenstein","sequence":"first","affiliation":[{"name":"Texas A&M University"}]},{"given":"Frank","family":"Sottile","sequence":"additional","affiliation":[{"name":"Texas A&M University"}]}],"member":"320","published-online":{"date-parts":[[2012,8]]},"reference":[{"key":"e_1_2_2_1_1","volume-title":"Classics in Applied Mathematics Series","volume":"45","author":"Allgower E."},{"key":"e_1_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/060658862"},{"key":"e_1_2_2_3_1","volume-title":"Contemp. Math. Series","volume":"496","author":"Bates D."},{"key":"e_1_2_2_4_1","doi-asserted-by":"crossref","unstructured":"Bates D. J. Hauenstein J. D. Peterson C. and Sommese A. J. 2009b. Numerical decomposition of the rank-deficiency set of a matrix of multivariate polynomials. In Approximate Commutative Algebra Texts and Monographs in Symbolic Computation Springer 55--77. Bates D. J. Hauenstein J. D. Peterson C. and Sommese A. J. 2009b. Numerical decomposition of the rank-deficiency set of a matrix of multivariate polynomials. In Approximate Commutative Algebra Texts and Monographs in Symbolic Computation Springer 55--77.","DOI":"10.1007\/978-3-211-99314-9_2"},{"key":"e_1_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11075-011-9463-8"},{"key":"e_1_2_2_6_1","volume-title":"Bertini: Software for numerical algebraic geometry. www.nd.edu\/~sommese\/bertini.","author":"Bates D.","year":"2012"},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/190347.190382"},{"key":"e_1_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1080\/10586458.2011.606184"},{"key":"e_1_2_2_9_1","doi-asserted-by":"crossref","unstructured":"Blum L. Cucker F. Shub M. and Smale S. 1998. Complexity and Real Computation. Springer. Blum L. Cucker F. Shub M. and Smale S. 1998. Complexity and Real Computation . Springer.","DOI":"10.1007\/978-1-4612-0701-6"},{"key":"e_1_2_2_10_1","unstructured":"Decker W. Greuel G.-M. Pfister G. and Sch\u00f6nemann H. 2010. SINGULAR 3-1-1 --- A computer algebra system for polynomial computations. www.singular.uni-kl.de. Decker W. Greuel G.-M. Pfister G. and Sch\u00f6nemann H. 2010. SINGULAR 3-1-1 --- A computer algebra system for polynomial computations. www.singular.uni-kl.de."},{"key":"e_1_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-99-01115-1"},{"key":"e_1_2_2_12_1","volume-title":"Advances in Robot Kinematics: Analysis and Control","author":"Dietmaier P."},{"key":"e_1_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1236463.1236468"},{"key":"e_1_2_2_14_1","volume-title":"Proceedings of the Symposium on Pure Mathematics Series","volume":"62","author":"Fulton W."},{"key":"e_1_2_2_15_1","unstructured":"Garc\u00eda-Puente L. Hein N. Hillar C. del Campo-Sanchez A. M. Ruffo J. Sottile F. and Teitler Z. 2010. The Secant Conjecture in the real Schubert calculus. ArXiv.org\/1010.0665. Garc\u00eda-Puente L. Hein N. Hillar C. del Campo-Sanchez A. M. Ruffo J. Sottile F. and Teitler Z. 2010. The Secant Conjecture in the real Schubert calculus. ArXiv.org\/1010.0665."},{"key":"e_1_2_2_16_1","volume-title":"Matrix Computations","author":"Golub G.","edition":"3"},{"key":"e_1_2_2_17_1","volume-title":"Proc. Auto Div. Inst. Mech. Eng., 392--394","author":"Gough V.","year":"1957"},{"key":"e_1_2_2_18_1","unstructured":"Hauenstein J. and Sottile F. 2011. alphaCertified: Software for certifying numerical solutions to polynomial equations. www.math.tamu.edu\/~sottile\/research\/stories\/alphaCertified. Hauenstein J. and Sottile F. 2011. alphaCertified: Software for certifying numerical solutions to polynomial equations. www.math.tamu.edu\/~sottile\/research\/stories\/alphaCertified."},{"key":"e_1_2_2_19_1","unstructured":"Hauenstein J. Hein N. del Campo-Sanchez A. M. and Sottile F. 2010. Beyond the Shapiro Conjecture and Eremenko-Gabrielov lower bounds. www.math.tamu.edu\/~sottile\/research\/pages\/lower Shapiro\/. Hauenstein J. Hein N. del Campo-Sanchez A. M. and Sottile F. 2010. Beyond the Shapiro Conjecture and Eremenko-Gabrielov lower bounds. www.math.tamu.edu\/~sottile\/research\/pages\/lower Shapiro\/."},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-2010-02399-3"},{"key":"e_1_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.4171\/CMH\/153"},{"key":"e_1_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2010.01.001"},{"key":"e_1_2_2_23_1","unstructured":"Kostlan E. 1987. Random polynomials and the statistical fundamental theorem of algebra. www.developmentserver.com\/randompolynomials\/rpsfta. Kostlan E. 1987. Random polynomials and the statistical fundamental theorem of algebra. www.developmentserver.com\/randompolynomials\/rpsfta."},{"key":"e_1_2_2_24_1","volume-title":"Real Analysis","author":"Lang S.","edition":"2"},{"key":"e_1_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00607-008-0015-6"},{"key":"e_1_2_2_26_1","doi-asserted-by":"crossref","unstructured":"Leykin A. and Sottile F. 2009. Galois groups of Schubert problems via homotopy computation. Math. Comput. 78 267 1749--1765. Leykin A. and Sottile F. 2009. Galois groups of Schubert problems via homotopy computation. Math. Comput. 78 267 1749--1765.","DOI":"10.1090\/S0025-5718-09-02239-X"},{"key":"e_1_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0894-0347-05-00477-7"},{"key":"e_1_2_2_28_1","volume-title":"Solving Polynomial Systems Using Continuation for Engineering and Scientific Problems. Classics in Applied Mathematics, 57","author":"Morgan A."},{"key":"e_1_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1115\/1.2916909"},{"key":"e_1_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.4007\/annals.2009.170.863"},{"key":"e_1_2_2_31_1","first-page":"459","article-title":"Complexity of B\u2019ezout\u2019s theorem. I. Geometric aspects","volume":"6","author":"Shub M.","year":"1993","journal-title":"J. Amer. Math. Soc."},{"key":"e_1_2_2_32_1","volume-title":"The Merging of Disciplines: New Directions in Pure, Applied, and Computational Mathematics","author":"Smale S."},{"key":"e_1_2_2_33_1","volume-title":"C","author":"Sommese A.","year":"2005"},{"key":"e_1_2_2_34_1","volume-title":"Contemp. Mathematics Series","volume":"286","author":"Sommese A."},{"key":"e_1_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0273-0979-09-01276-2"},{"key":"e_1_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1243\/PIME_PROC_1965_180_029_02"},{"key":"e_1_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/317275.317286"},{"key":"e_1_2_2_38_1","unstructured":"Verschelde J. 1999b. Polynomial formulation and solutions of Stewart-Gough platform with 40 real positions. www.math.uic.edu\/~jan\/Demo\/stewgou40.html. Verschelde J. 1999b. Polynomial formulation and solutions of Stewart-Gough platform with 40 real positions. www.math.uic.edu\/~jan\/Demo\/stewgou40.html."},{"key":"e_1_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1631-073X(03)00059-1"}],"container-title":["ACM Transactions on Mathematical Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2331130.2331136","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,30]],"date-time":"2022-12-30T06:31:19Z","timestamp":1672381879000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2331130.2331136"}},"subtitle":["alphaCertified: Certifying Solutions to Polynomial Systems"],"short-title":[],"issued":{"date-parts":[[2012,8]]},"references-count":39,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2012,8]]}},"alternative-id":["10.1145\/2331130.2331136"],"URL":"https:\/\/doi.org\/10.1145\/2331130.2331136","relation":{},"ISSN":["0098-3500","1557-7295"],"issn-type":[{"value":"0098-3500","type":"print"},{"value":"1557-7295","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,8]]},"assertion":[{"value":"2010-11-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2011-09-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2012-08-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}