Microcomputer Algorithms: Action from Algebra
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.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Rootfinding 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
Other editions - View all
9 REM algebra algorithm analysis and program angular momentum applied approximants array assignment statement BASIC BETOSC Boolean function coefficients column computed convergence derivative eigencolumn eigenvalue calculation energy levels error series error term estimate even-parity example expectation value factor FIDIF finite difference FOLDER folding formula GENFIT gives GO SUB h4 error HYPOSC integral interp interpolation inverse involves iterative Killingbeck leading error LET S=0 loop Mathematical theory matrix eigenvalue problem matrix elements matrix H microcomputer modified MOMOSC Newton's method obtained off-diagonal elements parameter parity perturbation theory perturbed oscillator polynomial potential power series PRINT E,F produce Program analysis program Lines Programming notes quantity quantum mechanical radial Rayleigh quotient recurrence relation Richardson extrapolation Romberg root root-finding approach root-finding module ROOTSCAN Schrodinger equation SECANT sequence SERAT SEROSC simple Sinclair basic singularity Specimen results stored strip subroutine Table transformation TWODOSC variable wavefunction WYNN ZEEMAN zero
Page 226 - R, De Grand T and Sugar RL 1980 Phys. Rev. D 21 1055 Cho K, Arias TA, Joannopoulos JD and Lam PK 1993 Phys.
Page 227 - Fernandez FM, Meson AM and Castro EA 1985 J. Phys. A: Math. Gen. 18 1389 Feshbach H 1948 Phys.
Page 229 - Rosner W, Wunner G, Herold H and Ruder H 1984 /. Phys. B: At. Mol. Phys.
Page 227 - Grosjean A and Jolicard G 1987 J. Phys. B: At. Mol. Phys. 20 4635 Guttmann AJ 1977 Programming and Algorithms (London: Heinemann) Hajj FY 1982 J.
Page 228 - Killingbeck JP and Jones MN 1986 J. Phys. A: Math. Gen. 19 705 Killingbeck JP, Jones MN and Thompson MJ 1985 J.
Page 227 - Hautot A and Nicolas M 1983 J. Phys. A: Math. Gen. 16 2953 HavieT1966 BIT 624 1979 BIT 19204 Hikami S and Brezin E 1979 /. Phys.