{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:21:56Z","timestamp":1740097316266,"version":"3.37.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319456409"},{"type":"electronic","value":"9783319456416"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-45641-6_28","type":"book-chapter","created":{"date-parts":[[2016,9,8]],"date-time":"2016-09-08T06:30:29Z","timestamp":1473316229000},"page":"444-456","source":"Crossref","is-referenced-by-count":0,"title":["A Lower Bound for Computing Lagrange\u2019s Real Root Bound"],"prefix":"10.1007","author":[{"given":"Swaroop N.","family":"Prabhakar","sequence":"first","affiliation":[]},{"given":"Vikram","family":"Sharma","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,9,9]]},"reference":[{"key":"28_CR1","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/s00607-006-0186-y","volume":"78","author":"AG Akritas","year":"2006","unstructured":"Akritas, A.G., Strzebo\u0144ski, A., Vigklas, P.: Implementations of a new theorem for computing bounds for positive roots of polynomials. Computing 78, 355\u2013367 (2006)","journal-title":"Computing"},{"key":"28_CR2","unstructured":"Akritas, A.: Vincent\u2019s theorem in algebraic manipulation. Ph.D. thesis, Operations Research Program, North Carolina State University, Raleigh, North Carolina (1978)"},{"key":"28_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1007\/978-3-319-32859-1_50","volume-title":"Mathematical Aspects of Computer and Information Sciences","author":"Prashant Batra","year":"2016","unstructured":"Batra, Prashant: On the quality of some root-bounds. In: Kotsireas, Ilias S., Rump, Siegfried M., Yap, Chee K. (eds.) MACIS 2015. LNCS, vol. 9582, pp. 591\u2013595. Springer, Heidelberg (2016). doi: 10.1007\/978-3-319-32859-1_50"},{"issue":"6","key":"28_CR4","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1016\/j.jsc.2010.01.012","volume":"45","author":"P Batra","year":"2010","unstructured":"Batra, P., Sharma, V.: Bounds on absolute positiveness of multivariate polynomials. J. Symb. Comput. 45(6), 617\u2013628 (2010)","journal-title":"J. Symb. Comput."},{"issue":"C","key":"28_CR5","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1016\/j.jsc.2014.09.038","volume":"70","author":"GE Collins","year":"2015","unstructured":"Collins, G.E.: Krandick\u2019s proof of Lagrange\u2019s real root bound claim. J. Symb. Comput. 70(C), 106\u2013111 (2015). http:\/\/dx.doi.org\/10.1016\/j.jsc.2014.09.038","journal-title":"J. Symb. Comput."},{"issue":"5","key":"28_CR6","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1006\/jsco.1997.0189","volume":"25","author":"H Hong","year":"1998","unstructured":"Hong, H.: Bounds for absolute positiveness of multivariate polynomials. J. Symb. Comput. 25(5), 571\u2013585 (1998)","journal-title":"J. Symb. Comput."},{"key":"28_CR7","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/0377-0427(86)90096-8","volume":"16","author":"J Kioustelidis","year":"1986","unstructured":"Kioustelidis, J.: Bounds for the positive roots of polynomials. J. Comput. Appl. Math. 16, 241\u2013244 (1986)","journal-title":"J. Comput. Appl. Math."},{"key":"28_CR8","volume-title":"Trait\u00e9 de la r\u00e9solution des \u00e9quations num\u00e9riques de tous les degr\u00e9s, \u0152uvres de Lagrange","author":"JL Lagrange","year":"1879","unstructured":"Lagrange, J.L.: Trait\u00e9 de la r\u00e9solution des \u00e9quations num\u00e9riques de tous les degr\u00e9s, \u0152uvres de Lagrange, vol. 8, 4th edn. Gauthier-Villars, Paris (1879)","edition":"4"},{"issue":"6","key":"28_CR9","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1016\/j.jsc.2010.02.002","volume":"45","author":"K Mehlhorn","year":"2010","unstructured":"Mehlhorn, K., Ray, S.: Faster algorithms for computing Hong\u2019s bound on absolute positiveness. J. Symbol. Comput. 45(6), 677\u2013683 (2010). http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0747717110000301","journal-title":"J. Symbol. Comput."},{"key":"28_CR10","unstructured":"Mignotte, M., \u015etef\u0103nescu, D.: On an Estimation of Polynomial Roots by Lagrange. Prepublication de l\u2019Institut de Recherche Math\u00e9matique Avanc\u00e9e, IRMA, Univ. de Louis Pasteur et C.N.R.S. (2002). https:\/\/books.google.co.in\/books?id=NAd4NAEACAAJ"},{"key":"28_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry: An Introduction","author":"FP Preparata","year":"1985","unstructured":"Preparata, F.P., Shamos, M.I.: Computational Geometry: An Introduction. Springer, New York (1985)"},{"issue":"2","key":"28_CR12","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1016\/j.tcs.2008.09.017","volume":"409","author":"V Sharma","year":"2008","unstructured":"Sharma, V.: Complexity of real root isolation using continued fractions. Theor. Comput. Sci. 409(2), 292\u2013310 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"28_CR13","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1007\/BF02168974","volume":"15","author":"A Sluis van der","year":"1970","unstructured":"van der Sluis, A.: Upper bounds for roots of polynomials. Numer. Math. 15, 250\u2013262 (1970)","journal-title":"Numer. Math."},{"issue":"12","key":"28_CR14","first-page":"2132","volume":"11","author":"D \u015etef\u0103nescu","year":"2005","unstructured":"\u015etef\u0103nescu, D.: New bounds for the positive roots of polynomials. J. Univ. Comput. Sci. 11(12), 2132\u20132141 (2005)","journal-title":"J. Univ. Comput. Sci."},{"key":"28_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1007\/978-3-319-24021-3_33","volume-title":"Computer Algebra in Scientific Computing - 17th International Workshop, CASC 2015","author":"D \u015etef\u0103nescu","year":"2015","unstructured":"\u015etef\u0103nescu, D.: A new polynomial bound and its efficiency. In: Gerdt, V.P., Koepf, W., Seiler, W.M., Vorozhtsov, E.V. (eds.) CASC 2015. LNCS, vol. 9301, pp. 457\u2013467. Springer, Switzerland (2015). http:\/\/dx.doi.org\/10.1007\/978-3-319-24021-3_33"},{"key":"28_CR16","volume-title":"Fundamental Problems of Algorithmic Algebra","author":"CK Yap","year":"2000","unstructured":"Yap, C.K.: Fundamental Problems of Algorithmic Algebra. Oxford University Press, Oxford (2000)"}],"container-title":["Lecture Notes in Computer Science","Computer Algebra in Scientific Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-45641-6_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T18:13:43Z","timestamp":1498328023000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-45641-6_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319456409","9783319456416"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-45641-6_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}