Results 111 to 120 of about 30,367 (158)

Groupoids and computer arithmetic

1972 IEEE 2nd Symposium on Computer Arithmetic (ARITH), 1972
Overflow detection and overflow recovery imposed no particular requirements on the structure of (X, X 1 < X 1 , f x ). In particular, if f is associative and commutative, overflow recovery is obtainable even if f x is neither associative or commutative.
Harvey L. Garner, Norman Foo, Lo Hsieh
openaire   +1 more source

Computer Arithmetic

2007
exaly   +2 more sources

Mathematical Foundation of Computer Arithmetic

IEEE Transactions on Computers, 1975
During recent years a number of papers concerning a mathematical foundation of computer arithmetic have been written. Some of these papers are still unpublished. The papers consider the spaces which occur in numerical computations on computers depending on a properly defined computer arithmetic. The following treatment gives a summary of the main ideas
openaire   +1 more source

On the Use of Residue Arithmetic for Computation

IEEE Transactions on Computers, 1974
Residue arithmetic offers the possibility of "carryfree" arithmetic as far as the operations of addition, subtraction, and multiplication are concerned. It is faster to implement these operations using residue arithmetic as compared to implementation using binary arithmetic.
openaire   +1 more source

Computer Representation and Arithmetic

1995
In Chapter 2, we looked at how numbers can be represented in the binary number system. In this chapter, we shall use the techniques we developed in Chapter 2 to investigate the ways in which numbers are represented and manipulated in binary form in a computer.
openaire   +1 more source

The Parallel Complexity of Arithmetic Computation

1977
Results on the computational complexity of performing several standard types of arithmetic computations in a parallel processing environment are surveyed. The essential equivalence of matrix inversion and the problem of computing the nth power of a matrix in the parallel setting is demonstrated as evidence suggesting an interesting lower bound on the ...
openaire   +1 more source

Higher Order Computer Arithmetic

1985 IEEE 7th Symposium on Computer Arithmetic (ARITH), 1985
The floating-point arithmetic on computers is designed to approximate the corresponding operations over the real numbers as close as possible. In this paper it is shown by means of counterexamples that this need not to be true for existing machines. For achieving good numerical results a floating-point arithmetic approximating the real operations as ...
openaire   +1 more source

A NEW ARITHMETIC FOR SCIENTIFIC COMPUTATION

1983
The paper summarizes an extensive research activity in computer arithmetic and scientific computation that went on during the last fifteen years. We also discuss the experience gained through various implementations of a new approach to arithmetic on diverse processors including microprocessors.
openaire   +1 more source

Computer Arithmetic

The Mathematics Teacher, 1971
Students new to computer programming often write computer programs that fail to perform as expected. Seeking to correct the resulting deficiencies, the student often looks in vain for an error in logic, when the true cause of the trouble may be a failure to consider the nature of computer arithmetic.
openaire   +1 more source

Computer Arithmetic

2015
Earl E Swartzlander, Carl E Lemonds
  +5 more sources