Resumen: In this work, we analyze the numerical behavior of the classical Cauchy identity & sum;(lambda )s(lambda)(a(1),... , a(n))s(lambda)(x(1), ... , x(m)) = & prod;(n)(j=1) & prod;(m)(i=1) 1/1-a(j)x(i), by developing perturbation and running error analyses. We show that relative perturbations in the nodes x(i) and coefficients a(j) only induce small relative changes in the output provided some relative gaps are sufficiently large. We also propose an algorithm computing a posteriori relative error bound with low computational overhead. Finally, we derive truncation error bounds for the Schur expansion of the formula. Numerical experiments confirm the sharpness of the theoretical results and illustrate the effectiveness of the proposed bounds in practice. Idioma: Inglés DOI: 10.1007/s10092-026-00683-2 Año: 2026 Publicado en: CALCOLO 63, 1 (2026), [17 pp.] ISSN: 0008-0624 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/MCIU/RED2022-134176-T Tipo y forma: Article (Published version) Área (Departamento): Área Matemática Aplicada (Dpto. Matemática Aplicada)
Exportado de SIDERAL (2026-02-24-14:47:44)