Low redundancy polynomial checks for numerical computation

From MaRDI portal





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.











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)