{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:42:00Z","timestamp":1740123720985,"version":"3.37.3"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,8,29]],"date-time":"2020-08-29T00:00:00Z","timestamp":1598659200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,8,29]],"date-time":"2020-08-29T00:00:00Z","timestamp":1598659200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2021,7]]},"DOI":"10.1007\/s11075-020-00996-5","type":"journal-article","created":{"date-parts":[[2020,8,29]],"date-time":"2020-08-29T00:02:55Z","timestamp":1598659375000},"page":"1001-1015","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Fast and accurate evaluation of dual Bernstein polynomials"],"prefix":"10.1007","volume":"87","author":[{"given":"Filip","family":"Chudy","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9897-8805","authenticated-orcid":false,"given":"Pawe\u0142","family":"Wo\u017any","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,8,29]]},"reference":[{"key":"996_CR1","volume-title":"Special Functions Encyclopedia of Mathematics and its Applications, vol. 71","author":"GE Andrews","year":"1999","unstructured":"Andrews, G. E., Askey, R., Roy, R.: Special Functions Encyclopedia of Mathematics and its Applications, vol. 71. Cambridge University Press, Cambridge (1999)"},{"key":"996_CR2","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/j.cagd.2007.01.003","volume":"24","author":"M Barto\u0148","year":"2007","unstructured":"Barto\u0148, M., J\u00fcttler, B.: Computing roots of polynomials by quadratic clipping. Computer Aided Geometric Design 24, 125\u2013141 (2007)","journal-title":"Computer Aided Geometric Design"},{"key":"996_CR3","first-page":"235","volume":"220","author":"L Bezerra","year":"2013","unstructured":"Bezerra, L.: Efficient computation of B\u00e9zier curves from their Bernstein-Fourier representation. Appl. Math. Comput. 220, 235\u2013238 (2013)","journal-title":"Appl. Math. Comput."},{"key":"996_CR4","doi-asserted-by":"crossref","unstructured":"Bustamante, J.: Bernstein operators and their properties. Birkh\u00e4user (2017)","DOI":"10.1007\/978-3-319-55402-0"},{"key":"996_CR5","first-page":"537","volume":"338","author":"F Chudy","year":"2018","unstructured":"Chudy, F., Wo\u017any, P.: Differential-recurrence properties of dual Bernstein polynomials. Appl. Math. Comput. 338, 537\u2013543 (2018)","journal-title":"Appl. Math. Comput."},{"key":"996_CR6","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/BF01056830","volume":"38","author":"Z Ciesielski","year":"1987","unstructured":"Ciesielski, Z.: The basis of B-splines in the space of algebraic polynomials. Ukr. Math. J. 38, 311\u2013315 (1987)","journal-title":"Ukr. Math. J."},{"key":"996_CR7","doi-asserted-by":"crossref","unstructured":"Dahlquist, G., Bj\u00f6rck, \u00c5: Numerical methods in scientific computing, vol. I. SIAM (2008)","DOI":"10.1137\/1.9780898717785"},{"key":"996_CR8","volume-title":"Curves and Surfaces for Computer-Aided Geometric Design. A Practical Guide","author":"G Farin","year":"2002","unstructured":"Farin, G.: Curves and Surfaces for Computer-Aided Geometric Design. A Practical Guide, 5th edn. Academic Press, Boston (2002)","edition":"5th edn."},{"key":"996_CR9","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1016\/j.cagd.2012.03.001","volume":"29","author":"RT Farouki","year":"2012","unstructured":"Farouki, R. T.: The Bernstein polynomial basis: a centennial retrospective. Computer Aided Geometric Design 29, 379\u2013419 (2012)","journal-title":"Computer Aided Geometric Design"},{"key":"996_CR10","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/s11075-015-9988-3","volume":"71","author":"P Gospodarczyk","year":"2016","unstructured":"Gospodarczyk, P., Lewanowicz, S., Wo\u017any, P.: Gk, l-constrained multi-degree reduction of B\u00e9zier curves. Numerical Algorithms 71, 121\u2013137 (2016)","journal-title":"Numerical Algorithms"},{"key":"996_CR11","first-page":"40","volume":"293","author":"P Gospodarczyk","year":"2017","unstructured":"Gospodarczyk, P., Lewanowicz, S., Wo\u017any, P.: Degree reduction of composite B\u00e9zier curves. Appl. Math. Comput. 293, 40\u201348 (2017)","journal-title":"Appl. Math. Comput."},{"key":"996_CR12","unstructured":"Gospodarczyk, P., Wo\u017any, P.: An iterative approximate method of solving boundary value problems using dual Bernstein polynomials. Tech. Rep. 2018-03-01, University of Wroc\u0142aw Institute of Computer Science, arXiv:1709.02162 (2018)"},{"key":"996_CR13","doi-asserted-by":"publisher","first-page":"7663","DOI":"10.1002\/mma.4551","volume":"40","author":"M Jani","year":"2017","unstructured":"Jani, M., Babolian, E., Javadi, S.: Bernstein modal basis: application to the spectral Petrov-Galerkin method for fractional partial differential equations. Mathematical Methods in the Applied Sciences 40, 7663\u20137672 (2017)","journal-title":"Mathematical Methods in the Applied Sciences"},{"key":"996_CR14","doi-asserted-by":"publisher","first-page":"2335","DOI":"10.1007\/s40314-017-0455-8","volume":"37","author":"M Jani","year":"2018","unstructured":"Jani, M., Javadi, S., Babolian, E., Bhatta, D.: Bernstein dual-Petrov-Galerkin method: application to 2D time fractional diffusion equation. Comput. Appl. Math. 37, 2335\u20132353 (2018)","journal-title":"Comput. Appl. Math."},{"key":"996_CR15","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1023\/A:1018912801267","volume":"8","author":"B J\u00fcttler","year":"1998","unstructured":"J\u00fcttler, B.: The dual basis functions of the Bernstein polynomials. Adv. Comput. Math. 8, 345\u2013352 (1998)","journal-title":"Adv. Comput. Math."},{"key":"996_CR16","unstructured":"Koekoek, R., Swarttouw, R. F.: The Askey-scheme of hypergeometric orthogonal polynomials and its q-analogue. Tech. Rep. 98-17, Delft University of Technology, Faculty of Information Technology and Systems Department of Technical Mathematics and Informatics (1998)"},{"key":"996_CR17","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/j.jat.2005.10.005","volume":"138","author":"S Lewanowicz","year":"2006","unstructured":"Lewanowicz, S., Wo\u017any, P.: Dual generalized Bernstein basis. Journal of Approximation Theory 138, 129\u2013150 (2006)","journal-title":"Journal of Approximation Theory"},{"key":"996_CR18","first-page":"4580","volume":"218","author":"S Lewanowicz","year":"2011","unstructured":"Lewanowicz, S., Wo\u017any, P.: B\u00e9zier representation of the constrained dual Bernstein polynomials. Appl. Math. Comput. 218, 4580\u20134586 (2011)","journal-title":"Appl. Math. Comput."},{"key":"996_CR19","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1007\/s11075-011-9507-0","volume":"59","author":"S Lewanowicz","year":"2012","unstructured":"Lewanowicz, S., Wo\u017any, P., Keller, P.: Polynomial approximation of rational B\u00e9zier curves with constraints. Numerical Algorithms 59, 607\u2013622 (2012)","journal-title":"Numerical Algorithms"},{"key":"996_CR20","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1016\/j.cagd.2009.02.003","volume":"26","author":"L Liu","year":"2009","unstructured":"Liu, L., Zhang, L., Lin, B., Wang, G.: Fast approach for computing roots of polynomials using cubic clipping. Computer Aided Geometric Design 26, 547\u2013559 (2009)","journal-title":"Computer Aided Geometric Design"},{"key":"996_CR21","first-page":"1581","volume":"186","author":"A Rababah","year":"2007","unstructured":"Rababah, A., Al-Natour, M.: The weighted dual functionals for the univariate Bernstein basis. Appl. Math. Comput. 186, 1581\u20131590 (2007)","journal-title":"Appl. Math. Comput."},{"key":"996_CR22","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1016\/0010-4485(90)90039-F","volume":"22","author":"TW Sederberg","year":"1990","unstructured":"Sederberg, T. W., Nishita, T.: Curve intersection using B\u00e9zier clipping. Computer Aided Geometric Design 22, 538\u2013549 (1990)","journal-title":"Computer Aided Geometric Design"},{"key":"996_CR23","volume-title":"Computation with Recurrence Relations","author":"J Wimp","year":"1984","unstructured":"Wimp, J.: Computation with Recurrence Relations. Pitman Publishing, London (1984)"},{"key":"996_CR24","first-page":"354","volume":"268","author":"P Wo\u017any","year":"2015","unstructured":"Wo\u017any, P., Gospodarczyk, P., Lewanowicz, S.: Efficient merging of multiple segments of B\u00e9zier curves. Appl. Math. Comput. 268, 354\u2013363 (2015)","journal-title":"Appl. Math. Comput."},{"key":"996_CR25","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1016\/j.cagd.2009.01.006","volume":"26","author":"P Wo\u017any","year":"2009","unstructured":"Wo\u017any, P., Lewanowicz, S.: Multi-degree reduction of B\u00e9zier curves with constraints, using dual Bernstein basis polynomials. Computer Aided Geometric Design 26, 566\u2013579 (2009)","journal-title":"Computer Aided Geometric Design"}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-020-00996-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11075-020-00996-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-020-00996-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,28]],"date-time":"2021-08-28T23:47:46Z","timestamp":1630194466000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11075-020-00996-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8,29]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,7]]}},"alternative-id":["996"],"URL":"https:\/\/doi.org\/10.1007\/s11075-020-00996-5","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"type":"print","value":"1017-1398"},{"type":"electronic","value":"1572-9265"}],"subject":[],"published":{"date-parts":[[2020,8,29]]},"assertion":[{"value":"24 April 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 August 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 August 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Conflict of interest"}}]}}