
Nguồn ngoài
Computational Physics
An introductory course in computational physics for upper-level undergraduates. Topics covered include numerical linear algebra, eigenvalue problems, sparse matrix problems, numerical integration and initial-value problems, Fourier transforms, and Monte Carlo simulations. Programming examples are based on Scientific Python.
- Tác giả
- Y. D. Chong
- Nhà xuất bản
- Nanyang Technological University
- Nguồn
- LibreTexts
- Giấy phép
- CC BY-SA
- Ngôn ngữ
- EN
- Danh mục
- Khoa học cơ bản
Mục lục· 57 mục
- 01: Scipy Tutorial
- 1.01: Preliminaries
- 1.02: Getting Started
- 1.03: Modularizing the Code
- 02: Scipy Tutorial (Part 2)
- 2.01: Sequential Data Structures
- 2.02: Improving the Program
- 03: Numbers Arrays and Scaling
- 3.01: A Model of Computing
- 3.02: Integers and Floating-Point Numbers
- 3.03: Arrays
- 3.04: Exercises
- 04: Numerical Linear Algebra
- 4.01: Array Representations of Vectors Matrices and Tensors
- 4.02: Linear Equations
- 4.03: Exercises
- 05: Gaussian Elimination
- 5.01: The Basic Algorithm
- 5.02: Matrix Generalization
- 5.03: Pivoting
- 5.04: LU Decomposition
- 06: Eigenvalue Problems
- 6.01: Basic Facts about Eigenvalue Problems
- 6.02: Numerical Eigensolvers
- 07: Finite-Difference Equations
- 7.01: Derivatives
- 7.02: Discretizing Partial Differential Equations
- 7.03: Higher Dimensions
- 08: Sparse Matrices
- 8.01: Sparse Matrix Algebra
- 8.02: Sparse Matrix Formats
- 8.03: Using Sparse Matrices
- 8.04: Example- Particle-in-a-Box Problem
- 09: Numerical Integration
- 9.01: Mid-Point Rule
- 9.02: Trapezium Rule
- 9.03: Simpson's Rule
- 9.04: Gaussian Quadratures
- 9.05: Monte Carlo Integration
- 10: Numerical Integration of ODEs
- 10.01: Example- Equations of Motion in Classical Mechanics
- 10.02: Forward Euler Method
- 10.03: Backward Euler Method
- 10.04: Adams-Moulton Method
- 10.05: Runge-Kutta Methods
- 10.06: Integrating ODEs with Scipy
- 11: Discrete Fourier Transforms
- 11.01: Conversion of Continuous Fourier Transform to DFT
- 11.02: Spectral Resolution and Range
- 11.03: The Split-Step Fourier Method
- 12: Markov Chains
- 12.01: The Simplest Markov Chain- The Coin-Flipping Game
- 12.02: General Description
- 12.03: The Ehrenfest Model
- 13: The Markov Chain Monte Carlo Method
- 13.01: Basic Formulation
- 13.02: The Ising Model