✦ LIBER ✦

Representation Error for Real Numbers in Binary Computer Arithmetic

✍ Scribed by McKeeman, W. M.

Book ID: 117903779
Publisher: Institute of Electrical and Electronics Engineers
Year: 1967
Tongue: English
Weight: 391 KB
Volume: EC-16
Category: Article
ISSN: 0367-7508
DOI: 10.1109/pgec.1967.264781

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

High efficiency redundant binary number

High efficiency redundant binary number representations for parallel arithmetic on optical computers

✍ G.A. De Biase; A. Massini 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 658 KB

Redundant binary number representation f

Redundant binary number representation for an inherently parallel arithmetic on optical computers

✍ De Biase, Giuseppe A. ;Massini, Annalisa 📂 Article 📅 1993 🏛 The Optical Society 🌐 English ⚖ 668 KB

Educational issues on number representat

Educational issues on number representation and arithmetic in computers: an undergraduate laboratory

✍ Fernandez, J.-J.; Garcia, I.; Garzon, E.M. 📂 Article 📅 2003 🏛 IEEE 🌐 English ⚖ 501 KB

Modular Arithmetic for Linear Algebra Co

Modular Arithmetic for Linear Algebra Computations in the Real Field

✍ I.Z. Emiris; V.Y. PAN; Y. YU 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 528 KB

The aim of this work is to decrease the bit precision required in computations without affecting the precision of the answer, whether this is computed exactly or within some tolerance. By precision we understand the number of bits in the binary representation of the values involved in the computatio

Numerical computation of the number of z

Numerical computation of the number of zeros of real polynomials in the open unit disk using a Chebyshev polynomials representation

✍ B. Gleyse; A. Larabi 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 195 KB

We present a general and efficient numerical method with low computational complexity for computing the number of zeros of a real polynomial in the unit disk.

Exact computation of the number of zeros

Exact computation of the number of zeros of a real polynomial in the open unit disk by a determinant representation

✍ B. Gleyse; M. Moflih 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 309 KB

We present a new and versatile method for the exact computation of the number of zeros of a real polynomial inside the unit disk. Our technique is based on a determinant representation.