Summary: This book acquaints students of science and engineering with the modern computer's potential for solving the numerical problems that will arise in their careers. It also gives students an opportunity to hone their skills in programming and problem solving. It helps them arrive at an understanding of the important subject of errors that inevitably accompany scientific computing and arms them with methods for detecting, predicting, and controlling these errors.
< ...show moreBR> Language-independent computer algorithms provide an emphasis on mathematical algorithms rather than on the computer language used to implement them.
Numerous solved examples, using either Maple V or MATLAB, illustrate just two of the powerful software tools available for symbolic, numeric, and graphical results.
Displayed pseudocode, coded in several programming languages, is available by anonymous ftp from ftp.brookscole.com.
Computer-code fragments and numerous examples make the material accessible to students.
A wide diversity of topics, including some advanced ones that play an important role in current scientific computing, give students a survey of numerical mathematics.
Two categories of problems enhance the text's versatility: "Problems" and "Computer Problems." The first category contains more than 800 exercises in analysis that require pencil, paper, and possibly a calculator. The second category includes about 450 problems that involve writing a program and testing it on the computer.
Suggested student projects stimulate students to go outside the text for additional information. Such projects provide experience in discovering recent research in the subject of numerical computation.
A long and detailed discussion of how to locate codes on the World Wide Web. This section gives pointers to the principal archives of software, especially software that is available without payment of fees.
Additional discussion of search methods for optimization problems are included. The Nelder-Meade Algorithm and the method of Simulated Annealing have been added.
Improved examples illustrate realistic problems in computing.
Many new problems of an analytic or computational nature give students practice.
A new section on iterative methods for solving large systems of linear equations has been added.
Additional explanatory material for difficult concepts appears throughout. This should be especially helpful for students engaged in solo study.
The authors have made many improvements to the pseudocode for all algorithms. The pseudocode can be readily turned into codes in C, C++, Fortran, Pascal, or other programming languages.
The authors have improved the arrangement of problems to put similar ones together.
The authors now cover additional material on classical polynomial interpolation, including the Neville algorithm.
Additional discussion of the current IEEE standards for floating-point operations in 32-bit machines has been added.
"I have to say that I have looked at a dozen or so books and [this] seems to be the best. Some of the best features: good choice of subjects, well written, virtually no misprints, easy to understand, many good examples . . . extensive and good choices of exercises and good answer book. [It] makes a good reference." Robert E. Funderlic, North Carolina State University "My overall impression is that [the text] presents the material more clearly, usually without unnecessary generality and without burying the ideas in too much notation. Students at this level can be 'blown away' just by notational matters. This book avoids this most of the time, especially when presenting the basic mathematical discussions of the numerical methods considered. I have also found the material devoted to the derivations of the methods very well written." Marcus Wright, Rowan College of New Jersey ...show less