{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,15]],"date-time":"2025-08-15T00:45:03Z","timestamp":1755218703150,"version":"3.43.0"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1998,2,1]],"date-time":"1998-02-01T00:00:00Z","timestamp":886291200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1998,2,1]],"date-time":"1998-02-01T00:00:00Z","timestamp":886291200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Reliable Computing"],"published-print":{"date-parts":[[1998,2]]},"DOI":"10.1023\/a:1009942430877","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T19:25:11Z","timestamp":1040585111000},"page":"3-13","source":"Crossref","is-referenced-by-count":7,"title":["Bounds for the Range of a Bivariate Polynomial over a Triangle"],"prefix":"10.1007","volume":"4","author":[{"given":"Ralf","family":"Hungerb\u00fchler","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00fcrgen","family":"Garloff","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"160696_CR1","volume-title":"Equivalent and Equidecomposable Figures","author":"V. G. Boltyanskii","year":"1963","unstructured":"Boltyanskii, V. G.: Equivalent and Equidecomposable Figures, D.C. Heath and Comp., Boston, 1963."},{"key":"160696_CR2","doi-asserted-by":"crossref","first-page":"79","DOI":"10.6028\/jres.070B.005","volume":"70B","author":"G. T. Cargo","year":"1966","unstructured":"Cargo, G. T. and Shisha, O.: The Bernstein Form of a Polynomial, J. Res. Nat. Bur. Standards Section B\n70B (1966), pp. 79-81.","journal-title":"J. Res. Nat. Bur. Standards Section B"},{"key":"160696_CR3","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/0378-4754(82)90046-5","volume":"24","author":"C. Epstein","year":"1982","unstructured":"Epstein, C., Miranker, W. L., and Rivlin, T. J.: Ultra-Arithmetic II: Intervals of Polynomials, Mathematics and Computers in Simulation\n24 (1982), pp. 19-29.","journal-title":"Mathematics and Computers in Simulation"},{"key":"160696_CR4","first-page":"197","volume-title":"Contributions to Computer Arithmetic and Self-Validating Numerical Methods","author":"H. C. Fischer","year":"1990","unstructured":"Fischer, H. C.: Range Computations and Applications, in: Ullrich, C. (ed.), Contributions to Computer Arithmetic and Self-Validating Numerical Methods, J.C. Baltzer, Amsterdam, 1990, pp. 197-211."},{"key":"160696_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/3-540-16437-5_5","volume-title":"Interval Mathematics 1985","author":"J. Garloff","year":"1986","unstructured":"Garloff, J.: Convergent Bounds for the Range of Multivariate Polynomials, in: Nickel, K. (ed.), Interval Mathematics 1985, Lecture Notes in Computer Science\n212, Springer, Berlin, 1986, pp. 37-56."},{"key":"160696_CR6","first-page":"154","volume":"2","author":"J. Garloff","year":"1993","unstructured":"Garloff, J.: The Bernstein Algorithm, Interval Computations 2 (1993), pp. 154-168.","journal-title":"Interval Computations"},{"key":"160696_CR7","doi-asserted-by":"crossref","unstructured":"Garloff, J., Graf, B., and Zettler, M.: Speeding up an Algorithm for Checking Robust Stability of Polynomials, in: B\u00e1ny\u00e1sz, Cs. (ed.), Robust Control Design, Pergamon, 1997, pp. 205-210.","DOI":"10.1016\/S1474-6670(17)42603-6"},{"key":"160696_CR8","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0021-9045(87)90002-5","volume":"50","author":"T. N. T. Goodman","year":"1987","unstructured":"Goodman, T. N. T.: Variation Diminishing Properties of Bernstein Polynomials on Triangles, J. Approximation Theory\n50 (1987), pp. 111-126.","journal-title":"J. Approximation Theory"},{"key":"160696_CR9","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1016\/0167-8396(91)90009-Z","volume":"8","author":"S. Gopolsamy","year":"1991","unstructured":"Gopolsamy, S., Khandekar, D., and Mudur, S. P.: A New Method of Evaluating Compact Geometric Bounds for Use in Subdivision Algorithms, Computer Aided Geometric Design\n8 (1991), pp. 337-356.","journal-title":"Computer Aided Geometric Design"},{"key":"160696_CR10","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/BF02252094","volume":"23","author":"E. Grassmann","year":"1979","unstructured":"Grassmann, E. and Rokne, J.: The Range of Values of a Circular Complex Polynomial over a Circular Complex Interval, Computing\n23 (1979), pp. 139-169.","journal-title":"Computing"},{"key":"160696_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-94702-5","volume-title":"Vorlesungen \u00fcber Inhalt, Oberfl\u00e4che und Isoperimetrie","author":"H. Hadwiger","year":"1957","unstructured":"Hadwiger, H.: Vorlesungen \u00fcber Inhalt, Oberfl\u00e4che und Isoperimetrie, Springer, Berlin, 1957."},{"key":"160696_CR12","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/BF02238236","volume":"55","author":"H. Hong","year":"1995","unstructured":"Hong, H. and Stahl, V.: Bernstein Form Is Inclusion Monotone, Computing\n55 (1995), pp. 43-53.","journal-title":"Computing"},{"key":"160696_CR13","doi-asserted-by":"crossref","first-page":"807","DOI":"10.1016\/0010-4485(96)00013-9","volume":"28","author":"C. Hu","year":"1996","unstructured":"Hu, Chun-Yi, Patrikalakis, N. M., and Ye, Xiuzi: Robust Interval Solid Modelling, Part I: Representations, Computer-Aided Design\n28 (1996), pp. 807-817.","journal-title":"Computer-Aided Design"},{"key":"160696_CR14","unstructured":"Hungerb\u00fchler, R.: Diploma Thesis, Fakult\u00e4t f\u00fcr Mathematik und Informatik, Universit\u00e4t Konstanz, 1997 (in German)."},{"key":"160696_CR15","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1109\/TPAMI.1980.4766968","volume":"2","author":"J. M. Lane","year":"1980","unstructured":"Lane, J. M. and Riesenfeld, R. F.: A Theoretical Development for the Computer Generation and Display of Piecewise Polynomial Surfaces, IEEE Trans. Pattern Anal. Machine Intelligence\n2 (1980), pp. 35-46.","journal-title":"IEEE Trans. Pattern Anal. Machine Intelligence"},{"key":"160696_CR16","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1007\/BF01934076","volume":"21","author":"J. M. Lane","year":"1981","unstructured":"Lane, J. M. and Riesenfeld, R. F.: Bounds on a Polynomial, BIT\n21 (1981), pp. 112-117.","journal-title":"BIT"},{"key":"160696_CR17","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/BF01995115","volume":"32","author":"Q. Lin","year":"1992","unstructured":"Lin, Qun and Rokne, J. G.: A Family of Centered Forms for a Polynomial, BIT\n32 (1992), pp. 167-176.","journal-title":"BIT"},{"key":"160696_CR18","volume-title":"Bernstein Polynomials","author":"G. G. Lorentz","year":"1953","unstructured":"Lorentz, G. G.: Bernstein Polynomials, Univ. Toronto Press, Toronto, 1953."},{"key":"160696_CR19","doi-asserted-by":"crossref","unstructured":"Malan, S., Milanese, M., Taragna, M., and Garloff, J.: B\n3 Algorithm for Robust Performances Analysis in Presence of Mixed Parametric and Dynamic Perturbations, in: Proc. 31st Conf. Decision and Control, Tucson, Arizona, 1992, pp. 128-133.","DOI":"10.1109\/CDC.1992.371776"},{"key":"160696_CR20","first-page":"8","volume-title":"Combinatorial Identities","author":"R. Rjordan","year":"1968","unstructured":"Rjordan, R.: Combinatorial Identities, Wiley and Sons, New York, 1968, p. 8 and p. 12."},{"key":"160696_CR21","doi-asserted-by":"crossref","first-page":"47","DOI":"10.6028\/jres.074B.006","volume":"74B","author":"T. J. Rivlin","year":"1970","unstructured":"Rivlin, T. J.: Bounds on a Polynomial, J. Res. Nat. Bur. Standards Section B\n74B (1970), pp. 47-54.","journal-title":"J. Res. Nat. Bur. Standards Section B"},{"key":"160696_CR22","series-title":"Tech. Rep.","volume-title":"Computational Experiences with the Bernstein Algorithm","author":"C. Roguet","year":"1994","unstructured":"Roguet, C. and Garloff, J.: Computational Experiences with the Bernstein Algorithm, Tech. Rep. No. 9403, Fachhochschule Konstanz, Fachbereich Informatik, 1994."},{"key":"160696_CR23","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/BF02253209","volume":"18","author":"J. Rokne","year":"1977","unstructured":"Rokne, J.: Bounds for an Interval Polynomial, Computing\n18 (1977), pp. 225-240.","journal-title":"Computing"},{"key":"160696_CR24","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/BF02253136","volume":"21","author":"J. Rokne","year":"1979","unstructured":"Rokne, J.: A Note on the Bernstein Algorithm for Bounds for Interval Polynomials, Computing\n21 (1979), pp. 159-170.","journal-title":"Computing"},{"key":"160696_CR25","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/BF02253127","volume":"22","author":"J. Rokne","year":"1979","unstructured":"Rokne, J.: The Range of Values of a Complex Polynomial over a Complex Interval, Computing\n22 (1979), pp. 153-169.","journal-title":"Computing"},{"key":"160696_CR26","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/BF02241751","volume":"28","author":"J. Rokne","year":"1982","unstructured":"Rokne, J.: Optimal Computation of the Bernstein Algorithm for the Bound of an Interval Polynomial, Computing\n28 (1982), pp. 239-246.","journal-title":"Computing"},{"key":"160696_CR27","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1109\/38.156018","volume":"12","author":"T. W. Sederberg","year":"1992","unstructured":"Sederberg, T. W. and Farouki, R. T.: Approximation by Interval Bezier Curves, IEEE Trans. Comp. Graphics & Applications\n12 (1992), pp. 87-95.","journal-title":"IEEE Trans. Comp. Graphics & Applications"},{"key":"160696_CR28","volume-title":"Subdivision and Degree Elevation for Bernstein Polynomials","author":"M. Zettler","year":"1991","unstructured":"Zettler, M.: Subdivision and Degree Elevation for Bernstein Polynomials, diploma thesis, Fachhochschule Konstanz, Fachbereich Informatik, 1991 (in German)."},{"key":"160696_CR29","doi-asserted-by":"crossref","unstructured":"Zettler, M. and Garloff, J.: Robustness Analysis of Polynomials with Polynomial Parameter Dependency Using Bernstein Expansion, in: IEEE Trans. Automatic Control (1997), to appear.","DOI":"10.1109\/9.661615"}],"container-title":["Reliable Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009942430877.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1009942430877\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009942430877.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,6]],"date-time":"2025-08-06T09:40:30Z","timestamp":1754473230000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1009942430877"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,2]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1998,2]]}},"alternative-id":["160696"],"URL":"https:\/\/doi.org\/10.1023\/a:1009942430877","relation":{},"ISSN":["1385-3139","1573-1340"],"issn-type":[{"type":"print","value":"1385-3139"},{"type":"electronic","value":"1573-1340"}],"subject":[],"published":{"date-parts":[[1998,2]]}}}