Introductory Finite Difference Methods for PDEs

Recenze :
( 17 )
125 pages
This book presents finite difference methods for solving partial differential equations (PDEs) and also general concepts like stability, boundary conditions etc.
Toto je bezplatná eKniha pro studenty
Pro přístup zdarma se zaregistrujte
Všechny studentské knihy zdarma, navždy. Méně než 15% reklam
Prvních 30 dní zdarma
Byznys předplatné zdarma během prvních 30 dnů, pak $5.99/m

This book presents finite difference methods for solving partial differential equations (PDEs) and also general concepts like stability, boundary conditions etc. Material is in order of increasing complexity (from elliptic PDEs to hyperbolic systems) with related theory included in appendices. Each chapter has written and computer exercises with web links to worked solutions, programs, A/V presentations and case studies. Emphasis is on the practical and students are encouraged to do numerical experiments. This book is intended for undergraduates who know Calculus and introductory programming.

The following chapters contain core material supported by pen and paper exercises together with computer-based exercises where appropriate. In addition there are web links to:

- worked solutions,
- computer codes,
- audio-visual presentations,
- case studies,
- further reading.

Codes are written using Scilab (a Matlab clone, downloadable for free from and also Matlab.

The emphasis of this book is on the practical: students are encouraged to experiment with different input parameters and investigate outputs in the computer-based exercises. Theory is reduced to a necessary minimum and provided in appendices. Web links are found on the following web page:

This book is intended for final year undergraduates who have knowledge of Calculus and introductory level computer programming.

  1. Introduction
    1. Partial Differential Equations
    2. Solution to a Partial Differential Equation
    3. PDE Models
    4. Classification of PDEs
    5. Discrete Notation
    6. Checking Results
    7. Exercise 1
  2. Fundamentals
    1. Taylor’s Theorem
    2. Taylor’s Theorem Applied to the Finite Difference Method (FDM)
    3. Simple Finite Difference Approximation to a Derivative
    4. Example: Simple Finite Difference Approximations to a Derivative
    5. Constructing a Finite Difference Toolkit
    6. Simple Example of a Finite Difference Scheme
    7. Pen and Paper Calculation (very important)
    8. Exercise 2a
    9. Exercise 2b
  3. Elliptic Equations
    1. Introduction
    2. Finite Difference Method for Laplace’s Equation
    3. Setting up the Equations
    4. Grid Convergence
    5. Direct Solution Method
    6. Exercise 3a
    7. Iterative Solution Methods
    8. Jacobi Iteration
    9. Gauss-Seidel Iteration
    10. Exercise 3b
    11. Successive Over Relaxation (SoR) Method
    12. Line SoR
    13. Exercise 3c
  4. Hyperbolic Equations
    1. Introduction
    2. 1D Linear Advection Equation
    3. Results for the Simple Linear Advection Scheme
    4. Scheme Design
    5. Multi-Level Scheme Design
    6. Exercise 4a
    7. Implicit Schemes
    8. Exercise 4b
  5. Parabolic Equations: the Advection-Diffusion Equation
    1. Introduction
    2. Pure Diffusion
    3. Advection-Diffusion Equation
    4. Exercise 5b
  6. Extension to Multi-dimensions and Operator Splitting
    1. Introduction
    2. 2D Scheme Design (unsplit)
    3. Operator Splitting (Approximate Factorisation)
  7. Systems of Equations
    1. Introduction
    2. The Shallow Water Equations
    3. Solving the Shallow Water Equations
    4. Example Scheme to Solve the SWE
    5. Exercise 7
  8. Appendix A: Definition and Properties of Order
    1. Definition of O(h)
    2. The Meaning of O(h)
    3. Properties of O(h)
    4. Explanation of the Properties of O(h)
    5. Exercise A
  9. Appendix B: Boundary Conditions
    1. Introduction
    2. Boundary Conditions
    3. Specifying Ghost and Boundary Values
    4. Common Boundary Conditions
    5. Exercise B
  10. Appendix C: Consistency, Convergence and Stability
    1. Introduction
    2. Convergence
    3. Consistency and Scheme Order
    4. Stability
    5. Exercise C
  11. Appendix D: Convergence Analysis for Iterative Methods
    1. Introduction
    2. Jacobi Iteration
    3. Gauss-Seidel Iteration
    4. SoR Iterative Scheme
    5. Theory for Dominant Eigenvalues
    6. Rates of Convergence of Iterative Schemes
    7. Exercise D