Low redundancy polynomial checks for numerical computation

DOI10.1007/BF01293262zbMATH Open0874.65035MaRDI QIDQ1925011FDOQ1925011

Authors: F. S. Vainstein 

Publication date: 27 October 1996

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

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

zbMATH Keywords

numerical exampleserror detectionrandom errorscorrection of errorspolynomial checksreduction of hardware overhead

Mathematics Subject Classification ID

Roundoff error (65G50)

Cites Work

• Title not available (Why is that?)
• Interval Methods for Systems of Equations
• Self-testing/correcting with applications to numerical problems
• Designing programs that check their work
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (1)

• Title not available (Why is that?)

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)