High Relative Accuracy for Corner Cutting Algorithms

Ballarín, Jorge (Universidad de Zaragoza) ; Delgado, Jorge (Universidad de Zaragoza) ; Peña, Juan Manuel (Universidad de Zaragoza)
High Relative Accuracy for Corner Cutting Algorithms
Resumen: 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.
Idioma: Inglés
DOI: 10.3390/axioms14040248
Año: 2025
Publicado en: Axioms 14, 4 (2025), 248 [13 pp.]
ISSN: 2075-1680

Financiación: info:eu-repo/grantAgreement/ES/DGA/E41-23R
Financiación: info:eu-repo/grantAgreement/ES/MCIU/PID2022-138569NB-I00
Financiación: info:eu-repo/grantAgreement/ES/MICINN/RED2022-134176-T
Tipo y forma: Article (Published version)
Área (Departamento): Área Matemática Aplicada (Dpto. Matemática Aplicada)

Creative Commons You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.


Exportado de SIDERAL (2025-10-17-14:11:36)


Visitas y descargas

Este artículo se encuentra en las siguientes colecciones:
Articles > Artículos por área > Matemática Aplicada



 Record created 2025-05-22, last modified 2025-10-17


Versión publicada:
 PDF
Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)