For purposes of numerical integration, differential equations are often modeled by finite-differences. However, these models raise a number of questions related to how the finite-difference schemes are to be constructed, the magnitude of the local truncation errors, the existence and elimination of numerical instabilities, etc. We prove a theorem which states that to each ordinary differential equation there corresponds an “exact” finite-difference scheme, i.e., the local truncation error is zero. This means that on the computational grid or lattice, the solution to the difference equation is exactly equal to the solution to the differential equation. We use the theorem to show, by means of a number of explicit examples, that the usual rules for constructing finite-difference schemes are “wrong.” Several modeling principles are presented, as well as their application to partial differential equations.
You may also like
A wealth of examples to which solutions are given permeate the text so the reader will certainly be active. The Mathematical Gazette This is the final book...
Probability, Stochastic Processes, and Queueing Theory The Mathematics of Computer Performance Modeling PDF
We will occasionally footnote a portion of text with a to indicate Notes on the that this portion can be initially bypassed. The reasons for bypassing a Text...
- Real Life Math Everyday Use of Mathematical Concepts PDF
- Good Questions Great Ways to Differentiate Mathematics Instruction, 2nd Edition PDF
- Good Questions Great Ways to Differentiate Mathematics Instruction in the Standards Based Classroom 3rd Edition PDF
- Synergy in Supramolecular Chemistry PDF
- Inorganic Materials Synthesis and Fabrication PDF