Due to the limited number of digits or bits per storage location in
electronic computers, round-off errors arise during arithmetic
operations. Depending upon the kind of operation, the structure of
the data, and the skillfulness of the program, these errors
increase and spread out more or less quickly during a continued
computation process in which the computed data affected by errors
are themselves used for generating new data. The purpose of this
investigation was to learn about the increase of round-off errors
in linear programming procedures. Less attention was paid to the
theory of round-off errors or to the effectiveness of error
elimination procedures. In regard to these questions the results of
in vestigations which have been made on round-off errors in a more
general context dealing with matrix inversion and eigenvalue
problems could be used for the purposes of this paper. The emphasis
of this investigation lay rather on studying the behavior of
typical linear programming problems from the pOint of view of error
cumulation."
General
Is the information for this product incomplete, wrong or inappropriate?
Let us know about it.
Does this product have an incorrect or missing image?
Send us a new image.
Is this product missing categories?
Add more categories.
Review This Product
No reviews yet - be the first to create one!