Explanations 
Textbooks 
Flashcards 
91影视 AI 
Notes 
Study Plans 
Study Sets 
Find a degree 
Magazine Chapter 3: Q18E (page 131)
Local versus Global Error. In deriving formula (4) for Euler鈥檚 method, a rectangle was used to approximate the area under a curve (see Figure 3.14). With
\({\bf{g(t) = f(t,f(t))}}\), this approximation can be written as \(\int\limits_{{{\bf{x}}_{\bf{n}}}}^{{{\bf{x}}_{{\bf{n + 1}}}}} {{\bf{g(t)dt}} \approx {\bf{hg(}}{{\bf{x}}_{\bf{n}}}{\bf{)}}} \)where \({\bf{h = }}{{\bf{x}}_{{\bf{n + 1}}}}{\bf{ - }}{{\bf{x}}_{\bf{n}}}\) .
- Show that if g has a continuous derivative that is bounded in absolute value by B, then the rectangle approximation has error\(\left( {\bf{O}} \right){{\bf{h}}^{\bf{2}}}\); that is, for some constant M, \(\left| {\int\limits_{{{\bf{x}}_{\bf{n}}}}^{{{\bf{x}}_{{\bf{n + 1}}}}} {{\bf{g(t)dt - hg(}}{{\bf{x}}_{\bf{n}}}{\bf{)}}} } \right| \le {\bf{M}}{{\bf{h}}^{\bf{2}}}\).This is called the local truncation error of the scheme. [Hint: Write \(\int\limits_{{{\bf{x}}_{\bf{n}}}}^{{{\bf{x}}_{{\bf{n + 1}}}}} {{\bf{g(t)dt - hg(}}{{\bf{x}}_{\bf{n}}}{\bf{)}}} {\bf{ = }}\int\limits_{{{\bf{x}}_{\bf{n}}}}^{{{\bf{x}}_{{\bf{n + 1}}}}} {\left[ {{\bf{g(t)dt - g(}}{{\bf{x}}_{\bf{n}}}{\bf{)}}} \right]{\bf{dt}}} \). Next, using the mean value theorem, show that\(\left| {{\bf{g(t)dt - g(}}{{\bf{x}}_{\bf{n}}}{\bf{)}}} \right| \le {\bf{B}}\left| {{\bf{t - }}{{\bf{x}}_{\bf{n}}}} \right|\) . Then integrate to obtain the error bound\(\left( {\frac{{\bf{B}}}{{\bf{2}}}} \right){{\bf{h}}^{\bf{2}}}\).]
- In applying Euler鈥檚 method, local truncation errors occur in each step of the process and are propagated throughout the further computations. Show that the sum of the local truncation errors in part (a) that arise after n steps is (O)h. This is the global error, which is the same as the[ss1] [m2] convergence rate of Euler鈥檚 method.
Short Answer
Expert verified
- The required result gets by the mean value theorem i.e., \(\left| {\int\limits_{{x_n}}^{{x_{n + 1}}} {g\,\left( t \right)\,dt - hg\,\left( {{x_n}} \right)} } \right| \le M\,{h^2}\).
- The sum of the local truncation error arises after n steps i.e., \(O\left( h \right)\).
Step by step solution
Over 30 million students worldwide already upgrade their learning with 91影视!
