KAUST DepartmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
Numerical Mathematics Group
Permanent link to this recordhttp://hdl.handle.net/10754/333640
MetadataShow full item record
AbstractIn practical computation with Runge--Kutta methods, the stage equations are not satisfied exactly, due to roundoff errors, algebraic solver errors, and so forth. We show by example that propagation of such errors within a single step can have catastrophic effects for otherwise practical and well-known methods. We perform a general analysis of internal error propagation, emphasizing that it depends significantly on how the method is implemented. We show that for a fixed method, essentially any set of internal stability polynomials can be obtained by modifying the implementation details. We provide bounds on the internal error amplification constants for some classes of methods with many stages, including strong stability preserving methods and extrapolation methods. These results are used to prove error bounds in the presence of roundoff or other internal errors.
CitationInternal Error Propagation in Explicit Runge--Kutta Methods 2014, 52 (5):2227 SIAM Journal on Numerical Analysis
SponsorsThe authors were supported by award FIC/2010/05 2000000231 made by KAUST.