Example: bankruptcy
Lecture Notes 4 Convergence Theory for Linear Methods
x 0 (x,t) x−at=x 0 t (a) Continuous problem x j x j−n x j+n (x j,t n) n (b) Numerical approximation Figure 1. The CFL condition. 2 Checking stability Checking stability of a scheme is usually the most difficult part when proving convergence.
Download Lecture Notes 4 Convergence Theory for Linear Methods
Information
Domain:
Source:
Link to this page:
Related search queries
Lecture notes, Economic Growth, Convergence and Divergence, Convergence and Divergence Lecture Notes, Lecture 18 : Improper integrals, LECTURE, Convergence of a Sequence, Monotone sequences, Convergence, REAL ANALYSIS LECTURE NOTES, Lecture 4 | September 11 4.1 Gradient Descent, Lecture 4 | September 11, NONLINEAR PROGRAMMING LECTURE 4, LECTURE 4 CONVERGENCE