000160779 001__ 160779 000160779 005__ 20251017144550.0 000160779 0247_ $$2doi$$a10.3390/axioms14040248 000160779 0248_ $$2sideral$$a144016 000160779 037__ $$aART-2025-144016 000160779 041__ $$aeng 000160779 100__ $$aBallarín, Jorge$$uUniversidad de Zaragoza 000160779 245__ $$aHigh Relative Accuracy for Corner Cutting Algorithms 000160779 260__ $$c2025 000160779 5060_ $$aAccess copy available to the general public$$fUnrestricted 000160779 5203_ $$aCorner 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. 000160779 536__ $$9info:eu-repo/grantAgreement/ES/DGA/E41-23R$$9info:eu-repo/grantAgreement/ES/MCIU/PID2022-138569NB-I00$$9info:eu-repo/grantAgreement/ES/MICINN/RED2022-134176-T 000160779 540__ $$9info:eu-repo/semantics/openAccess$$aby$$uhttps://creativecommons.org/licenses/by/4.0/deed.es 000160779 655_4 $$ainfo:eu-repo/semantics/article$$vinfo:eu-repo/semantics/publishedVersion 000160779 700__ $$0(orcid)0000-0003-2156-9856$$aDelgado, Jorge$$uUniversidad de Zaragoza 000160779 700__ $$0(orcid)0000-0002-1340-0666$$aPeña, Juan Manuel$$uUniversidad de Zaragoza 000160779 7102_ $$12005$$2595$$aUniversidad de Zaragoza$$bDpto. Matemática Aplicada$$cÁrea Matemática Aplicada 000160779 773__ $$g14, 4 (2025), 248 [13 pp.]$$pAxioms$$tAxioms$$x2075-1680 000160779 8564_ $$s289990$$uhttps://zaguan.unizar.es/record/160779/files/texto_completo.pdf$$yVersión publicada 000160779 8564_ $$s2324426$$uhttps://zaguan.unizar.es/record/160779/files/texto_completo.jpg?subformat=icon$$xicon$$yVersión publicada 000160779 909CO $$ooai:zaguan.unizar.es:160779$$particulos$$pdriver 000160779 951__ $$a2025-10-17-14:11:36 000160779 980__ $$aARTICLE