This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: LECTURE 14 Numerical Integration Numerical Integration proceeds from time t to the next time instant h t t + = where h is the step-size. For high accuracy, the step-size must be kept small. In the Runge-Kutta method of integrating ) , ( u x f dt x d = for example, the right hand-side )] ( ), ( [ t u t x f is evaluated 4 times at each step. Usually a test is made by the software regarding the accuracy of the predicted ) ( h t x + . If unsatisfactory, h is halved and )] ( ), ( [ t u t x f is evaluated 4 times again and tested for accuracy again. The procedure is repeatedly until the accuracy specified by the user is met. If the accuracy is too high, h is doubled. If the satisfactory step-size is 1 h , the next step begins with time 1 h t t + = and the numerical integration predicts ) ( 2 1 h h t x + + . This continues until the end-time of the integration specified by the user, at which point ) .... ( 2 1 N h h h t x + + + is predicted. A priori, it is not possible to know what step-sizes to use. Therefore, some exploratory tests are required. This consists of carrying on the simulation with an educated guess of h . Then h is reduced and if the second simulation shows that there are discrepancies, h must be reduced again and again until one is satisfied that h is fine enough. Of course, one can carry on the reverse test by increasing h if there is reason to believe that it is too fine and therefore wastefully time consuming....
View Full Document
This note was uploaded on 02/23/2010 for the course ECSE 462 taught by Professor Bon-tekooi during the Spring '09 term at McGill.
- Spring '09