Low redundancy polynomial checks for numerical computation

DOI10.1007/BF01293262zbMath0874.65035MaRDI QIDQ1925011

F. S. Vainstein

Publication date: 27 October 1996

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

zbMATH Keywords

numerical exampleserror detectionrandom errorscorrection of errorspolynomial checksreduction of hardware overhead

Mathematics Subject Classification ID

Roundoff error (65G50)

Cites Work

• Self-testing/correcting with applications to numerical problems
• Interval Methods for Systems of Equations
• Designing programs that check their work
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Low redundancy polynomial checks for numerical computation