Cover image for An introduction to computational physics
Title:
An introduction to computational physics
Personal Author:
Edition:
2nd ed.
Publication Information:
Cambridge : Cambridge University Press, 2006
ISBN:
9780521825696

Available:*

Library
Item Barcode
Call Number
Material Type
Item Category 1
Status
Searching...
30000010105534 QC20.7.E4 P36 2006 Open Access Book Book
Searching...

On Order

Summary

Summary

Thoroughly revised for its second edition, this advanced textbook provides an introduction to the basic methods of computational physics, and an overview of progress in several areas of scientific computing by relying on free software available from CERN. The book begins by dealing with basic computational tools and routines, covering approximating functions, differential equations, spectral analysis, and matrix operations. Important concepts are illustrated by relevant examples at each stage. The author also discusses more advanced topics, such as molecular dynamics, modeling continuous systems, Monte Carlo methods, genetic algorithm and programming, and numerical renormalization. It includes many more exercises. This can be used as a textbook for either undergraduate or first-year graduate courses on computational physics or scientific computation. It will also be a useful reference for anyone involved in computational research.


Reviews 1

Choice Review

Many graduate students and advanced undergraduates need some background in computational physics. This new edition (1st ed., CH, May'98, 35-5142) could be used as a resource for a one- or two-semester course, or for a reading course. Pang covers standard topics such as ordinary differential equations, matrix methods, partial differential equations, molecular dynamics, and Monte Carlo methods, as well as some less usual advanced topics including wavelet analysis, genetic algorithms, and the numerical renormalization group. Each topic is treated briefly but clearly. Experienced researchers will enjoy browsing the many topics discussed. Two related areas where this book is weak are algorithm selection and computational cost. For example, the Faddeev-Leverrier method for matrix inversion and determination of eigenvalues is discussed, but there is no discussion of its usefulness or its time and memory requirements compared to better-known algorithms. The implementation language used for example programs is Java, but there should not be too much difficulty in adapting to a different language in the C/C++ family. This is a good choice for advanced computational physics classes, and should be in the library of institutions where computational physics is done. ^BSumming Up: Recommended. Upper-division undergraduates through professionals. M. C. Ogilvie Washington University


Table of Contents

Preface to first editionp. xi
Prefacep. xiii
Acknowledgmentsp. xv
1 Introductionp. 1
1.1 Computation and sciencep. 1
1.2 The emergence of modern computersp. 4
1.3 Computer algorithms and languagesp. 7
Exercisesp. 14
2 Approximation of a functionp. 16
2.1 Interpolationp. 16
2.2 Least-squares approximationp. 24
2.3 The Millikan experimentp. 27
2.4 Spline approximationp. 30
2.5 Random-number generatorsp. 37
Exercisesp. 44
3 Numerical calculusp. 49
3.1 Numerical differentiationp. 49
3.2 Numerical integrationp. 56
3.3 Roots of an equationp. 62
3.4 Extremes of a functionp. 66
3.5 Classical scatteringp. 70
Exercisesp. 76
4 Ordinary differential equationsp. 80
4.1 Initial-value problemsp. 81
4.2 The Euler and Picard methodsp. 81
4.3 Predictor-corrector methodsp. 83
4.4 The Runge-Kutta methodp. 88
4.5 Chaotic dynamics of a driven pendulump. 90
4.6 Boundary-value and eigenvalue problemsp. 94
4.7 The shooting methodp. 96
4.8 Linear equations and the Sturm-Liouville problemp. 99
4.9 The one-dimensional Schrodinger equationp. 105
Exercisesp. 115
5 Numerical methods for matricesp. 119
5.1 Matrices in physicsp. 119
5.2 Basic matrix operationsp. 123
5.3 Linear equation systemsp. 125
5.4 Zeros and extremes of multivariable functionsp. 133
5.5 Eigenvalue problemsp. 138
5.6 The Faddeev-Leverrier methodp. 147
5.7 Complex zeros of a polynomialp. 149
5.8 Electronic structures of atomsp. 153
5.9 The Lanczos algorithm and the many-body problemp. 156
5.10 Random matricesp. 158
Exercisesp. 160
6 Spectral analysisp. 164
6.1 Fourier analysis and orthogonal functionsp. 165
6.2 Discrete Fourier transformp. 166
6.3 Fast Fourier transformp. 169
6.4 Power spectrum of a driven pendulump. 173
6.5 Fourier transform in higher dimensionsp. 174
6.6 Wavelet analysisp. 175
6.7 Discrete wavelet transformp. 180
6.8 Special functionsp. 187
6.9 Gaussian quadraturesp. 191
Exercisesp. 193
7 Partial differential equationsp. 197
7.1 Partial differential equations in physicsp. 197
7.2 Separation of variablesp. 198
7.3 Discretization of the equationp. 204
7.4 The matrix method for difference equationsp. 206
7.5 The relaxation methodp. 209
7.6 Groundwater dynamicsp. 213
7.7 Initial-value problemsp. 216
7.8 Temperature field of a nuclear waste rodp. 219
Exercisesp. 222
8 Molecular dynamics simulationsp. 226
8.1 General behavior of a classical systemp. 226
8.2 Basic methods for many-body systemsp. 228
8.3 The Verlet algorithmp. 232
8.4 Structure of atomic clustersp. 236
8.5 The Gear predictor-corrector methodp. 239
8.6 Constant pressure, temperature, and bond lengthp. 241
8.7 Structure and dynamics of real materialsp. 246
8.8 Ab initio molecular dynamicsp. 250
Exercisesp. 254
9 Modeling continuous systemsp. 256
9.1 Hydrodynamic equationsp. 256
9.2 The basic finite element methodp. 258
9.3 The Ritz variational methodp. 262
9.4 Higher-dimensional systemsp. 266
9.5 The finite element method for nonlinear equationsp. 269
9.6 The particle-in-cell methodp. 271
9.7 Hydrodynamics and magnetohydrodynamicsp. 276
9.8 The lattice Boltzmann methodp. 279
Exercisesp. 282
10 Monte Carlo simulationsp. 285
10.1 Sampling and integrationp. 285
10.2 The Metropolis algorithmp. 287
10.3 Applications in statistical physicsp. 292
10.4 Critical slowing down and block algorithmsp. 297
10.5 Variational quantum Monte Carlo simulationsp. 299
10.6 Green's function Monte Carlo simulationsp. 303
10.7 Two-dimensional electron gasp. 307
10.8 Path-integral Monte Carlo simulationsp. 313
10.9 Quantum lattice modelsp. 315
Exercisesp. 320
11 Genetic algorithm and programmingp. 323
11.1 Basic elements of a genetic algorithmp. 324
11.2 The Thomson problemp. 332
11.3 Continuous genetic algorithmp. 335
11.4 Other applicationsp. 338
11.5 Genetic programmingp. 342
Exercisesp. 345
12 Numerical renormalizationp. 347
12.1 The scaling conceptp. 347
12.2 Renormalization transformp. 350
12.3 Critical phenomena: the Ising modelp. 352
12.4 Renormalization with Monte Carlo simulationp. 355
12.5 Crossover: the Kondo problemp. 357
12.6 Quantum lattice renormalizationp. 360
12.7 Density matrix renormalizationp. 364
Exercisesp. 367
Referencesp. 369
Indexp. 381