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 edition | p. xi |
Preface | p. xiii |
Acknowledgments | p. xv |
1 Introduction | p. 1 |
1.1 Computation and science | p. 1 |
1.2 The emergence of modern computers | p. 4 |
1.3 Computer algorithms and languages | p. 7 |
Exercises | p. 14 |
2 Approximation of a function | p. 16 |
2.1 Interpolation | p. 16 |
2.2 Least-squares approximation | p. 24 |
2.3 The Millikan experiment | p. 27 |
2.4 Spline approximation | p. 30 |
2.5 Random-number generators | p. 37 |
Exercises | p. 44 |
3 Numerical calculus | p. 49 |
3.1 Numerical differentiation | p. 49 |
3.2 Numerical integration | p. 56 |
3.3 Roots of an equation | p. 62 |
3.4 Extremes of a function | p. 66 |
3.5 Classical scattering | p. 70 |
Exercises | p. 76 |
4 Ordinary differential equations | p. 80 |
4.1 Initial-value problems | p. 81 |
4.2 The Euler and Picard methods | p. 81 |
4.3 Predictor-corrector methods | p. 83 |
4.4 The Runge-Kutta method | p. 88 |
4.5 Chaotic dynamics of a driven pendulum | p. 90 |
4.6 Boundary-value and eigenvalue problems | p. 94 |
4.7 The shooting method | p. 96 |
4.8 Linear equations and the Sturm-Liouville problem | p. 99 |
4.9 The one-dimensional Schrodinger equation | p. 105 |
Exercises | p. 115 |
5 Numerical methods for matrices | p. 119 |
5.1 Matrices in physics | p. 119 |
5.2 Basic matrix operations | p. 123 |
5.3 Linear equation systems | p. 125 |
5.4 Zeros and extremes of multivariable functions | p. 133 |
5.5 Eigenvalue problems | p. 138 |
5.6 The Faddeev-Leverrier method | p. 147 |
5.7 Complex zeros of a polynomial | p. 149 |
5.8 Electronic structures of atoms | p. 153 |
5.9 The Lanczos algorithm and the many-body problem | p. 156 |
5.10 Random matrices | p. 158 |
Exercises | p. 160 |
6 Spectral analysis | p. 164 |
6.1 Fourier analysis and orthogonal functions | p. 165 |
6.2 Discrete Fourier transform | p. 166 |
6.3 Fast Fourier transform | p. 169 |
6.4 Power spectrum of a driven pendulum | p. 173 |
6.5 Fourier transform in higher dimensions | p. 174 |
6.6 Wavelet analysis | p. 175 |
6.7 Discrete wavelet transform | p. 180 |
6.8 Special functions | p. 187 |
6.9 Gaussian quadratures | p. 191 |
Exercises | p. 193 |
7 Partial differential equations | p. 197 |
7.1 Partial differential equations in physics | p. 197 |
7.2 Separation of variables | p. 198 |
7.3 Discretization of the equation | p. 204 |
7.4 The matrix method for difference equations | p. 206 |
7.5 The relaxation method | p. 209 |
7.6 Groundwater dynamics | p. 213 |
7.7 Initial-value problems | p. 216 |
7.8 Temperature field of a nuclear waste rod | p. 219 |
Exercises | p. 222 |
8 Molecular dynamics simulations | p. 226 |
8.1 General behavior of a classical system | p. 226 |
8.2 Basic methods for many-body systems | p. 228 |
8.3 The Verlet algorithm | p. 232 |
8.4 Structure of atomic clusters | p. 236 |
8.5 The Gear predictor-corrector method | p. 239 |
8.6 Constant pressure, temperature, and bond length | p. 241 |
8.7 Structure and dynamics of real materials | p. 246 |
8.8 Ab initio molecular dynamics | p. 250 |
Exercises | p. 254 |
9 Modeling continuous systems | p. 256 |
9.1 Hydrodynamic equations | p. 256 |
9.2 The basic finite element method | p. 258 |
9.3 The Ritz variational method | p. 262 |
9.4 Higher-dimensional systems | p. 266 |
9.5 The finite element method for nonlinear equations | p. 269 |
9.6 The particle-in-cell method | p. 271 |
9.7 Hydrodynamics and magnetohydrodynamics | p. 276 |
9.8 The lattice Boltzmann method | p. 279 |
Exercises | p. 282 |
10 Monte Carlo simulations | p. 285 |
10.1 Sampling and integration | p. 285 |
10.2 The Metropolis algorithm | p. 287 |
10.3 Applications in statistical physics | p. 292 |
10.4 Critical slowing down and block algorithms | p. 297 |
10.5 Variational quantum Monte Carlo simulations | p. 299 |
10.6 Green's function Monte Carlo simulations | p. 303 |
10.7 Two-dimensional electron gas | p. 307 |
10.8 Path-integral Monte Carlo simulations | p. 313 |
10.9 Quantum lattice models | p. 315 |
Exercises | p. 320 |
11 Genetic algorithm and programming | p. 323 |
11.1 Basic elements of a genetic algorithm | p. 324 |
11.2 The Thomson problem | p. 332 |
11.3 Continuous genetic algorithm | p. 335 |
11.4 Other applications | p. 338 |
11.5 Genetic programming | p. 342 |
Exercises | p. 345 |
12 Numerical renormalization | p. 347 |
12.1 The scaling concept | p. 347 |
12.2 Renormalization transform | p. 350 |
12.3 Critical phenomena: the Ising model | p. 352 |
12.4 Renormalization with Monte Carlo simulation | p. 355 |
12.5 Crossover: the Kondo problem | p. 357 |
12.6 Quantum lattice renormalization | p. 360 |
12.7 Density matrix renormalization | p. 364 |
Exercises | p. 367 |
References | p. 369 |
Index | p. 381 |