Minimization of rounding errors algebraically by use of coding theory

DOI10.1080/00207168508803484MaRDI QIDQ3800987zbMATH OpenOpenAlexFDO

Authors Antonella Tonolli, Luisa Zauli Potenza

Publication date 1985

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207168508803484

zbMATH Keywords

binary treescoding theoryfloating-point sumH-treesHuffman's algorithmlower and upper boundsrounding errors

Mathematics Subject Classification ID

Roundoff error (65G50) Error probability in coding theory (94B70)

Recommendations

• scientific article; zbMATH DE number 3682957
• On Floating-Point Summation
• Error estimation of floating-point summation and dot product
• scientific article; zbMATH DE number 4111908
• scientific article; zbMATH DE number 1223718

Cited in

(1)

• scientific article; zbMATH DE number 4133978 (Why is no real title available?)

This page was built for publication: Minimization of rounding errors algebraically by use of coding theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3800987)