{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T02:04:44Z","timestamp":1760061884349},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2011,6,1]],"date-time":"2011-06-01T00:00:00Z","timestamp":1306886400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math.Comput.Sci."],"published-print":{"date-parts":[[2011,6]]},"DOI":"10.1007\/s11786-011-0089-y","type":"journal-article","created":{"date-parts":[[2011,11,14]],"date-time":"2011-11-14T11:44:53Z","timestamp":1321271093000},"page":"179-194","source":"Crossref","is-referenced-by-count":5,"title":["Pivoting in Extended Rings for Computing Approximate Gr\u00f6bner Bases"],"prefix":"10.1007","volume":"5","author":[{"given":"Jean-Charles","family":"Faug\u00e8re","sequence":"first","affiliation":[]},{"given":"Ye","family":"Liang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,11,15]]},"reference":[{"issue":"12","key":"89_CR1","doi-asserted-by":"crossref","first-page":"883","DOI":"10.1016\/j.jsc.2008.05.002","volume":"43","author":"J. Abbott","year":"2008","unstructured":"Abbott J., Fassino C., Torrente M.-L.: Stable border bases for ideals of points. J. Symb. Comput. 43(12), 883\u2013894 (2008)","journal-title":"J. Symb. Comput."},{"key":"89_CR2","doi-asserted-by":"crossref","unstructured":"Auzinger, W., Stetter, H.: An elimination algorithm for the computation of all zeros of a system of multivariate polynomial equations. In: Conference in Numerical Analysis, pp. 11\u201330. Birkh\u00e4user-Verlag (1988)","DOI":"10.1007\/978-3-0348-6303-2_2"},{"key":"89_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0913-3","volume-title":"Gr\u00f6bner Bases: A Computational Approach to Commutative Algebra","author":"T. Becker","year":"1993","unstructured":"Becker T., Kredel H., Weispfenning V.: Gr\u00f6bner Bases: A Computational Approach to Commutative Algebra. Springer, London (1993)"},{"key":"89_CR4","unstructured":"Buchberger, B.: Ein Algorithmus zum Auffinden der Basiselemente des Restklassenringes nach einem nulldimensionalen Polynomideal. PhD thesis, Innsbruck (1965)"},{"key":"89_CR5","doi-asserted-by":"crossref","unstructured":"Buchberger, B.: Gr\u00f6bner-bases: an algorithmic method in polynomial ideal theory. In: Multidimensional Systems Theory\u2014Progress Directions and Open Problems in Multidimensional Systems, pp. 184\u2013232. Reidel Publishing Company, Dordrecht (1985)","DOI":"10.1007\/978-94-009-5225-6_6"},{"key":"89_CR6","doi-asserted-by":"crossref","unstructured":"Buchberger, B.: An algorithm for finding the basis elements in the residue class ring modulo a zero dimensional polynomial ideal. J. Symb. Comput. 41(3\u20134) (2006)","DOI":"10.1016\/j.jsc.2005.09.007"},{"key":"89_CR7","doi-asserted-by":"crossref","unstructured":"Chen, Y., Meng, X.: Border bases of positive dimensional polynomial ideals. In: SNC \u201907: Proceedings of the 2007 International Workshop on Symbolic-Numeric Computation, pp. 65\u201371, New York, NY, USA. ACM (2007)","DOI":"10.1145\/1277500.1277512"},{"issue":"4","key":"89_CR8","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1145\/242961.242968","volume":"30","author":"R.M. Corless","year":"1996","unstructured":"Corless R.M.: Groebner Bases and Matrix Eigenproblems. SIGSAM Bull. (Commun. Comput. Algebra) 30(4), 26\u201332 (1996)","journal-title":"SIGSAM Bull. (Commun. Comput. Algebra)"},{"key":"89_CR9","volume-title":"Using Algebraic Geometry","author":"D. Cox","year":"2005","unstructured":"Cox D., Little J., O\u2019Shea D.: Using Algebraic Geometry, 2nd edn. Springer, Reading (2005)","edition":"2"},{"issue":"1\u20133","key":"89_CR10","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/S0022-4049(99)00005-5","volume":"139","author":"J.-C. Faug\u00e8re","year":"1999","unstructured":"Faug\u00e8re J.-C.: A new efficient algorithm for computing Gr\u00f6bner basis (F4). J. Pure Appl. Algebra 139(1\u20133), 61\u201388 (1999)","journal-title":"J. Pure Appl. Algebra"},{"key":"89_CR11","doi-asserted-by":"crossref","unstructured":"Faug\u00e8re, J.-C.: A new efficient algorithm for computing Gr\u00f6bner bases without reduction to zero (F5). In: Proceedings of the 2002 International Symposium on Symbolic and Algebraic Computation ISSAC, pp. 75\u201383, New York, NY, USA. ACM (2002)","DOI":"10.1145\/780506.780516"},{"issue":"4","key":"89_CR12","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1006\/jsco.1993.1051","volume":"16","author":"J.-C. Faug\u00e8re","year":"1993","unstructured":"Faug\u00e8re J.-C., Gianni P., Lazard D., Mora T.: Efficient computation of zero-dimensional Gr\u00f6bner basis by change of ordering. J. Symb. Comput. 16(4), 329\u2013344 (1993)","journal-title":"J. Symb. Comput."},{"key":"89_CR13","unstructured":"Faug\u00e8re, J.-C., Liang, Y.: Numerical computation of Gr\u00f6bner bases for zero-dimensional polynomial ideals. In: Electronic Proceedings of MACIS 2007, Paris, December 2007. http:\/\/www-spiral.lip6.fr\/MACIS2007\/Papers\/FL_MACIS2007final.pdf (2007)"},{"issue":"4","key":"89_CR14","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1016\/j.jsc.2010.11.001","volume":"46","author":"J.-C. Faug\u00e8re","year":"2011","unstructured":"Faug\u00e8re J.-C., Liang Y.: Artificial discontinuities of single-parametric Gr\u00f6bner bases. J. Symb. Comput. 46(4), 459\u2013466 (2011)","journal-title":"J. Symb. Comput."},{"key":"89_CR15","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/j.jpaa.2004.08.028","volume":"196","author":"A. Kehrein","year":"2005","unstructured":"Kehrein A., Kreuzer M.: Characterizations of border bases. J. Pure Appl. Algebra 196, 251\u2013270 (2005)","journal-title":"J. Pure Appl. Algebra"},{"issue":"2","key":"89_CR16","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/j.jpaa.2005.07.006","volume":"205","author":"A. Kehrein","year":"2006","unstructured":"Kehrein A., Kreuzer M.: Computing border bases. J. Pure Appl. Algebra 205(2), 279\u2013295 (2006)","journal-title":"J. Pure Appl. Algebra"},{"key":"89_CR17","first-page":"160","volume-title":"Solving Polynomial Equations: Foundations, Algorithms, and Applications, Algorithms and Computation in Mathematics","author":"A. Kehrein","year":"2005","unstructured":"Kehrein A., Kreuzer M., Robbiano L.: An algebraist\u2019s view on border bases. In: Dickenstein, A., Emiris, I. (eds) Solving Polynomial Equations: Foundations, Algorithms, and Applications, Algorithms and Computation in Mathematics, pp. 160\u2013202. Springer, Heidelberg (2005)"},{"key":"89_CR18","unstructured":"Kondratyev, A.: Numerical Computation of Gr\u00f6bner Bases. Technical report, University of Linz, Austria, March 2004. RISC Report Series"},{"key":"89_CR19","doi-asserted-by":"crossref","unstructured":"M\u00f6ller, H.: Systems of algebraic equations solved by means of endomorphisms. In: AAECC-10: Proceedings of the 10th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, pp. 43\u201356. Springer, Berlin (1993)","DOI":"10.1007\/3-540-56686-4_32"},{"key":"89_CR20","doi-asserted-by":"crossref","unstructured":"M\u00f6ller, H., Buchberger, B.: The construction of multivariate polynomials with preassigned zeros. In: EUROCAM, pp. 24\u201331 (1982)","DOI":"10.1007\/3-540-11607-9_3"},{"key":"89_CR21","doi-asserted-by":"crossref","unstructured":"Mourrain, B.: A new criterion for normal form algorithms. In: AAECC-13: Proceedings of the 13th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, pp. 430\u2013443. Springer, Berlin (1999)","DOI":"10.1007\/3-540-46796-3_41"},{"key":"89_CR22","doi-asserted-by":"crossref","unstructured":"Mourrain, B., Tr\u00e9buchet, P.: Generalized normal forms and polynomial system solving. In: International Symposium on Symbolic and Algebraic Computation, pp. 253\u2013260. ACM, New York (2005)","DOI":"10.1145\/1073884.1073920"},{"key":"89_CR23","doi-asserted-by":"crossref","unstructured":"Reid, G., Tang, J., Yu, J., Zhi, L.: Hybrid method for solving new pose estimation equation system. In: Proceedings of the 2004 International Workshop on Computer and Geometric Algebra with Applications, pp. 46\u201357. Springer, Berlin (2005)","DOI":"10.1007\/11499251_5"},{"key":"89_CR24","doi-asserted-by":"crossref","unstructured":"Reid, G., Tang, J., Zhi, L.: A complete symoblic-numeric linear method for camera pose determination. In: Proceedings of the 2003 International Symposium on Symbolic and Algebraic Computation, pp. 215\u2013223, Philadelphia, Pennsylvania, USA. ACM (2003)","DOI":"10.1145\/860854.860900"},{"key":"89_CR25","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1007\/s002000050114","volume":"9","author":"F. Rouillier","year":"1999","unstructured":"Rouillier F.: Solving zero-dimensional systems through the rational univariate representation. J. Appl. Algebra Eng. Commun. Comput. 9, 433\u2013461 (1999)","journal-title":"J. Appl. Algebra Eng. Commun. Comput."},{"issue":"4","key":"89_CR26","doi-asserted-by":"crossref","first-page":"716","DOI":"10.1006\/jcom.2000.0563","volume":"16","author":"F. Rouillier","year":"2000","unstructured":"Rouillier F., Roy M.-F., Din M.S.E.: Finding at least one point in each connected component of a real algebraic set defined by a single equation. J. Complexity 16(4), 716\u2013750 (2000)","journal-title":"J. Complexity"},{"key":"89_CR27","doi-asserted-by":"crossref","unstructured":"Sasaki, T., Kako, F.: Computing floating-point Gr\u00f6bner bases stably. In: SNC \u201907: Proceedings of the 2007 International Workshop on Symbolic-Numeric Computation, pp. 180\u2013189, New York, NY, USA. ACM (2007)","DOI":"10.1145\/1277500.1277526"},{"key":"89_CR28","doi-asserted-by":"crossref","unstructured":"Sasaki, T., Kako, F.: Floating-point Gr\u00f6bner basis computation with ill-conditionedness estimation. In: Proc. of ASCM2007 (LNAI 5081), pp. 278\u2013292. Springer, Berlin (2008)","DOI":"10.1007\/978-3-540-87827-8_23"},{"key":"89_CR29","unstructured":"Sasaki, T., Kako, F.: A practical method for floating-point Gr\u00f6bner basis computation. In: Proc. of Joint Conf. of ASCM2009 and MACIS2009, pp. 167\u2013176 (2009)"},{"key":"89_CR30","doi-asserted-by":"crossref","unstructured":"Sasaki, T., Kako, F.: Term cancellations in computing floating-point Gr\u00f6bner bases. In: Proc. of CASC2010 (LNAI 6244), pp. 220\u2013231. Springer, Berlin (2010)","DOI":"10.1007\/978-3-642-15274-0_20"},{"key":"89_CR31","doi-asserted-by":"crossref","unstructured":"Shirayanagi, K.: Floating point Gr\u00f6bner bases. In: Selected papers presented at the International IMACS Symposium on Symbolic Computation, New Trends and Developments, pp. 509\u2013528, Amsterdam, Netherlands. Elsevier (1996)","DOI":"10.1016\/S0378-4754(96)00027-4"},{"issue":"6","key":"89_CR32","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1006\/jsco.1998.0238","volume":"26","author":"K. Shirayanagi","year":"1998","unstructured":"Shirayanagi K., Sweelder M.: Remarks on automatic algorithm stabilization. J. Symb. Comput. 26(6), 761\u2013765 (1998)","journal-title":"J. Symb. Comput."},{"key":"89_CR33","doi-asserted-by":"crossref","unstructured":"Stetter, H.: Stabilization of polynomial systems solving with Groebner bases. In: International Symposium on Symbolic and Algebraic Computation, pp. 117\u2013124. ACM (1997)","DOI":"10.1145\/258726.258763"},{"key":"89_CR34","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898717976","volume-title":"Numerical Polynomial Algebra","author":"H. Stetter","year":"2004","unstructured":"Stetter H.: Numerical Polynomial Algebra. Society for Industrial and Applied Mathematics, Philadelphia (2004)"},{"key":"89_CR35","doi-asserted-by":"crossref","unstructured":"Traverso, C., Zanoni, A.: Numerical stability and stabilization of Groebner basis computation. In: International Conference on Symbolic and Algebraic Computation, pp. 262\u2013269, New York, NY, USA. ACM (2002)","DOI":"10.1145\/780506.780540"},{"key":"89_CR36","unstructured":"Tr\u00e9buchet, P.: Generalized normal forms for positive dimensional ideals. In: International Conference on Polynomial System Solving (2004)"},{"key":"89_CR37","unstructured":"Weispfenning, V.: Gr\u00f6bner bases for inexact input data. In: Proc. of CASC2003, pp. 403\u2013411, Passau, Germany (2003)"}],"container-title":["Mathematics in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-011-0089-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11786-011-0089-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-011-0089-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,11]],"date-time":"2023-06-11T03:32:08Z","timestamp":1686454328000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11786-011-0089-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6]]},"references-count":37,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,6]]}},"alternative-id":["89"],"URL":"https:\/\/doi.org\/10.1007\/s11786-011-0089-y","relation":{},"ISSN":["1661-8270","1661-8289"],"issn-type":[{"value":"1661-8270","type":"print"},{"value":"1661-8289","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,6]]}}}