Low redundancy polynomial checks for numerical computation
The author describes a new approach to the detection and correction of errors in numerical computations. The approach is independent on the form of representation and the specific features of the device or program used to compute function values. It is based on the transcendental degree of field extensions and is characterised by a substantial reduction of hardware overhead required for multiple error detection and correction as compared to other known methods. This is particularly valid when random errors are concerned. Illustrative examples are presented too.
- Designing programs that check their 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?)
- Interval Methods for Systems of Equations
- Self-testing/correcting with applications to numerical problems
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)