{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T02:01:45Z","timestamp":1760061705293},"publisher-location":"Vienna","reference-count":22,"publisher":"Springer Vienna","isbn-type":[{"type":"print","value":"9783211835937"},{"type":"electronic","value":"9783709162804"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/978-3-7091-6280-4_9","type":"book-chapter","created":{"date-parts":[[2011,7,18]],"date-time":"2011-07-18T18:55:26Z","timestamp":1311015326000},"page":"87-97","source":"Crossref","is-referenced-by-count":20,"title":["Solution of Systems of Polynomial Equations by Using Bernstein Expansion"],"prefix":"10.1007","author":[{"given":"J\u00fcrgen","family":"Garloff","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew P.","family":"Smith","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"79","DOI":"10.6028\/jres.070B.005","volume":"70B","author":"GT Cargo","year":"1966","unstructured":"Cargo, G.T., Shisha, O. (1966): The Bernstein form of a polynomial. J. Res. Nat. Bur. Standards Sect. B, vol. 70B (Math. Sci.), 1: 79\u201381","journal-title":"J. Res. Nat. Bur. Standards Sect. B"},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0167-8396(88)90016-7","volume":"5","author":"RT Farouki","year":"1988","unstructured":"Farouki, R.T., Rajan, V.T. (1988): Algorithms for polynomials in Bernstein form. Computer Aided Geometrie Design 5: 1\u201326","journal-title":"Computer Aided Geometrie Design"},{"key":"9_CR3","first-page":"197","volume-title":"Contributions to computer arithmetic and self-validating numerical methods","author":"HC Fischer","year":"1990","unstructured":"Fischer, H.C. (1990): Range computations and applications. In: Ullrich, C. (ed.): Contributions to computer arithmetic and self-validating numerical methods. J.C.Baltzer, Amsterdam, pp. 197\u2013211"},{"key":"9_CR4","series-title":"Lecture notes in computer science","first-page":"37","volume-title":"Interval mathematics","author":"J Garloff","year":"1985","unstructured":"Garloff, J. (1986): Convergent bounds for the range of multivariate polynomials. In: Nickel, K. (ed.): Interval mathematics 1985. Springer, Berlin Heidelberg New York, pp. 37\u201356 (Lecture notes in computer science, vol. 212)"},{"key":"9_CR5","first-page":"154","volume":"2","author":"J Garloff","year":"1993","unstructured":"Garloff, J. (1993): The Bernstein algorithm. Interval Comp. 2: 154\u2013168","journal-title":"Interval Comp"},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1023\/A:1009934614393","volume":"6","author":"J Garloff","year":"2000","unstructured":"Garloff, J. (2000): Applications of Bernstein expansion to the solution of control problems. Reliable Comp. 6: 303\u2013320","journal-title":"Reliable Comp"},{"key":"9_CR7","first-page":"329","volume-title":"The use of symbolic methods in control system analysis and design","author":"J Garloff","year":"1999","unstructured":"Garloff, J., Graf, B. (1999): Solving strict polynomial inequalities by Bernstein expansion. In: Munro, N. (ed.): The use of symbolic methods in control system analysis and design. IEE, London, pp. 329\u2013352"},{"key":"9_CR8","unstructured":"Garloff, J., Smith, A.P. (2001): Improvements of a subdivision-based algorithm for solving systems of polynomial equations, to appear in the Proceedings of the 3rd World Congress of Nonlinear Analysts, July 19\u201326 2000, Catania, Italy, special series of the Journal of Nonlinear Analysis, Elsevier Sci. Publ."},{"key":"9_CR9","series-title":"Lecture notes in artificial intelligence","volume-title":"Towards unnperative interval narrowing","author":"L Granvilliers","year":"2000","unstructured":"Granvilliers, L. (2000): Towards unnperative interval narrowing. In: Proceedings 3rd Intern. Workshop on Frontiers of Combining Systems, FroCoS\u20192000, Nancy, France, Springer, Berlin Heidelberg New York (Lecture notes in artificial intelligence, vol. 1794)"},{"key":"9_CR10","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1016\/0010-4485(95)00063-1","volume":"28","author":"C-Y Hu","year":"1996","unstructured":"Hu, Chun-Yi, Maekawa, T., Sherbrooke, E.C., Patrikalakis, N.M. (1996): Robust interval algorithm for curve intersections. Computer-Aided Design 28:495\u2013506","journal-title":"Computer-Aided Design"},{"key":"9_CR11","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF02390521","volume":"1","author":"C J\u00fcger","year":"1995","unstructured":"J\u00fcger, C., Ratz, D. (1995): A combined method for enclosing all solutions ofnonlinear systems of polynomial equations, Reliable Comp. 1: 41\u201364","journal-title":"Reliable Comp"},{"key":"9_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2495-0","volume-title":"Rigorous global search: continuous problems","author":"RB Kearfott","year":"1996","unstructured":"Kearfott, R.B. (1996): Rigorous global search: continuous problems, Kluwer Acad. Publ., Dordrecht Boston London"},{"key":"9_CR13","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/BF02252029","volume":"19","author":"JB Kioustelidis","year":"1978","unstructured":"Kioustelidis, J.B. (1978): Algorithmic error estimation for approximate solutions of nonlinear systems of equations. Computing 19: 313\u2013320","journal-title":"Computing"},{"issue":"3","key":"9_CR14","first-page":"5","volume":"2","author":"C Miranda","year":"1941","unstructured":"Miranda, C. (1941): Un\u2019 osservazione su un teorema di Brouwer. Boll. Un. Mat. Ital. Ser.2, 3: 5\u20137","journal-title":"Boll. Un. Mat. Ital. Ser"},{"key":"9_CR15","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1137\/0717044","volume":"17","author":"RE Moore","year":"1980","unstructured":"Moore, R.E., Kioustelidis, J.B. (1980): A simple test for accuracy of approximate solutions to nonlinear (or linear) systems. SIAM J. Numer. Anal. 17:521\u2013529","journal-title":"SIAM J. Numer. Anal"},{"key":"9_CR16","volume-title":"Solving polynomial systems using continuation for engineering and scientific problems","author":"AP Morgan","year":"1987","unstructured":"Morgan, A.P.(1987): Solving polynomial systems using continuation for engineering and scientific problems. Prentice Hall, Englewood-Cliffs, N.J."},{"key":"9_CR17","volume-title":"Interval methods for systems of equations","author":"A Neumaier","year":"1990","unstructured":"Neumaier, A. (1990): Interval methods for systems of equations. Cambridge University Press, Cambridge (Encyclopedia of mathematics and its applications)"},{"key":"9_CR18","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1016\/0167-8396(93)90019-Y","volume":"10","author":"EC Sherbrooke","year":"1993","unstructured":"Sherbrooke, E.C., Patrikalakis, N.M. (1993): Computation of the solutions ofnonlinear polynomial systems. Computer Aided Geometric Design 10: 379\u2013405","journal-title":"Computer Aided Geometric Design"},{"key":"9_CR19","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1137\/S0036142995281504","volume":"34","author":"P Hentenryck Van","year":"1997","unstructured":"Van Hentenryck, P., McAllester, D., Kapur, D. (1997): Solving polynomial systems using a branch and prune approach. SIAM J. Numer. Anal. 34:797\u2013827","journal-title":"SIAM J. Numer. Anal."},{"key":"9_CR20","first-page":"701","volume":"107","author":"MN Vrahatis","year":"1989","unstructured":"Vrahatis, M.N. (1989): A short proof and a generalization of Miranda\u2019s existence theorem. Proc. Amer. Math. Soc. 107: 701\u2013703","journal-title":"Proc. Amer. Math. Soc."},{"key":"9_CR21","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1109\/9.661615","volume":"43","author":"M Zettler","year":"1998","unstructured":"Zettler, M., Garloff, J. (1998): Robustness analysis of polynomials with polynomial parameter dependency using Bernstein expansion. IEEE Trans. Automat. Contr. 43:425\u2013431","journal-title":"IEEE Trans. Automat. Contr."},{"key":"9_CR22","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/BF02242192","volume":"40","author":"S Zuhe","year":"1988","unstructured":"Zuhe, S., Neumaier, A. (1988.): A note on Moore\u2019s interval test for zeros of nonlinear systems. Computing 40: 85\u201390","journal-title":"Computing"}],"container-title":["Symbolic Algebraic Methods and Verification Methods"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-7091-6280-4_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T09:32:44Z","timestamp":1606123964000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-7091-6280-4_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783211835937","9783709162804"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-7091-6280-4_9","relation":{},"subject":[],"published":{"date-parts":[[2001]]}}}