Low redundancy polynomial checks for numerical computation

DOI10.1007/BF01293262MaRDI QIDQ1925011zbMATH OpenFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 177898
• The problem of checking and correction of numerical results for differential equations, and methods for its solution
• Self-testing/correcting with applications to numerical problems
• Algorithmic Fault Tolerance Using the Lanczos Method

Cites work

• scientific article; zbMATH DE number 3649911 (Why is no real title available?)
• scientific article; zbMATH DE number 177898 (Why is no real title available?)
• scientific article; zbMATH DE number 1235916 (Why is no real title available?)
• Designing programs that check their work
• Interval Methods for Systems of Equations
• Self-testing/correcting with applications to numerical problems

Cited in

(1)

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

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

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