0
Your cart

Your cart is empty

Books > Computing & IT > General theory of computing > Data structures

Buy Now

Methods and Applications of Error-Free Computation (Paperback, Softcover reprint of the original 1st ed. 1984) Loot Price: R1,445
Discovery Miles 14 450
Methods and Applications of Error-Free Computation (Paperback, Softcover reprint of the original 1st ed. 1984): R.T. Gregory,...

Methods and Applications of Error-Free Computation (Paperback, Softcover reprint of the original 1st ed. 1984)

R.T. Gregory, E.V. Krishnamurthy

Series: Monographs in Computer Science

 (sign in to rate)
Loot Price R1,445 Discovery Miles 14 450 | Repayment Terms: R135 pm x 12*

Bookmark and Share

Expected to ship within 10 - 15 working days

Donate to Against Period Poverty

This book is written as an introduction to the theory of error-free computation. In addition, we include several chapters that illustrate how error-free com putation can be applied in practice. The book is intended for seniors and first year graduate students in fields of study involving scientific computation using digital computers, and for researchers (in those same fields) who wish to obtain an introduction to the subject. We are motivated by the fact that there are large classes of ill-conditioned problems, and there are numerically unstable algorithms, and in either or both of these situations we cannot tolerate rounding errors during the numerical computations involved in obtaining solutions to the problems. Thus, it is important to study finite number systems for digital computers which have the property that computation can be performed free of rounding errors. In Chapter I we discuss single-modulus and multiple-modulus residue number systems and arithmetic in these systems, where the operands may be either integers or rational numbers. In Chapter II we discuss finite-segment p-adic number systems and their relationship to the p-adic numbers of Hensel 1908]. Each rational number in a certain finite set is assigned a unique Hensel code and arithmetic operations using Hensel codes as operands is mathe matically equivalent to those same arithmetic operations using the cor responding rational numbers as operands. Finite-segment p-adic arithmetic shares with residue arithmetic the property that it is free of rounding errors."

General

Imprint: Springer-Verlag New York
Country of origin: United States
Series: Monographs in Computer Science
Release date: September 2011
First published: 1984
Authors: R.T. Gregory • E.V. Krishnamurthy
Dimensions: 235 x 155 x 11mm (L x W x T)
Format: Paperback
Pages: 194
Edition: Softcover reprint of the original 1st ed. 1984
ISBN-13: 978-1-4612-9754-3
Categories: Books > Science & Mathematics > Mathematics > Numerical analysis
Books > Computing & IT > General theory of computing > Data structures
Books > Computing & IT > Computer programming > Algorithms & procedures
Books > Science & Mathematics > Mathematics > Applied mathematics > Mathematics for scientists & engineers
LSN: 1-4612-9754-0
Barcode: 9781461297543

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!

Partners