Solving Systems of Linear Algebraic Equations Using Residue Arithmetic
Author : Jo Ann Shaw Howell
Publisher :
Page : 60 pages
File Size : 34,75 MB
Release : 1969
Category : Equations, Simultaneous
ISBN :
Author : Jo Ann Shaw Howell
Publisher :
Page : 60 pages
File Size : 34,75 MB
Release : 1969
Category : Equations, Simultaneous
ISBN :
Author : Alston Scott Householder
Publisher :
Page : 552 pages
File Size : 38,16 MB
Release : 1972
Category : Algebra
ISBN :
Author :
Publisher :
Page : 834 pages
File Size : 21,21 MB
Release : 1971
Category : Military research
ISBN :
Author :
Publisher :
Page : 1508 pages
File Size : 19,30 MB
Release : 1969
Category : Aeronautics
ISBN :
Author : David M. Young
Publisher : Courier Corporation
Page : 562 pages
File Size : 43,12 MB
Release : 1988-01-01
Category : Mathematics
ISBN : 0486656918
Volume I of two-volume set offers broad self-contained coverage of computer-oriented numerical algorithms for solving mathematical problems related to linear algebra, ordinary and partial differential equations, and much more. 1972 edition.
Author :
Publisher :
Page : 372 pages
File Size : 19,81 MB
Release : 1979
Category : Computer science
ISBN :
Author : David M. Young, Robert Todd Gregory
Publisher :
Page : 676 pages
File Size : 44,87 MB
Release : 1973
Category :
ISBN :
Author : R. T. Gregory
Publisher : Springer Science & Business Media
Page : 204 pages
File Size : 50,10 MB
Release : 2012-12-06
Category : Mathematics
ISBN : 1461252423
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.
Author :
Publisher :
Page : 784 pages
File Size : 14,74 MB
Release : 1969-10
Category : Science
ISBN :
Author : Association for Computing Machinery
Publisher :
Page : 716 pages
File Size : 34,64 MB
Release : 1980
Category : ALGOL (Computer program language)
ISBN :