Microcomputer Algorithms: Action from Algebra / Edition 1

by John Killingbeck

Overview

Although the computing facilities available to scientists are becoming more powerful, the problems they are addressing are increasingly complex. The mathematical methods for simplifying the computing procedures are therefore as important as ever. Microcomputer Algorithms: Action from Algebra stresses the mathematical basis behind the use of many algorithms of computational mathematics, providing detailed descriptions on how to generate algorithms for a large number of different uses.

Covering a wide range of mathematical and physical applications, the book contains the theory of 25 algorithms. The mathematical theory for each algorithm is described in detail prior to discussing the algorithm in full, with complete program listings. The book presents the algorithms in modular form, allowing for easy interpretation, for the adaptation to readers'specific requirements without difficulty, and for use with various microcomputers.

Blending mathematics and programming in one volume, this book will be of broad interest to all scientists and engineers, particularly those physicists using microcomputers for scientific problem handling. Students handling numerical data for research projects will also find the book useful.

Product Details

ISBN-13:	9780750300971
Publisher:	Taylor & Francis
Publication date:	01/01/1991
Pages:	252
Product dimensions:	6.12(w) x 9.19(h) x (d)

About the Author

John Killing beck has wrinen some eighty scientific publications, including five books. His publications range over the fields of group theory, perturbation theory and microcomputer numerical algorithms. He has been a visiting professor at the Universities of Guelph ( 197 4) and Besancon ( 1991). He was a Reader in Theoretical Physics at the University of Hull, where his plan to redeploy to computer science was halted by his enforced early retirement in 1989. He currently works part-time in the School of Mathematics at Hull, and intends to extend his freelance lecturing and writing activities.

Table of Contents

General introduction. Root-finding methods and their application. The Richardson extrapolation method. Some interpolation and extrapolation methods. The matrix inverse and generalized inverse. The matrix eigenvalue problem. Two perturbation methods. Finite difference eigenvalue calculations. Recurrence relation methods. Two research problems.

Editorial Reviews

"… a practical and valuable resource for researchers and teachers in scientific or mathematical computing who wish to use, or to explain to others, the specific and useful microprogramming style … for using small capacity computer systems more efficiently. A number of new and unorthodox methods are introduced and some algorithms have characteristics which have yet to be fully explored. This aspect will add spice to the appeal of the book to researchers in numerical methods generally."
-The Australian Computer Journal

From the Publisher