Testing of computations by polynomial checks

A simple analytical unified approach is described for error detection and correction in numerical computations. The computation process may be implemented by a computer program. This approach does not depend on the form of representation or on the specific features of the implementation of a program or a device computing the given function, but it is based on algebraic concepts, such as transcendental degree of field extensions. The described approach results in a substantial reduction of the hardware overhead required for multiple error detection and correction, as compared to the checksum approach and other previously known methods