Schaum's outline of theory and problems of numerical analysis (Schaum's outline series)
Francis J. Scheid
McGraw-Hill | ISBN: 0070552215 | January 1, 1989 | PDF (OCR) | 471 pages | 16878 KB
The objective of numerical analysis is to solve complex numerical problems using only the simple operations of arithmetic, to develop and evaluate methods for computing numerical results from given data. The methods of computation are called algorithms.
Our efforts will be focused on the search for algorithms. For some problems, no satisfactory algorithm has yet been found, while for others there are several and we must choose among them. There are various reasons for choosing one algorithm over another, two obvious criteria being speed an accuracy. Speed is clearly an advantage, though for problems of modest size this advantage is almost eliminated by the power of the computer. For large scale problems speed is still a major factor, and a slow algorithm may have to be rejected as impractical. However, other things being equal, the faster method surely gets the nod.
Publisher: McGraw-Hill Number Of Pages: 456 Publication Date: 1997-07-01 ISBN-10 / ASIN: 0070080208 ISBN-13 / EAN: 9780070080201
Product Description
Tackling the broad range of allocation problems that actually confront engineers, programmers and analysts in today's business and industrial worlds, this book takes readers step-by-step through all the mathematical programming techniques--including the trailblazing Karmarkar algorithm--needed to excel in any operations research course. It's easy to see why the first edition of this invaluable study guide sole more than 35,000 copies! It cuts down study time while it builds essential skills