This preview shows page 1. Sign up to view the full content.
Unformatted text preview: andPrince method was designed for this purpose. For this problem, which has a smooth
; ; 53 Figure 3.5.2: Accuracy vs. e ort for several explicit RungeKutta methods 16]. 54 solution, the DormandPrince method is nearly a factor of 10 more accurate with local
extrapolation than without it.
Numerous other implementation details have not been addressed. These include (i)
Newton iteration for implicit systems and (ii) portability. We will return to these topics
when discussing multistep methods in Chapter 5. While we have not discussed competing methods, we'll nevertheless conclude that explicit RungeKutta formulas should be
considered when
1. the functions de ning the di erential system are simple or
2. the solution has discontinuities.
The latter case is interesting. Discontinuities can be ignored and treated with the automatic stepsize selection procedures. This is easier to do with RungeKutta methods
than with competing approaches such as multistep methods. Explicit treatment of discontinuities b...
View
Full
Document
 Spring '14
 JosephE.Flaherty

Click to edit the document details