<?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.3390/axioms14040248</dc:identifier><dc:language>eng</dc:language><dc:creator>Ballarín, Jorge</dc:creator><dc:creator>Delgado, Jorge</dc:creator><dc:creator>Peña, Juan Manuel</dc:creator><dc:title>High Relative Accuracy for Corner Cutting Algorithms</dc:title><dc:identifier>ART-2025-144016</dc:identifier><dc:description>Corner cutting algorithms are important in computer-aided geometric design and they are associated to stochastic non-singular totally positive matrices. Non-singular totally positive matrices admit a bidiagonal decomposition. For many important examples, this factorization can be obtained with high relative accuracy. From this factorization, a corner cutting algorithm can be obtained with high relative accuracy. Illustrative examples are included.</dc:description><dc:date>2025</dc:date><dc:source>http://zaguan.unizar.es/record/160779</dc:source><dc:doi>10.3390/axioms14040248</dc:doi><dc:identifier>http://zaguan.unizar.es/record/160779</dc:identifier><dc:identifier>oai:zaguan.unizar.es:160779</dc:identifier><dc:relation>info:eu-repo/grantAgreement/ES/DGA/E41-23R</dc:relation><dc:relation>info:eu-repo/grantAgreement/ES/MCIU/PID2022-138569NB-I00</dc:relation><dc:relation>info:eu-repo/grantAgreement/ES/MICINN/RED2022-134176-T</dc:relation><dc:identifier.citation>Axioms 14, 4 (2025), 248 [13 pp.]</dc:identifier.citation><dc:rights>by</dc:rights><dc:rights>https://creativecommons.org/licenses/by/4.0/deed.es</dc:rights><dc:rights>info:eu-repo/semantics/openAccess</dc:rights></dc:dc>

</collection>