Computer Methods in Physics

                This course is devoted to the “classic” computer or numerical methods useful in physics.  Fortran or C will be acquired along with the course if you do not already know one of these.  The course consists of a series of documents with links to C and Fortran code.  The documents attempt to explain specific numerical methods, while the codes provide templates for putting these into practice. 

                A Rosetta stone relating the topics covered in class to the appropriate sections in Press is BobPress.htm , or in compressed notation prefs.htm.  A more general set of references is in References.htm.

Topics

1.      Progdet\Welcome.htm – Programming details – Where to find a compiler, sorting, passing arrays, and so on.

a.       Progdet\SysRoutines – short codes that allow most Fortran compilers to be used for the same code.  Topics include system calls, overflow avoidance, opening files and others.

b.      Progdet\sorting – Logarithmic sorts and a direct access sort which allows the data to always remain in disk files.

c.       Progdet\ArrayPass – Details the use of the fact that A(7) is a pointer to the seventh array element.

2.      gplot\WELCOME.htm .DOC -  Sometimes you need your own software to see exactly what you need.

3.      definitions\Welcome.htm  Brief hints at the physics and mathematics underlying computer methods

a.       definitions\Random\Welcome.htm

b.      definitions\gofr – two body correlation functions

c.       definitions\PeriodBC – periodic boundary conditions.

4.      MultiplePrecision\Welcome.htm – When the easiest way to solve it is with more digits.

5.      interpolation\Welcome.htm – This includes the BLI a simple way to “find” the important region of a function.

a.       interpolation\Bli.doc .htm Best Linear Interpolator

b.      interpolation\Lagrange.doc .htm Most accurate interpolator

c.       interpolation\Locate.doc .htm  Needed for unevenly spaced data.

6.      Derivatives Numerical derivatives and the limits to their accuracy.

7.      integration\Welcome.htm

8.      solving\Welcome.htm finding f(x) = 0 – involves finding x.

9.      MatrixInverse\Welcome.htm Find xi such that εj ajixj = 0 for specified N΄N values of  aij

10.  optimization\Welcome.htm  finding f(x) less than all others. – involves finding f and x.

11.  Fittery\Welcome.htm Curve fitting

12.  Fourier\Welcome.doc .htm Fourier methods

13.  diffeqns

a.       diffeqns\shoot.doc .htm

b.      diffeqns\GreenFunctions.doc .htm

14.  WaveFunction\Welcome.htm