<?xml version="1.0" encoding="UTF-8"?>
<collection>
<dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd"><dc:identifier>doi:10.1016/j.cagd.2023.102243</dc:identifier><dc:language>eng</dc:language><dc:creator>Delgado, J.</dc:creator><dc:creator>Mainar, E.</dc:creator><dc:creator>Peña, J.M.</dc:creator><dc:title>On the accuracy of de Casteljau-type algorithms and Bernstein representations</dc:title><dc:identifier>ART-2023-136645</dc:identifier><dc:description>This paper summarizes interesting results on systematic backward and forward error analyses performed for corner cutting algorithms providing evaluation of univariate and multivariate functions defined in terms of Bernstein and Bernstein related bases. Relevant results on the conditioning of the bases are also recalled. Finally, the paper surveys important advances, lately obtained, for the design of algorithms adapted to the structure of totally positive matrices, allowing the resolution of interpolation and approximation problems with Bernstein-type bases achieving computations to high relative accuracy.</dc:description><dc:date>2023</dc:date><dc:source>http://zaguan.unizar.es/record/131033</dc:source><dc:doi>10.1016/j.cagd.2023.102243</dc:doi><dc:identifier>http://zaguan.unizar.es/record/131033</dc:identifier><dc:identifier>oai:zaguan.unizar.es:131033</dc:identifier><dc:identifier.citation>Computer Aided Geometric Design 106 (2023), 102243 [14 pp.]</dc:identifier.citation><dc:rights>by-nc-nd</dc:rights><dc:rights>http://creativecommons.org/licenses/by-nc-nd/3.0/es/</dc:rights><dc:rights>info:eu-repo/semantics/openAccess</dc:rights></dc:dc>

</collection>