Search for Topics All Reviews
	Browse All Reviews > Mathematics Of Computing (G) > Numerical Analysis (G.1) > General (G.1.0) > Computer Arithmetic (G.1.0...)     Options: All Media Types Journals Proceedings Div Books Whole Books Other Date Reviewed Title Author Publisher Published Date Descending Ascending     1-10 of 41 Reviews about "Computer Arithmetic (G.1.0...)": Date Reviewed   Numbers and computers (2nd ed.) Kneusel R., Springer Publishing Company, Incorporated, New York, NY, 2017. 346 pp.  Type: Book (978-3-319505-07-7) Numbers, wonderful mathematical idealizations that they are, have fascinated humans for as long as there have been humans. Computers, much more recent creations, are fascinating in their own way. For many, both are useful but intractab... May 24 2018    On Ziv’s rounding test de Dinechin F., Lauter C., Muller J., Torres S. ACM Transactions on Mathematical Software 39(4): 1-19, 2013.  Type: Article When working in classical finite precision arithmetic, one is often faced with the following problem: the result of a computation cannot be represented exactly. In such cases, one usually has the goal of constructing the computation al... Sep 11 2013   Balancing syntactically multilinear arithmetic circuits Raz R., Yehudayoff A. Computational Complexity 17(4): 515-535, 2008.  Type: Article Most computer designs only support arithmetic operations in hardware (and, thus, are fast). Among these operations, addition and multiplication are much faster than division. As a result, most programs compute, in effect, the value of ... May 15 2009   Arithmetic and logic in computer systems Lu M., John Wiley & Sons, Inc., New York, NY, 2004. 246 pp.  Type: Book (9780471469452), Reviews: (2 of 2) Recently, an engineer asked me about Wallace trees and complexity. I should have cited page 122 of this book, instead of elaborating from scratch, or looking in thick and diluted texts. This is a concise reference on computer arithmeti... Jun 7 2005   Minimal Weight Digit Set Conversions Phillips B., Burgess N. IEEE Transactions on Computers 53(6): 666-677, 2004.  Type: Article Different number representations inside computers have a direct impact on digital arithmetic. By converting a number from one representation to another, one may increase the number of digits recorded as zero, and hence minimize the wei... Dec 26 2004   A less recursive variant of Karatsuba-Ofman algorithm for multiplying operands of size a power of two Erdem S., Koç Ç.  Proceedings of the 16th IEEE Symposium on Computer Arithmetic (ARITH-16’03) (Proceedings of the 16th IEEE Symposium on Computer Arithmetic (ARITH-16’03),Jun 15-18, 2003) 282003.  Type: Proceedings In 1962, A. Karatsuba realized that multiplication of integers presented in radix representation can be performed much faster asymptotically than by the classical method. The classical multiplication method is sequential; one multiplie... May 19 2004   Arithmetic and logic in computer systems Lu M., John Wiley & Sons, Inc., New York, NY, 2004. 246 pp.  Type: Book (9780471469452), Reviews: (1 of 2) Arithmetic and logic are fundamental to both computer science and computer engineering, but each discipline has a favored approach. Computer science stresses algorithms, and computer engineering emphasizes the implementation of algorit... May 12 2004   On computing the semi-sum of two integers Ruggieri S. Information Processing Letters 87(2): 67-71, 2003.  Type: Article A naive implementation of an algorithm for computing the floor function of the arithmetic means of two integers may run into two difficulties: in extreme cases, adding the numbers may cause an overflow; and most standard implementation... Mar 22 2004   High-Speed Double-Precision Computation of Reciprocal, Division, Square Root and Inverse Square Root Piñeiro J., Bruguera J. IEEE Transactions on Computers 51(12): 1377-1388, 2002.  Type: Article Pi¿eiro and Bruguera present an innovative method for efficiently computing some frequently occurring mathematical operations: division, reciprocal, square root, and inverse square root functions. Their method consists of two broad ste... Oct 28 2003   The mean value form of complex analytic functions Neher M. Computing 67(3): 255-268, 2001.  Type: Article The author investigates the mean value form for the computation of the range bound for complex analytic functions. Two cases are considered: rectangular complex intervals, and circular complex intervals. Convergence of the mean value ... Jan 3 2003       Display 510152550100 per page
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy