Low redundancy polynomial checks for numerical computation (Q1925011)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Low redundancy polynomial checks for numerical computation |
scientific article; zbMATH DE number 938652
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Low redundancy polynomial checks for numerical computation |
scientific article; zbMATH DE number 938652 |
Statements
Low redundancy polynomial checks for numerical computation (English)
0 references
27 October 1996
0 references
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.
0 references
polynomial checks
0 references
correction of errors
0 references
numerical examples
0 references
reduction of hardware overhead
0 references
error detection
0 references
random errors
0 references
0.698914110660553
0 references
0.6924335360527039
0 references
0.6918769478797913
0 references
